Approximating ground and excited state energies on a quantum computer
From MaRDI portal
Publication:2347656
DOI10.1007/s11128-015-0927-yzbMath1328.81079arXiv1508.01544OpenAlexW3099737225MaRDI QIDQ2347656
Stuart Hadfield, Anargyros 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Introduction to spectral theory. With applications to Schrödinger operators
- Estimating the ground state energy of the Schrödinger equation for convex potentials
- On the complexity of the multivariate Sturm-Liouville eigenvalue problem
- Proof of the fundamental gap conjecture
- Universal Quantum Simulators
- Upper and lower bounds for eigenvalues by finite difference methods
- Adiabatic quantum state generation and statistical zero knowledge
- General theory of fractal path integrals with applications to many-body theories and statistical physics
- Simulating quantum systems on a quantum computer
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations
- Quantum algorithm and circuit design solving the Poisson equation
- The Bose-Hubbard Model is QMA-complete
- A fast algorithm for approximating the ground state energy on a quantum computer
- The Complexity of the Local Hamiltonian Problem
- Mathematical concepts of quantum mechanics.
