Fetching the paper…
Reading the bibliography…
We analyze the performance of simulated quantum annealing (SQA) on an optimization problem for which simulated classical annealing (SA) is provably inefficient because of a high energy barrier.
Optimization by simulated annealing
Kirkpatrick, Gelatt, Vecchi · 1983
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.
Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model, 2002
Roman Martoňák, Giuseppe E. Santoro, and Erio Tosatti · 2002
Earlier work this paper cites.
Quantum Adiabatic Evolution Algorithms versus Simulated Annealing, 2002
Edward Farhi, Jeffrey Goldstone, Sam Gutmann · 2002
Earlier work this paper cites.
The quantum adiabatic optimization algorithm and local minima
B. Reichardt · 2004
Cited alongside, same era.
Optimization by Quantum Annealing: Lessons from hard 3-SAT cases
Demian Battaglia, Giuseppe Santoro, Erio Tosatti · 2005
Cited alongside, same era.
Nonequilibrium Statistical Mechanics in One Dimension
Vladimir Privman · 2005
Cited alongside, same era.
Computational Studies of Quantum Spin Systems, 2010
Anders W. Sandvik · 2010
Cited alongside, same era.
Obstructions To Classically Simulating The Quantum Adiabatic Algorithm, 2013
M. B. Hastings, M. H. Freedman · 2013
Later among the works it cites.
Quantum annealing with more than one hundred qubits
Sergio Boixo, Troels F. Rønnow, Sergei V. Isakov, Zhihui Wang, David Wecker, Daniel A. Lidar, John M. Martinis, Matthias Troyer · 2014
Closest in time.
Monte Carlo simulation of stoquastic Hamiltonians, 2014
Sergey Bravyi · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…