arXiv · 2611.22774
Double-Bracket Quantum Algorithms for Preparing Multiple Excited States
Abstract
Many problems in quantum chemistry, many-body physics, and optimization require excited states of a Hamiltonian. Double-bracket quantum algorithms compile circuits recursively from evolutions under the Hamiltonian and a second operator, without a parameterized ansatz. They have been proposed for several tasks, such as diagonalization and the preparation of ground and thermal states. In this work, we extend this framework to excited states. Combining the ensemble approach with double-bracket flows, we introduce the Double-Bracket quantum algorithm for Multiple EXcited states (DB-MEX), which evolves $p+1$ orthonormal states toward low-lying eigenstates of the Hamiltonian with a single recursively compiled quantum circuit, so they remain orthonormal by construction. The circuit approximates a double-bracket flow of a weighted sum of projectors onto the evolving states, whose number and weights are design parameters. The number of states sets the highest targeted excited state, and the weights determine whether the algorithm prepares the $p+1$ lowest eigenstates, only the $p$-th excited state, or only the span of the $p+1$ lowest eigenstates. In the latter case, a post-processing step recovers the individual eigenstates from their span. We show that the double-bracket flow and, for small step sizes, its discretization converge to the target for almost all initial states, with explicit local rates given by products of weight and energy gaps.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Salahuddin Abdul Rahman, Özkan Karabacak, Rafal Wisniewski. 2026-11-17. Double-Bracket Quantum Algorithms for Preparing Multiple Excited States. https://searcharxiv.com/abs/2611.22774
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.