Approximating ground and excited state energies on a quantum computer

DOI10.1007/S11128-015-0927-YzbMATH Open1328.81079arXiv1508.01544OpenAlexW3099737225MaRDI QIDQ2347656FDOQ2347656

Authors: Stuart Hadfield, A. Papageorgiou 

Publication date: 5 June 2015

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

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.

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

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

zbMATH Keywords

eigenvalue problemquantum algorithmsexcited statesSchrödinger equation

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

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

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
• Measurements of quantum Hamiltonians with locally-biased classical shadows
• Preparation of approximate eigenvector by unitary operations on eigenstate in Abrams-Lloyd quantum algorithm
• 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
• 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)