Fetching the paper…
Reading the bibliography…
Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry.
Simulating physics with computers
Richard Feynman · 1982
Earlier work this paper cites.
Quantum mechanical computers
Richard Feynman · 1985
Earlier work this paper cites.
Quantum measurements and the Abelian Stabilizer Problem
Alexei Yu. Kitaev · 1995
Earlier work this paper cites.
Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
Daniel S. Abrams and Seth Lloyd · 1999
Earlier work this paper cites.
Classical and Quantum Computation
Alexei Yu. Kitaev, Alexander H. Shen, and Mikhail N. Vyalyi · 2002
Earlier work this paper cites.
Simulated quantum computation of molecular energies
Alán Aspuru-Guzik, Anthony D. Dutoi, Peter J. Love, and Martin Head-Gordon · 2005
Earlier work this paper cites.
The complexity of the local Hamiltonian problem
Julia Kempe, Alexei Yu. Kitaev, and Oded Regev · 2006
Earlier work this paper cites.
Realizable hamiltonians for universal adiabatic quantum computers
Jacob D Biamonte and Peter J Love · 2008
Earlier work this paper cites.
The complexity of quantum spin systems on a two-dimensional square lattice
Roberto Oliveira and Barbara M. Terhal · 2008
Earlier work this paper cites.
Why quantum chemistry is hard
Scott Aaronson · 2009
Earlier work this paper cites.
Quantum algorithm for solving linear systems of equations
Aram W. Harrow, Avinatan Hassadim, and Seth Lloyd · 2009
Earlier work this paper cites.
Computational complexity of interacting electrons and fundamental limitations of density functional theory
Norbert Schuch and Frank Verstraete · 2009
Cited alongside, same era.
Quantum-Merlin-Arthur–complete problems for stoquastic hamiltonians and markov matrices
Stephen P. Jordan, David Gosset, and Peter J. Love · 2010
Cited alongside, same era.
Interacting boson problems can be QMA hard
Tzu-Chieh Wei, Michele Mosca, and Ashwin Nayak · 2010
Cited alongside, same era.
Schrieffer–Wolff transformation for quantum many-body systems
Sergey Bravyi, David DiVincenzo, and Daniel Loss · 2011
Cited alongside, same era.
Hardness of approximation for quantum problems
Sevag Gharibian and Julia Kempe · 2012
Cited alongside, same era.
On physical problems that are slightly more difficult than QMA
Universal quantum hamiltonians
Toby Cubitt, Ashley Montanaro, and Stephen Piddock · 2018
Later among the works it cites.
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut
Sevag Gharibian and Ojas Parekh · 2019
Later among the works it cites.
The complexity of simulating local measurements on quantum systems
Sevag Gharibian and Justin Yirka · 2019
Later among the works it cites.
Quantum algorithms for quantum chemistry and quantum materials science
Bela Bauer, Sergey Bravyi, Mario Motta, and Garnet Kin-Lic Chan · 2020
Later among the works it cites.
Near-optimal ground state preparation
Lin Lin and Yu Tong · 2020
Later among the works it cites.
Variational quantum algorithms
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 · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Andris Ambainis · 2014
Cited alongside, same era.
QMA with subset state witnesses
Alex Bredariol Grilo, Iordanis Kerenidis, and Jamie Sikora · 2015
Cited alongside, same era.
Complexity classification of local hamiltonian problems
Toby Cubitt and Ashley Montanaro · 2016
Cited alongside, same era.
On complexity of the quantum ising model
Sergey Bravyi and Matthew Hastings · 2017
Cited alongside, same era.
The complexity of antiferromagnetic interactions and 2d lattices
Stephen Piddock and Ashley Montanaro · 2017
Cited alongside, same era.
Elucidating reaction mechanisms on quantum computers
Markus Reiher, Nathan Wiebe, Krysta M. Svore, Dave Wecker, and Matthias Troyer · 2017
Cited alongside, same era.
Later among the works it cites.
Even more efficient quantum computations of chemistry through tensor hypercontraction
Joonho Lee, Dominic W. Berry, Craig Gidney, William J. Huggins, Jarrod R. McClean, Nathan Wiebe, and Ryan Babbush · 2021
Later among the works it cites.
Fault-tolerant quantum simulations of chemistry in first quantization
Yuan Su, Dominic W. Berry, Nathan Wiebe, Nicholas Rubin, and Ryan Babbush · 2021
Later among the works it cites.
Strongly universal Hamiltonian simulators
Leo Zhou and Dorit Aharonov · 2021
Later among the works it cites.
Sevag Gharibian and François Le Gall · 2022
Closest in time.
Is there evidence for exponential quantum advantage in quantum chemistry?
Seunghoon Lee, Joonho Lee, Huanchen Zhai, Yu Tong, Alexander M Dalzell, Ashutosh Kumar, Phillip Helms, Johnnie Gray, Zhi-Hao Cui, Wenyuan Liu, et al · 2022
Closest in time.