Real-Time Krylov Theory for Quantum Computing Algorithms
arXiv:2208.01063 · doi:10.22331/q-2023-07-25-1066
Abstract
Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.
References in corpus (15)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
- Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- Quantum Krylov subspace algorithms for ground and excited state energy estimation
- Noise resistance of adiabatic quantum computation using random matrix theory
- Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
- Fast inversion, preconditioned quantum linear system solvers, and fast evaluation of matrix functions
- Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
- Time evolution of one-dimensional Quantum Many Body Systems
- A theory of quantum subspace diagonalization
- Time-dependent unbounded Hamiltonian simulation with vector norm scaling
- Symplectic eigenvalue problem via trace minimization and Riemannian optimization
- Sensitivity of quantum speedup by quantum annealing to a noisy oracle
Cited by in corpus (16)
- Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
- Diagonalization of large many-body Hamiltonians on a quantum processor
- Analysis of quantum Krylov algorithms with errors
- Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
- Sampling Error Analysis in Quantum Krylov Subspace Diagonalization
- Measurement-efficient quantum Krylov subspace diagonalisation
- Solving lattice gauge theories using the quantum Krylov algorithm and qubitization
- Quantum subspace expansion approach for simulating dynamical response functions of Kitaev spin liquids
- Estimating Eigenenergies from Quantum Dynamics: A Unified Noise-Resilient Measurement-Driven Approach
- Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model
- Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor
- Rovibrational energy levels of HO by quantum computing
- Cheaper and more noise-resilient quantum state preparation using eigenvector continuation
- Exploring fixed points and eigenstates of quantum systems with reinforcement learning
- Transversal architecture for megaquop-scale quantum simulation with neutral atoms
- Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions