Double-bracket quantum algorithms for high-fidelity ground state preparation
Matteo Robbiati, Edoardo Pedicillo, Andrea Pasquale, Xiaoyue Li, Oriel Kiss, Andrew Wright, Renato M. S. Farias, Khanh Uyen Giang, Jeongrak Son, Johannes Knörzer, Siong Thye Goh, Jun Yong Khoo, Nelly H. Y. Ng, Zoë Holmes, Stefano Carrazza, Marek Gluza
TL;DR
This work introduces and assesses double-bracket quantum algorithms (DBQAs) as a practical route to high-fidelity ground-state preparation on near-term quantum hardware. By combining a short warm-start circuit with DBQA refinements—grounded in Brockett’s double-bracket flows and implemented via product-form exponentials—the approach yields exponential convergence toward diagonalization with controllable gate costs. Numerical studies on XXZ/XXZ-like Hamiltonians show substantial energy reductions and fidelity gains, while hardware experiments on IBM devices and emulations for Quantinuum platforms illustrate tangible near-term advantages and platform-dependent benefits. The results suggest DBQAs can serve as a versatile, hardware-aware unitary synthesis method, potentially bridging the gap between variational methods and fault-tolerant techniques, and may be extended as warm-starts for broader quantum algorithms. Overall, the work demonstrates that warm-started DBQAs can significantly improve ground-state approximations with realistic gate counts, offering a promising path for early fault-tolerant quantum computing and hybrid quantum-classical workflows.
Abstract
Ground state preparation is a central application for quantum computers but remains challenging in practice. In this work, we quantitatively investigate the performance and gate counts of double-bracket quantum algorithms (DBQAs) for ground state preparation. We propose a practical strategy in which DBQAs refine initial state preparation circuits, and we compile them for Heisenberg chains using controlled-Z and single-qubit gates. Warm-started DBQAs consistently improve both the energy and ground-state fidelity relative to the initial states provided by variational ansätze, indicating that DBQAs offer an effective unitary synthesis method. To demonstrate compatibility with near-term hardware, we executed a proof-of-concept example on IBM devices. With error mitigation, we observed a statistically significant improvement over the corresponding warm-start circuit. Furthermore, numerical emulations for the same system size indicate that executing DBQAs on Quantinuum's hardware could achieve similar cost-function gains without requiring error mitigation. These findings suggest that DBQAs are a promising approach for enhancing ground-state approximations on near-term quantum devices.
