Jeffery Yu, Javier Robledo Moreno, Joseph Iosue, Luke Bertels, Daniel Claudino, Bryce Fuller, Peter Groszkowski, Travis S. Humble, Petar Jurcevic, William Kirby, Thomas A. Maier, Mario Motta, Bibek Pokharel, Alireza Seif, Amir Shehata, Kevin J. Sung, Minh C. Tran, Vinay Tripathi, Antonio Mezzacapo, Kunal Sharma (Jan 17 2025).

Abstract: Approximating the ground state of many-body systems is a key computational bottleneck underlying important applications in physics and chemistry. It has long been viewed as a promising application for quantum computers. The most widely known quantum algorithm for ground state approximation, quantum phase estimation, is out of reach of current quantum processors due to its high circuit-depths. Quantum diagonalization algorithms based on subspaces represent alternatives to phase estimation, which are feasible for pre-fault-tolerant and early-fault-tolerant quantum computers. Here, we introduce a quantum diagonalization algorithm which combines two key ideas on quantum subspaces: a classical diagonalization based on quantum samples, and subspaces constructed with quantum Krylov states. We prove that our algorithm converges in polynomial time under the working assumptions of Krylov quantum diagonalization and sparseness of the ground state. We then show numerical investigations of lattice Hamiltonians, which indicate that our method can outperform existing Krylov quantum diagonalization in the presence of shot noise, making our approach well-suited for near-term quantum devices. Finally, we carry out the largest ground-state quantum simulation of the single-impurity Anderson model on a system with $41$ bath sites, using $85$ qubits and up to $6 \cdot 10^3$ two-qubit gates on a Heron quantum processor, showing excellent agreement with density matrix renormalization group calculations.

Arxiv: https://arxiv.org/abs/2501.09702