A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth

@misc{kolotouros2026quantum,
  title = {{A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth}},
  author = {Ioannis Kolotouros and Raul Garcia-Patron},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.37095},
  eprint = {2609.37095},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.37095},
}

TY  - UNPB
TI  - A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth
AU  - Ioannis Kolotouros
AU  - Raul Garcia-Patron
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.37095
UR  - https://arxiv.org/abs/2609.37095
AB  - 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.
ER  -