Beating the natural Grover bound for low-energy estimation and state preparation
Harry Buhrman, Sevag Gharibian, Zeph Landau, Fran\c{c}ois Le Gall, Norbert Schuch, Suguru Tamaki

TL;DR
This paper introduces quantum algorithms capable of estimating ground state energies and preparing corresponding states for general many-body Hamiltonians, surpassing traditional Grover speedup limits by exploiting the structure of low energy subspaces.
Contribution
The authors develop the first quantum algorithms for low-energy estimation that outperform the standard Grover speedup, applicable to non-local Hamiltonians without geometric constraints.
Findings
Algorithms work for long-range and all-to-all interactions.
Runtime scales as 2^{cn/2} with c<1, beating Grover's bound.
Low energy subspace has exponential dimension, enabling efficient estimation.
Abstract
Estimating ground state energies of many-body Hamiltonians is a central task in many areas of quantum physics. In this work, we give quantum algorithms which, given any -body Hamiltonian , compute an estimate for the ground state energy and prepare a quantum state achieving said energy, respectively. Specifically, for any , our algorithms return, with high probability, an estimate of the ground state energy of within additive error , or a quantum state with the corresponding energy. Here, is the total strength of all interaction terms, which in general is extensive in the system size. Our approach makes no assumptions about the geometry or spatial locality of interaction terms of the input Hamiltonian and thus handles even long-range or all-to-all interactions, such as in quantum chemistry, where lattice-based techniques break down. In this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
