Block Lanczos method for excited states on a quantum computer
arXiv:2109.14114
Abstract
The method of quantum Lanczos recursion is extended to solve for multiple excitations on the quantum computer. While quantum Lanczos recursion is in principle capable of obtaining excitations, the extension to a block Lanczos routine can resolve degeneracies with better precision and only costs for excitations on top of the previously introduced quantum Lanczos recursion method. The formal complexity in applying all operators to the system at once with oblivious amplitude amplification is exponential, but this cost can be kept small to obtain the ground state by incrementally adding operators. The error of the ground state energy based on the accuracy of the Lanczos coefficients is investigated and the error of the ground state energy. It is demonstrated to scale linearly with the uncertainty of the Lanczos coefficients. Extension to non-Hermitian operators is also discussed.
arXiv comment10 pages, 4 figures
References in corpus (29)
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Matrix product states represent ground states faithfully
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Variational Quantum Computation of Excited States
- Training variational quantum algorithms is NP-hard
- Quantum Metropolis Sampling
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
- Information-theoretic bounds on quantum advantage in machine learning
- Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
- Perspectives on double-excitations in TDDFT
- Locality in Quantum and Markov Dynamics on Lattices and Networks
- Quantum Algorithm for Spectral Measurement with Lower Gate Count
- Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
- Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
- Tensor Numerical Methods in Quantum Chemistry: from Hartree-Fock Energy to Excited States
- Preparation of excited states for nuclear dynamics on a quantum computer
- Excitation spectrum and Density Matrix Renormalization Group iterations
- An introduction to quantum cluster methods
- Quantum Algorithm for Simulating Molecular Vibrational Excitations
- Lanczos recursion on a quantum computer for the Green's function and ground state
- Repeat-Until-Success circuits with fixed-point oblivious amplitude amplification
- Resource estimate for quantum many-body ground-state preparation on a quantum computer
- Simulation of adiabatic quantum computing for molecular ground states
- Numerical Stability of Lanczos Methods
- Limitations of Hartree-Fock with quantum resources
- Krylov variational quantum algorithm for first principles materials simulations
- Deep variational quantum eigensolver for excited states and its application to quantum chemistry calculation of periodic materials