Metraipolis › archive › dc_2428bb26e65f
A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth — arXiv:2609.37095
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.37095
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T19:26:38.420Z
- SHA-256 of the archived text
334ef7b2887ea5648bebd363571dc7711e22de9facb9b9a054371e5c385d902c- Stable URL of this page
https://metraipolis.com/documento/dc_2428bb26e65f
How to cite
A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth — arXiv:2609.37095 — arXiv (en), https://arxiv.org/abs/2609.37095 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2428bb26e65f (Metraipolis archive dc_2428bb26e65f, sha256 334ef7b2887ea5648bebd363571dc7711e22de9facb9b9a054371e5c385d902c)
BibTeX
@misc{dc2428bb26e65f,
title = {A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth — arXiv:2609.37095},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.37095},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2428bb26e65f; sha256 334ef7b2887ea5648bebd363571dc7711e22de9facb9b9a054371e5c385d902c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37095. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Imaginary-time evolution (ITE) is a widely used technique for preparing the ground state of a target Hamiltonian. Building on the recently proposed framework of Double-Bracket quantum ITE (DB-QITE), we introduce a probabilistic variant (PDBQITE) that achieves an exponential reduction in circuit depth. Our algorithm requires only a single ancilla qubit and a quantum circuit that consists of one controlled real-time evolution and one mid-circuit measurement per iteration. The trade-off is an exponential decay of the total success probability with the number of iterations, for which we derive an analytical lower bound that is independent of system size. Our numerical simulations show that the per-step success probability remains close to unity, making it realistic to execute many iterations, thus providing a substantial improvement over prior constructions. We show that PDBQITE outperforms the near-term probabilistic algorithm PITE for ground-state preparation of molecular Hamiltonians, and that a hybrid QAOA-PDBQITE scheme achieves higher approximation ratios than QAOA at the same circuit depth on random regular graphs for the MaxCut problem. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-30 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.37095 — 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-07T18:55:50.574Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).