Fetching the paper…
Reading the bibliography…
The Bose-Hubbard model is a system of interacting bosons that live on the vertices of a graph.
Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca, Quantum algorithms revisited , Proceedings of the Royal Society of London, Series A 454
1969
Earlier work this paper cites.
Richard P. Feynman, Quantum mechanical computers , Optics News 11
1985
Earlier work this paper cites.
Matthew P. A. Fisher, Peter B. Weichman, G. Grinstein, and Daniel S. Fisher, Boson localization and the superfluid-insulator transition , Physical Review B 40
1989
Earlier work this paper cites.
Bojan Mohar, Eigenvalues, diameter, and mean distance in graphs , Graphs and Combinatorics 7
1991
Earlier work this paper cites.
Lev D. Landau and Evgenii M. Lifshitz, Quantum mechanics: non-relativistic theory , Pergamon Press, 1994
1994
Earlier work this paper cites.
Alexei Yu. Kitaev, Alexander H. Shen, and Mikhail N. Vyalyi, Classical and quantum computation , American Mathematical Society, 2002
2002
Earlier work this paper cites.
Dorit Aharonov and Amnon Ta-Shma, Adiabatic quantum state generation and statistical zero knowledge , Proceedings of the 35th ACM Symposium on Theory of Computing, pp. 20–29, 2003, arXiv:quant-ph/0301023
2003
Earlier work this paper cites.
Julia Kempe and Oded Regev, 3-Local Hamiltonian is QMA-complete , Quantum Information and Computation 3
2003
Earlier work this paper cites.
Chris Marriott and John Watrous, Quantum Arthur-Merlin games , Computational Complexity 14
2005
Cited alongside, same era.
Julia Kempe, Alexei Kitaev, and Oded Regev, The complexity of the local Hamiltonian problem , SIAM Journal on Computing 35
2006
Cited alongside, same era.
Yi-Kai Liu, Matthias Christandl, and Frank Verstraete, Quantum computational complexity of the N N -representability problem: QMA complete , Physical Review Letters 98
2007
Cited alongside, same era.
Ari Mizel, Daniel A. Lidar, and Morgan Mitchell, Simple proof of equivalence between adiabatic quantum computation and the circuit model , Physical Review Letters 99
2007
Cited alongside, same era.
Sergey Bravyi, David P. DiVincenzo, Roberto I. Oliveira, and Barbara M. Terhal, The complexity of stoquastic local Hamiltonian problems , Quantum Information and Compuation 8
2008
2009
Later among the works it cites.
2009
Later among the works it cites.
2010
Later among the works it cites.
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Stephen P. Jordan and Edward Farhi, Perturbative gadgets at arbitrary orders , Physical Review A 77
2008
Cited alongside, same era.
Roberto Oliveira and Barbara M. Terhal, The complexity of quantum spin systems on a two-dimensional square lattice , Quantum Information and Computation 8
2008
Cited alongside, same era.
2009
Cited alongside, same era.
Adam D. Bookatz, QMA-complete problems , arXiv:1212.6312
Cited in the paper.
Cited in the paper.
Dominik Janzing and Pawel Wocjan, BQP-complete problems concerning mixing properties of classical random walks on sparse graphs , arXiv:quant-ph/0610235
Cited in the paper.
2011
Later among the works it cites.
2013
Closest in time.