Analysis of quantum Krylov algorithms with errors

Abstract

This work provides a nonasymptotic error analysis of quantum Krylov algorithms based on real-time evolutions, subject to generic errors in the outputs of the quantum circuits. We prove upper and lower bounds on the resulting ground state energy estimates, and the error associated to the upper bound is linear in the input error rates. This resolves a misalignment between known numerics, which exhibit approximately linear error scaling, and prior theoretical analysis, which only provably obtained scaling with the error rate to the power $\frac{2}{3}$. Our main technique is to express generic errors in terms of an effective target Hamiltonian studied in an effective Krylov space. These results provide a theoretical framework for understanding the main features of quantum Krylov errors.

Final version, 27 pages (main text 12 pages), 1 figure. Source code available at https://github.com/wmkirby1/krylov-analysis-paper-numerics. Typos fixed

References in corpus (3)

• Exponential algorithmic speedup by quantum walk
• Diagonalization of large many-body Hamiltonians on a quantum processor
• Leveraging hardware-control imperfections for error mitigation via generalized quantum subspace

Cited by in corpus (12)

• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Diagonalization of large many-body Hamiltonians on a quantum processor
• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
• Molecular Properties from Quantum Krylov Subspace Diagonalization
• Solving lattice gauge theories using the quantum Krylov algorithm and qubitization
• Quantum subspace expansion approach for simulating dynamical response functions of Kitaev spin liquids
• Partitioned Quantum Subspace Expansion
• Systematic many-fermion Hamiltonian input scheme and spectral calculations on quantum computers
• Approximating dynamical correlation functions with constant depth quantum circuits
• Adiabatic state preparation from general initial states
• Cheaper and more noise-resilient quantum state preparation using eigenvector continuation
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions