Approximating ground and excited state energies on a quantum computer

DOI10.1007/S11128-015-0927-YMaRDI QIDQ2347656zbMATH OpenOpenAlexFDO

Authors Stuart Hadfield, A. Papageorgiou

Publication date 5 June 2015

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.01544

zbMATH Keywords

eigenvalue problemquantum algorithmsexcited statesSchrödinger equation

Mathematics Subject Classification ID

Quantum computation (81P68)

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 $j$ 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"odinger equation with $d$ degrees of freedom. Our algorithm computes estimates of a constant number $j$ of different low order eigenvalues with error $O(epsilon)$ and success probability at least $frac34$, with cost polynomial in $frac1epsilon$ and $d$. 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.

Recommendations

• A fast algorithm for approximating the ground state energy on a quantum computer
• Estimating the ground state energy of the Schrödinger equation for convex potentials
• Faster ground state preparation and high-precision ground energy estimation with fewer qubits
• A quantum eigensolver for symmetric tridiagonal matrices
• Quantum algorithm for measuring the energy of \(n\) qubits with unknown pair-interactions

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 996050 (Why is no real title available?)
• scientific article; zbMATH DE number 3161336 (Why is no real title available?)
• scientific article; zbMATH DE number 5602968 (Why is no real title available?)
• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• scientific article; zbMATH DE number 712371 (Why is no real title available?)
• scientific article; zbMATH DE number 1049347 (Why is no real title available?)
• scientific article; zbMATH DE number 6313120 (Why is no real title available?)
• scientific article; zbMATH DE number 5239749 (Why is no real title available?)
• scientific article; zbMATH DE number 5180707 (Why is no real title available?)
• A fast algorithm for approximating the ground state energy on a quantum computer
• Adiabatic quantum state generation and statistical zero knowledge
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Estimating the ground state energy of the Schrödinger equation for convex potentials
• General theory of fractal path integrals with applications to many-body theories and statistical physics
• Introduction to spectral theory. With applications to Schrödinger operators
• Lanczos Algorithms for Large Symmetric Eigenvalue Computations
• Lower bounds for higher eigenvalues by finite difference methods
• Mathematical concepts of quantum mechanics.
• On the complexity of the multivariate Sturm-Liouville eigenvalue problem
• On the efficiency of quantum algorithms for Hamiltonian simulation
• Proof of the fundamental gap conjecture
• Quantum algorithm and circuit design solving the Poisson equation
• Simulating quantum systems on a quantum computer
• The Bose-Hubbard model is QMA-complete
• The Complexity of the Local Hamiltonian Problem
• The complexity of stoquastic local Hamiltonian problems
• Universal Quantum Simulators
• Upper and lower bounds for eigenvalues by finite difference methods

Cited in

(19)

• Quantum algorithms for the generalized eigenvalue problem
• Complexity of quantum impurity problems
• Faster ground state preparation and high-precision ground energy estimation with fewer qubits
• COMPUTATION OF ENERGIES IN THE LOWEST LANDAU LEVEL
• A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer
• Approximation algorithms for quantum many-body problems
• Bethe states on a quantum computer: success probability and correlation functions
• The quantum complexity of computing Schatten \(p\)-norms
• Preparation of approximate eigenvector by unitary operations on eigenstate in Abrams-Lloyd quantum algorithm
• Measurements of quantum Hamiltonians with locally-biased classical shadows
• Estimating the ground state energy of the Schrödinger equation for convex potentials
• A fast algorithm for approximating the ground state energy on a quantum computer
• Computing the lowest eigenstate of tight-binding Hamiltonians using quantum walks
• Quantum algorithm for measuring the energy of \(n\) qubits with unknown pair-interactions
• Energy levels estimation on a quantum computer by evolution of a physical quantity
• Variable ansatz applied to spectral operator decomposition in a physical superconducting quantum device
• Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions
• A quantum algorithm for obtaining the lowest eigenstate of a Hamiltonian assisted with an ancillary qubit system
• A quantum eigensolver for symmetric tridiagonal matrices

This page was built for publication: Approximating ground and excited state energies on a quantum computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347656)