Fetching the paper…
Reading the bibliography…
Finding the ground state energy of electrons subject to an external electric field is a fundamental problem in computational chemistry.
Quantum mechanics of many-electron systems
Paul Adrien Maurice Dirac · 1929
Earlier work this paper cites.
On the eigenfunctions of many-particle systems in quantum mechanics
Tosio Kato · 1957
Earlier work this paper cites.
J. Chem. Phys
Self-consistent molecular-orbital methods. i. use of gaussian expansions of slater-type atomic orbitals · 1969
Earlier work this paper cites.
The complexity of theorem-proving procedures
Stephen A. Cook · 1971
Earlier work this paper cites.
Solid State Physics
N. W. Ashcroft and N. D. Mermin · 1976
Earlier work this paper cites.
Quantum measurements and the abelian stabilizer problem
Alexei Y. Kitaev · 1996
Earlier work this paper cites.
Basis-set convergence in correlated calculations on ne, n2, and h2o
Asger Halkier, Trygve Helgaker, Poul Jørgensen, Wim Klopper, Henrik Koch, Jeppe Olsen, and Angela K. Wilson · 1998
Earlier work this paper cites.
Molecular Electronic-Structure Theory
T. Helgaker, P. Jorgensen, and J. Olsen · 2000
Earlier work this paper cites.
Classical and Quantum Computation
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Cited alongside, same era.
Calculus, Volume I, 2nd Ed One-variable Calculus, with an Introduction to Linear Algebra
T.M. Apostol · 2007
Cited alongside, same era.
Quantum computational complexity of the n-representability problem: Qma complete
Yi-Kai Liu, Matthias Christandl, and Frank Verstraete · 2007
Cited alongside, same era.
Norbert Schuch and Frank Verstraete · 2009
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
The Computational Complexity of Density Functional Theory
James Daniel Whitfield, Norbert Schuch, and Frank Verstraete · 2014
Later among the works it cites.
The bose-hubbard model is qma-complete
Andrew M Childs, David Gosset, and Zak Webb · 2015
Later among the works it cites.
Complexity of the xy antiferromagnet at fixed magnetization
Andrew M Childs, David Gosset, and Zak Webb · 2016
Later among the works it cites.
Complexity classification of local hamiltonian problems
Toby Cubitt and Ashley Montanaro · 2016
Later among the works it cites.
The complexity of antiferromagnetic interactions and 2d lattices
Stephen Piddock and Ashley Montanaro · 2017
Later among the works it cites.
Quantum Computing in the NISQ era and beyond
John Preskill · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sergey Bravyi, David P DiVincenzo, and Daniel Loss · 2011
Cited alongside, same era.
Computational complexity in electronic structure
James Daniel Whitfield, Peter John Love, and Alán Aspuru-Guzik · 2013
Cited alongside, same era.
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alán Aspuru-Guzik, and Jeremy L. O’Brien · 2014
Cited alongside, same era.
Later among the works it cites.
Qma-hardness of consistency of local density matrices with applications to quantum zero-knowledge
A. Broadbent and A. B. Grilo · 2020
Later among the works it cites.