Fetching the paper…
Reading the bibliography…
We construct a set of instances of 3SAT which are not solved efficiently using the simplest quantum adiabatic algorithm.
Critical behavior of random transverse-field ising spin chains
Daniel S. Fisher · 1995
Earlier work this paper cites.
Exact quantum monte carlo process for the statistics of discrete systems
N. V. Prokof’ev, B. V. Svistunov, and I. S. Tupitsyn · 1996
Earlier work this paper cites.
Distributions of gaps and end-to-end correlations in random transverse-field ising spin chains
Daniel S. Fisher and A. P. Young · 1998
Earlier work this paper cites.
Quantum computation by adiabatic evolution, 2000
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser · 2000
Earlier work this paper cites.
A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua Lapan, Andrew Lundgren, and Daniel Preda · 2001
Earlier work this paper cites.
Quantum adiabatic evolution algorithms with different paths, 2002
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2002
Earlier work this paper cites.
How powerful is adiabatic quantum computation?, 2002
Wim van Dam, Michele Mosca, and Umesh Vazirani · 2002
Earlier work this paper cites.
Adiabatic quantum computing for random satisfiability problems
Tad Hogg · 2003
Cited alongside, same era.
The quantum adiabatic optimization algorithm and local minima
Ben W. Reichardt · 2004
Cited alongside, same era.
Exponential complexity of an adiabatic algorithm for an NP-complete problem
Marko Znidaric and Martin Horvat · 2006
Cited alongside, same era.
Adiabatic quantum computation is equivalent to standard quantum computation
Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev · 2007
Cited alongside, same era.
How to make the quantum adiabatic algorithm fail
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Daniel Nagaj · 2008
Cited alongside, same era.
Adiabatic quantum optimization fails for random instances of NP-complete problems, 2009
Boris Altshuler, Hari Krovi, and Jeremie Roland · 2009
Closest in time.
First order quantum phase transition in adiabatic quantum computation, 2009
M. H. S. Amin and V. Choi · 2009
Closest in time.
Adiabatic quantum algorithms for boolean satisfiability, 2009
Yale Fan · 2009
Closest in time.
Ground-state statistics from annealing algorithms: Quantum vs classical approaches
Yoshiki Matsuda, Hidetoshi Nishimori, and Helmut G. Katzgraber · 2009
Closest in time.
Private communication, 2009
A.P Young · 2009
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Florent Krzakala, Alberto Rosso, Guilhem Semerjian, and Francesco Zamponi · 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.
Private communication based on references [10] and [11]
Daniel Fisher
Cited in the paper.
Limits on quantum adiabatic optimization (unpublished manuscript)
Wim van Dam and Umesh Vazirani
Cited in the paper.
S. Knysh and V. Smelyanskiy · 2010
Closest in time.