Fetching the paper…
Reading the bibliography…
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers.
Zur Theorie der Energieubertragung. ii
L. Landau · 1932
Earlier work this paper cites.
Non-adiabatic crossing of energy levels
C. Zener · 1932
Earlier work this paper cites.
Problems and results on 3-chromatic hypergraphs and some related questions
P. Erdös and L. Lovász · 1975
Earlier work this paper cites.
Computers and Intractability : A Guide to the Theory of NP-Completeness
M. R. Garey and D. S. Johnson · 1979
Earlier work this paper cites.
On the computational complexity of Ising spin glass models
F. Barahona · 1982
Earlier work this paper cites.
Upper bounds on the satisfiability threshold
O. Dubois · 2001
Earlier work this paper cites.
A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda · 2001
Earlier work this paper cites.
Quantum NP - a survey
D. Aharonov and T. Naveh · 2002
Earlier work this paper cites.
Analytic and algorithmic solution of random satisfiability problems
M. Mézard, G. Parisi, and R. Zecchina · 2002
Earlier work this paper cites.
Random k-satisfiability problem: From an analytic solution to an efficient algorithm
M. Mézard and R. Zecchina · 2002
Earlier work this paper cites.
Physics/computer science: Passing messages between disciplines
M. Mézard · 2003
Earlier work this paper cites.
Two solutions to diluted p-spin models and XORSAT problems
M. Mézard, F. Ricci-Tersenghi, and R. Zecchina · 2003
Earlier work this paper cites.
Quantum adiabatic optimization and combinatorial landscapes
V. Smelyanskiy, S. Knysh, and R. Morris · 2004
Earlier work this paper cites.
Guest column: NP-complete problems and physical reality
S. Aaronson · 2005
Earlier work this paper cites.
Survey propagation: an algorithm for satisfiability
A. Braunstein, M. Mezard, and R. Zecchina · 2005
Cited alongside, same era.
Phase transitions in combinatorial optimization problems: basics, algorithms and statistical mechanics
A. K. Hartmann and M. Weigt · 2005
Cited alongside, same era.
Efficient algorithm for a quantum analogue of 2-SAT
S. Bravyi · 2006
Cited alongside, same era.
The power of quantum systems on a line
D. Aharonov, D. Gottesman, and J. Kempe · 2007
Cited alongside, same era.
Quantum belief propagation: An algorithm for thermal quantum systems
M. B. Hastings · 2007
Cited alongside, same era.
Gibbs states and the set of solutions of random constraint satisfaction problems
F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian, and L. Zdeborova · 2007
A. Ambainis, J. Kempe, and O. Sattath · 2009
Later among the works it cites.
Complexity Theory: A Modern Approach
S. Arora and B. Barak · 2009
Later among the works it cites.
Bounds on the quantum satisfibility threshold
S. Bravyi, C. Moore, and A. Russell · 2009
Later among the works it cites.
Bose-einstein condensation in quantum glasses
G. Carleo, M. Tarzia, and F. Zamponi · 2009
Later among the works it cites.
Information, physics, and computation
M. Mézard and A. Montanari · 2009
Later among the works it cites.
Exact solution of the Bose-Hubbard model on the Bethe lattice
G. Semerjian, M. Tarzia, and F. Zamponi · 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Adiabatic quantum computation is equivalent to standard quantum computation
D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev · 2008
Cited alongside, same era.
Junior paper: Running time scaling of a 2-QSAT adiabatic evolution algorithm
J. Govenius · 2008
Cited alongside, same era.
Path-integral representation for quantum spin models: Application to the quantum cavity method and monte carlo simulations
F. Krzakała, A. Rosso, G. Semerjian, and F. Zamponi · 2008
Cited alongside, same era.
Cavity method for quantum spin glasses on the Bethe lattice
C. R. Laumann, A. Scardicchio, and S. L. Sondhi · 2008
Cited alongside, same era.
Quantum graphical models and belief propagation
M. Leifer and D. Poulin · 2008
Cited alongside, same era.
Size dependence of the minimum excitation gap in the quantum adiabatic algorithm
A. P. Young, S. Knysh, and V. N. Smelyanskiy · 2008
Cited alongside, same era.
Later among the works it cites.
Private communication, June 2010
I. Arad, T. Cubitt, J. Kempe, O. Sattath, M. Schwarz, and F. Verstraete · 2010
Closest in time.
Product, generic, and random generic quantum satisfiability
C. R. Laumann, A. M. Läuchli, R. Moessner, A. Scardicchio, and S. L. Sondhi · 2010
Closest in time.
Phase transitions and random quantum satisfiability
C. R. Laumann, R. Moessner, A. Scardicchio, and S. L. Sondhi · 2010
Closest in time.
AKLT models with quantum spin glass ground states
C. R. Laumann, S. A. Parameswaran, S. L. Sondhi, and F. Zamponi · 2010
Closest in time.
A constructive proof of the general Lovász local lemma
R. A. Moser and G. Tardos · 2010
Closest in time.
Unfrustrated qudit chains and their ground states
R. Movassagh, E. Farhi, J. Goldstone, D. Nagaj, T. J. Osborne, and P. W. Shor · 2010
Closest in time.
First-order phase transition in the quantum adiabatic algorithm
A. P. Young, S. Knysh, and V. N. Smelyanskiy · 2010
Closest in time.