Fetching the paper…
Reading the bibliography…
We present the results of a numerical study, with 20 qubits, of the performance of the Quantum Adiabatic Algorithm on randomly generated instances of MAX 2-SAT with a unique assignment that maximizes the number of satisfied clauses.
Quantum computation by adiabatic evolution, 2000
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser · 2000
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.
Merlin-Arthur Games and Stoquastic Complexity, 2006
Sergey Bravyi, Arvid J. Bessen, Barbara M. Terhal · 2006
Earlier work this paper cites.
The Complexity of Stoquastic Local Hamiltonian Problems
Sergey Bravyi, David P. DiVincenzo, Roberto I. Oliveira, Barbara M. Terhal · 2008
Cited alongside, same era.
Computational Studies of Quantum Spin Systems
Anders W. Sandvik · 2010
Cited alongside, same era.
Speeding Up Critical System Dynamics Through Optimized Evolution
T. Caneva, T. Calarco, R. Fazio, G. E. Santoro, S. Montangero · 2011
Cited alongside, same era.
Quantum Speedup by Quantum Annealing
Daniel Nagaj, Rolando D. Somma, Maria Kieferova · 2012
Later among the works it cites.
Edward Farhi, David Gosset, Itay Hen, A. W. Sandvik, Peter Shor, A. P. Young, Francesco Zamponi · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…