Metraipolis › archive › dc_e426e0882fe2
Breaking the Shot-Noise Barrier: Cached Recycled Variance-Reduced Gradients for Quantum Optimization — arXiv:2609.38800
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38800
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:11:35.933Z
- SHA-256 of the archived text
66be5fa5c0ad1cff3eed7eaa57552e1f56f240f190c38a7da6231456105bcc03- Stable URL of this page
https://metraipolis.com/documento/dc_e426e0882fe2
How to cite
Breaking the Shot-Noise Barrier: Cached Recycled Variance-Reduced Gradients for Quantum Optimization — arXiv:2609.38800 — arXiv (en), https://arxiv.org/abs/2609.38800 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e426e0882fe2 (Metraipolis archive dc_e426e0882fe2, sha256 66be5fa5c0ad1cff3eed7eaa57552e1f56f240f190c38a7da6231456105bcc03)
BibTeX
@misc{dce426e0882fe2,
title = {Breaking the Shot-Noise Barrier: Cached Recycled Variance-Reduced Gradients for Quantum Optimization — arXiv:2609.38800},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38800},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e426e0882fe2; sha256 66be5fa5c0ad1cff3eed7eaa57552e1f56f240f190c38a7da6231456105bcc03},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38800. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Variational Quantum Algorithms (VQAs) rely heavily on classical optimization routines to navigate high-dimensional, noisy parameter landscapes. However, the evaluation of analytical gradients via the parameter-shift rule requires $\mathcal{O}(p)$ circuit executions, rendering this approach computationally prohibitive for deep circuits. While simultaneous perturbation methods provide an $\mathcal{O}(1)$ alternative, their gradient estimates suffer from severe $\mathcal{O}(p)$ spatial variance, which impedes convergence. To resolve this tension, we introduce the Cached Recycled Variance-Reduced Gradient (CRVG) by leveraging variance reduction techniques. We formulate two variants: a 3-Circuit (1-Sided) Non-Recursive CRVG and a Recursive CRVG. By introducing a center-point caching mechanism, the 3-Circuit CRVG mathematically recycles quantum measurements to reduce the inner-loop circuit complexity by 25\% across both variants. We establish a theoretical separation between the two routing paths to achieve an $\epsilon^2$-stationary point: the non-recursive variant reaches a sample complexity of $\mathcal{O}(\max\{p/\epsilon^2, p^{2/3}/\epsilon^{10/3}\})$, while the recursive variant achieves an improved complexity of $\mathcal{O}(\max\{p/\epsilon^2, \sqrt{p}/\epsilon^3\})$. Empirically, extensive evaluations on MaxCut and Maximum Independent Set (MIS) benchmarks validate these findings. While standard simultaneous perturbation remains a robust baseline across varying depths, CRVG demonstrates targeted advantages in specific amortizable regimes, such as the non-recursive variant on EfficientSU2 circuits and both variants on depth-three QAOA, yielding superior energy minimums and tighter output variances. Ultimately, CRVG establishes a principled bias-throughput trade-off for scaling near-term quantum optimization.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.OC).
Categorie arXiv: Quantum Physics (quant-ph) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.38800 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:03:18.282Z dalla pagina https://arxiv.org/catchup/math.OC/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).