Metraipolis › archive › dc_812e4cd19f8e
Optimal Quantum Algorithm for Ground-State Energy Estimation with a Guiding State — arXiv:2608.24494
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.24494
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T07:03:51.780Z
- SHA-256 of the archived text
851615f2c1588155ee1a317529a378c7e81366406046a474b18ac4d934fcf2b3- Stable URL of this page
https://metraipolis.com/documento/dc_812e4cd19f8e
How to cite
Optimal Quantum Algorithm for Ground-State Energy Estimation with a Guiding State — arXiv:2608.24494 — arXiv (en), https://arxiv.org/abs/2608.24494 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_812e4cd19f8e (Metraipolis archive dc_812e4cd19f8e, sha256 851615f2c1588155ee1a317529a378c7e81366406046a474b18ac4d934fcf2b3)
BibTeX
@misc{dc812e4cd19f8e,
title = {Optimal Quantum Algorithm for Ground-State Energy Estimation with a Guiding State — arXiv:2608.24494},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.24494},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_812e4cd19f8e; sha256 851615f2c1588155ee1a317529a378c7e81366406046a474b18ac4d934fcf2b3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24494. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In the problem of ground-state energy estimation, one aims to estimate the smallest eigenvalue of a Hamiltonian, often given a guiding state, with some promised overlap $\gamma$ with the ground space. The main approach to this problem is to simulate its evolution, and estimate the smallest (or equivalently, largest) eigenphase of the resulting unitary $U$. We give a quantum algorithm that estimates the largest eigenphase of a unitary $U$ in this guided setting using a factor of $\log\frac{1}{\gamma}$ fewer queries to $U$ than the previous best approach. The result matches an existing lower bound, and answers an open question from Mande and de Wolf. The algorithm is based on transducers, which often allow composition of quantum algorithms without overhead from error reduction.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-26 in cs.DS).
Categorie arXiv: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.24494 — 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-18T07:01:33.505Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).