Document Open Access Logo

Improved Hardness Results for the Guided Local Hamiltonian Problem

Authors Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans

Thumbnail PDF


  • Filesize: 0.74 MB
  • 19 pages

Document Identifiers

Author Details

Chris Cade
  • QuSoft and University of Amsterdam (UvA), The Netherlands
Marten Folkertsma
  • QuSoft and CWI, Amsterdam, The Netherlands
Sevag Gharibian
  • Paderborn Universität, Germany
Ryu Hayakawa
  • Kyoto University, Japan
François Le Gall
  • Nagoya University, Japan
Tomoyuki Morimae
  • Kyoto University, Japan
Jordi Weggemans
  • QuSoft and CWI, Amsterdam, The Netherlands


We thank Jonas Helsen for feedback on an earlier draft, and Ronald de Wolf for helpful comments.

Cite AsGet BibTex

Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, and Jordi Weggemans. Improved Hardness Results for the Guided Local Hamiltonian Problem. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 32:1-32:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)


Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further investigate its complexity and the potential of quantum algorithms for quantum chemistry, Gharibian and Le Gall (STOC 2022) recently introduced the guided local Hamiltonian problem (GLH), which is a variant of the local Hamiltonian problem where an approximation of a ground state (which is called a guiding state) is given as an additional input. Gharibian and Le Gall showed quantum advantage (more precisely, BQP-completeness) for GLH with 6-local Hamiltonians when the guiding state has fidelity (inverse-polynomially) close to 1/2 with a ground state. In this paper, we optimally improve both the locality and the fidelity parameter: we show that the BQP-completeness persists even with 2-local Hamiltonians, and even when the guiding state has fidelity (inverse-polynomially) close to 1 with a ground state. Moreover, we show that the BQP-completeness also holds for 2-local physically motivated Hamiltonians on a 2D square lattice or a 2D triangular lattice. Beyond the hardness of estimating the ground state energy, we also show BQP-hardness persists when considering estimating energies of excited states of these Hamiltonians instead. Those make further steps towards establishing practical quantum advantage in quantum chemistry.

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantum complexity theory
  • Quantum computing
  • Quantum advantage
  • Quantum Chemistry
  • Guided Local Hamiltonian Problem


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Scott Aaronson. Why quantum chemistry is hard. Nature Physics, 5:707-708, 2009. URL:
  2. Daniel S. Abrams and Seth Lloyd. Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors. Physical Review Letters, 83:5162-5165, 1999. URL:
  3. Andris Ambainis. On physical problems that are slightly more difficult than QMA. In 29th IEEE Conference on Computational Complexity (CCC), pages 32-43, 2014. Google Scholar
  4. Alán Aspuru-Guzik, Anthony D. Dutoi, Peter J. Love, and Martin Head-Gordon. Simulated quantum computation of molecular energies. Science, 309(5741):1704-1707, 2005. URL:
  5. Bela Bauer, Sergey Bravyi, Mario Motta, and Garnet Kin-Lic Chan. Quantum algorithms for quantum chemistry and quantum materials science. Chemical Reviews, 120(22):12685-12717, 2020. URL:
  6. Jacob D Biamonte and Peter J Love. Realizable hamiltonians for universal adiabatic quantum computers. Physical Review A, 78(1):012352, 2008. Google Scholar
  7. Sergey Bravyi, David DiVincenzo, and Daniel Loss. Schrieffer-Wolff transformation for quantum many-body systems. Annals of physics, 326(10):2793-2826, 2011. Google Scholar
  8. Sergey Bravyi and Matthew Hastings. On complexity of the quantum ising model. Communications in Mathematical Physics, 349(1):1-45, 2017. Google Scholar
  9. Marco Cerezo, Andrew Arrasmith, Ryan Babbush, Simon C. Benjamin, Suguru Endo, Keisuke Fujii, Jarrod R. McClean, Kosuke Mitarai, Xiao Yuan, Lukasz Cincio, and Patrick J. Coles. Variational quantum algorithms. Nature Reviews Physics, 3:625-644, 2021. URL:
  10. Toby Cubitt and Ashley Montanaro. Complexity classification of local hamiltonian problems. SIAM Journal on Computing, 45(2):268-316, 2016. Google Scholar
  11. Toby Cubitt, Ashley Montanaro, and Stephen Piddock. Universal quantum hamiltonians. Proceedings of the National Academy of Sciences, 115(38):9497-9502, 2018. Google Scholar
  12. Richard Feynman. Simulating physics with computers. International Journal of Theoretical Physics, 21(6-7):467-488, 1982. Google Scholar
  13. Richard Feynman. Quantum mechanical computers. Optics News, 11:11, 1985. Google Scholar
  14. Sevag Gharibian and Julia Kempe. Hardness of approximation for quantum problems. In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), pages 387-398, 2012. Google Scholar
  15. Sevag Gharibian and François Le Gall. Dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum PCP conjecture. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 19-32, 2022. Full version available as arXiv:2111.09079. URL:
  16. Sevag Gharibian and Ojas Parekh. Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), volume 145, pages 31:1-31:17, 2019. Google Scholar
  17. Sevag Gharibian and Justin Yirka. The complexity of simulating local measurements on quantum systems. Quantum, 3:189, 2019. URL:
  18. Alex Bredariol Grilo, Iordanis Kerenidis, and Jamie Sikora. QMA with subset state witnesses. In International Symposium on Mathematical Foundations of Computer Science, pages 163-174. Springer, 2015. Google Scholar
  19. Aram W. Harrow, Avinatan Hassadim, and Seth Lloyd. Quantum algorithm for solving linear systems of equations. Physical Review Letters, 15(103):150502, 2009. Google Scholar
  20. Stephen P. Jordan, David Gosset, and Peter J. Love. Quantum-Merlin-Arthur-complete problems for stoquastic hamiltonians and markov matrices. Phys. Rev. A, 81:032331, March 2010. URL:
  21. Julia Kempe, Alexei Yu. Kitaev, and Oded Regev. The complexity of the local Hamiltonian problem. SIAM journal on Computing, 35(5):1070-1097, 2006. Google Scholar
  22. Alexei Yu. Kitaev. Quantum measurements and the Abelian Stabilizer Problem, 1995. URL:
  23. Alexei Yu. Kitaev, Alexander H. Shen, and Mikhail N. Vyalyi. Classical and Quantum Computation. American Mathematical Society, 2002. Google Scholar
  24. Joonho Lee, Dominic W. Berry, Craig Gidney, William J. Huggins, Jarrod R. McClean, Nathan Wiebe, and Ryan Babbush. Even more efficient quantum computations of chemistry through tensor hypercontraction. PRX Quantum, 2:030305, 2021. URL:
  25. Seunghoon Lee, Joonho Lee, Huanchen Zhai, Yu Tong, Alexander M Dalzell, Ashutosh Kumar, Phillip Helms, Johnnie Gray, Zhi-Hao Cui, Wenyuan Liu, et al. Is there evidence for exponential quantum advantage in quantum chemistry? arXiv preprint, 2022. URL:
  26. Lin Lin and Yu Tong. Near-optimal ground state preparation. Quantum, 4:372, 2020. Google Scholar
  27. Roberto Oliveira and Barbara M. Terhal. The complexity of quantum spin systems on a two-dimensional square lattice. Quantum Information and Computation, 8(10):0900-0924, 2008. Google Scholar
  28. Stephen Piddock and Ashley Montanaro. The complexity of antiferromagnetic interactions and 2d lattices. Quantum Information & Computation, 17(7-8):636-672, 2017. Google Scholar
  29. Markus Reiher, Nathan Wiebe, Krysta M. Svore, Dave Wecker, and Matthias Troyer. Elucidating reaction mechanisms on quantum computers. Proceedings of the National Academy of Sciences, 114(29):7555-7560, 2017. URL:
  30. Norbert Schuch and Frank Verstraete. Computational complexity of interacting electrons and fundamental limitations of density functional theory. Nature Physics, 5:732-735, 2009. Google Scholar
  31. Yuan Su, Dominic W. Berry, Nathan Wiebe, Nicholas Rubin, and Ryan Babbush. Fault-tolerant quantum simulations of chemistry in first quantization. PRX Quantum, 2:040332, November 2021. URL:
  32. Tzu-Chieh Wei, Michele Mosca, and Ashwin Nayak. Interacting boson problems can be QMA hard. Physical Review Letters, 104:040501, 2010. Google Scholar
  33. Leo Zhou and Dorit Aharonov. Strongly universal Hamiltonian simulators. arXiv preprint, 2021. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail