Approximating Ground and Excited State Energies on a Quantum Computer
arXiv:1508.01544 · doi:10.1007/s11128-015-0927-y
Abstract
Approximating ground and a fixed number of excited state energies, or equivalently low order Hamiltonian eigenvalues, is an important but computationally hard problem. Typically, the cost of classical deterministic algorithms grows exponentially with the number of degrees of freedom. Under general conditions, and using a perturbation approach, we provide a quantum algorithm that produces estimates of a constant number of different low order eigenvalues. The algorithm relies on a set of trial eigenvectors, whose construction depends on the particular Hamiltonian properties. We illustrate our results by considering a special case of the time-independent Schrödinger equation with degrees of freedom. Our algorithm computes estimates of a constant number of different low order eigenvalues with error and success probability at least , with cost polynomial in and . This extends our earlier results on algorithms for estimating the ground state energy. The technique we present is sufficiently general to apply to problems beyond the application studied in this paper.
arXiv comment21 pages, 1 figure
References in corpus (12)
- Simulated Quantum Computation of Molecular Energies
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Towards Quantum Chemistry on a Quantum Computer
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Efficient Simulation of Quantum Systems by Quantum Computers
- Simulating chemistry using quantum computers
- Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
- Quantum algorithm and circuit design solving the Poisson equation
- Interacting boson problems are QMA-hard
- Measures of quantum computing speedup
- The Bose-Hubbard model is QMA-complete
- A fast algorithm for approximating the ground state energy on a quantum computer