Fetching the paper…
Reading the bibliography…
Most experimental and theoretical studies of adiabatic optimization use stoquastic Hamiltonians, whose ground states are expressible using only real nonnegative amplitudes.
A new method for the numerical solution of the Schrödinger equation
R. Grimm and R. G. Storer · 1969
Earlier work this paper cites.
Quantum annealing: a new method for minimizing multidimensional functions
A. B. Finnila, M. A. Gomez, C. Sebenik, C. Stenson, and J. D. Doll · 1994
Earlier work this paper cites.
“Go with the winners” algorithms
David Aldous and Umesh Vazirani · 1994
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.
How powerful is adiabatic quantum computation?
Wim van Dam, Michele Mosca, and Umesh Vazirani · 2001
Earlier work this paper cites.
Quantum adiabatic evolution algorithms versus simulated annealing
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2002
Earlier work this paper cites.
Quantum adiabatic evolution algorithms with different paths
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2002
Earlier work this paper cites.
Limits of quantum adiabatic optimization
Wim van Dam and Umesh Vazirani · 2003
Earlier work this paper cites.
The quantum adiabatic optimization algorithm and local minima
Ben Reichardt · 2004
Earlier work this paper cites.
Adiabatic quantum computation is equivalent to standard quantum computation
Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev · 2007
Earlier work this paper cites.
Bounds for the adiabatic approximation with applications to quantum computation
Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler · 2007
Earlier work this paper cites.
The complexity of stoquastic local Hamiltonian problems
Sergey Bravyi, David P. DiVincenzo, Roberto Oliveira, and Barbara M. Terhal · 2008
Cited alongside, same era.
Effect of local minima on adiabatic quantum optimization
M. H. S. Amin · 2008
Cited alongside, same era.
Complexity of stoquastic frustration-free Hamiltonians
Sergey Bravyi and Barbara Terhal · 2009
Cited alongside, same era.
First order quantum phase transition in adiabatic quantum computation
M. H. S. Amin and V. Choi · 2009
Cited alongside, same era.
Anderson localization makes adiabatic quantum optimization fail
Boris Altshuler, Hari Krovi, and Jérémie Roland · 2010
Cited alongside, same era.
Adiabatic optimization without local minima
Michael Jarret and Stephen P. Jordan · 2015
Later among the works it cites.
Understanding quantum tunneling through Quantum Monte Carlo simulations
Sergei V. Isakov, Guglielmo Mazzola, Vadim N. Smelyanskiy, Zhang Jiang, Sergio Boixo, Hartmut Neven, and Matthias Troyer · 2015
Later among the works it cites.
Benchmarking a quantum annealing processor with the time-to-target metric
James King, Sheir Yarkoni, Mayssam M. Nevisi, Jeremy P. Hilton, and Catherine C. McGeoch · 2015
Later among the works it cites.
What is the computational value of finite range tunneling?
Vasil S. Denchev, Sergio Boixo, Sergei V. Isakov, Nan Ding, Ryan Babbush, Vadim Smelyanskiy, John Martinis, and Hartmut Neven · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, and Peter Shor · 2011
Cited alongside, same era.
Quantum annealing with manufactured spins
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, S. Uchaikin, J. Wang, B. Wilson, and G. Rose · 2011
Cited alongside, same era.
A note on the switching adiabatic theorem
Alexander Elgart and George A. Hagedorn · 2012
Cited alongside, same era.
Obstructions to classically simulating the quantum adiabatic algorithm
M. B. Hastings · 2013
Cited alongside, same era.
Different strategies for optimization using the quantum adiabatic algorithm
Elizabeth Crosson, Edward Farhi, Cedric Yen-Yu Lin, Han-Hsuan Lin, and Peter Shor · 2014
Cited alongside, same era.
http://brad-lackey.github.io/substochastic-sat/
Cited in the paper.
Zhang Jiang, Vadim N. Smelyanskiy, Sergei V. Isakov, Sergio Boixo, Guglielmo Mazzola, Matthias Troyer, and Hartmut Neven · 2016
Closest in time.
Computational multiqubit tunnelling in programmable quantum annealers
Sergio Boixo, Vadim N. Smelyanskiy, Alireza Shabani, Sergei V. Isakov, Mark Dykman, Vasil S. Denchev, Mohammad H. Amin, Anatoly Yu Smirnov, Masoud Mohseni, and Hartmut Neven · 2016
Closest in time.
Quantum Monte Carlo simulations of tunneling in quantum adiabatic optimization
Lucas T. Brady and Wim van Dam · 2016
Closest in time.
Simulated quantum annealing can be exponentially faster than classical simulated annealing
Elizabeth Crosson and Aram W. Harrow · 2016
Closest in time.
http://maxsat.ia.udl.cat
Max-SAT 2016, Eleventh Max-SAT Evaluation · 2016
Closest in time.
Borealis–A generalized global update algorithm for Boolean optimization problems
Zheng Zhu, Chao Fang, and Helmut G Katzgraber · 2016
Closest in time.