A fast algorithm for approximating the ground state energy on a quantum computer

DOI10.1090/S0025-5718-2013-02714-7zbMath1271.81051arXiv1008.4294OpenAlexW3100349417MaRDI QIDQ5326511

J. F. Traub, Anargyros Papageorgiou, Chi Zhang, Iasonas Petras

Publication date: 6 August 2013

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

eigenvalue problemquantum algorithmsnumerical approximation

Mathematics Subject Classification ID

Quantum computation (81P68) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Computational methods for problems pertaining to quantum theory (81-08) Many-body theory; quantum Hall effect (81V70) Algorithms for approximation of functions (65D15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Obtaining a linear combination of the principal components of a matrix on quantum computers, Quantum algorithm and circuit design solving the Poisson equation, Estimating the ground state energy of the Schrödinger equation for convex potentials, Approximating ground and excited state energies on a quantum computer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the efficiency of quantum algorithms for Hamiltonian simulation
• Lower bounds for higher eigenvalues by finite difference methods
• From quantum to classical molecular dynamics: Reduced models and numerical analysis.
• Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
• Handbook of Numerical Analysis X. Special volume: Computational chemistry.
• Tractability of approximation for weighted Korobov spaces on classical and quantum computers
• On the complexity of the multivariate Sturm-Liouville eigenvalue problem
• Upper and lower bounds for eigenvalues by finite difference methods
• General theory of fractal path integrals with applications to many-body theories and statistical physics
• Strengths and Weaknesses of Quantum Computing
• The Complexity of the Local Hamiltonian Problem
• Quantum complexity of integration