Fetching the paper…
Reading the bibliography…
We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.
On the power of quantum computation
D.R. Simon · 1994
Earlier work this paper cites.
Role of winding numbers in quantum monte carlo simulations
Patrik Henelius, S. M. Girvin, and Anders W. Sandvik · 1998
Earlier work this paper cites.
Letters in Mathematical Physics
Jeffrey H. Schenker and Michael Aizenman · 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.
An example of the difference between quantum and classical random walks
Andrew M. Childs, Edward Farhi, and Sam Gutmann · 2002
Earlier work this paper cites.
Adiabatic quantum state generation and statistical zero knowledge
Dorit Aharonov and Amnon Ta-Shma · 2003
Earlier work this paper cites.
Adiabatic quantum computation is equivalent to standard quantum computation
D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev · 2004
Earlier work this paper cites.
Quantum information processing in continuous time
Andrew Macgregor Childs · 2004
Cited alongside, same era.
Efficient quantum algorithms for simulating sparse hamiltonians
Dominic W. Berry, Graeme Ahokas, Richard Cleve, and Barry C. Sanders · 2006
Cited alongside, same era.
Adiabatic quantum optimization fails for random instances of np-complete problems
Boris Altshuler, Hari Krovi, and Jeremie Roland · 2009
Cited alongside, same era.
Universal computation by quantum walk
Andrew M. Childs · 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.
Quantum speedup by quantum annealing
Rolando D. Somma, Daniel Nagaj, and Mária Kieferová · 2012
Later among the works it cites.
Obstructions to classically simulating the adiabatic algorithm
M. B. Hastings and M. H. Freedman · 2013
Later among the works it cites.
Defining and detecting quantum speedup
Troels F Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V Isakov, David Wecker, John M Martinis, Daniel A Lidar, and Matthias Troyer · 2014
Later among the works it cites.
Training a quantum optimizer
Dave Wecker, Matthew B. Hastings, and Matthias Troyer · 2016
Later among the works it cites.
Adiabatic optimization versus diffusion monte carlo methods
Michael Jarret, Stephen P. Jordan, and Brad Lackey · 2016
Later among the works it cites.
A short path quantum algorithm for exact optimization
M. B. Hastings · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sergey Knysh and Vadim Smelyanskiy · 2010
Cited alongside, same era.
Quantum adiabatic algorithm and scaling of gaps at first-order quantum phase transitions
CR Laumann, R Moessner, A Scardicchio, and Shivaji Lal Sondhi · 2012
Cited alongside, same era.
The short path algorithm applied to a toy model
M. B. Hastings · 2019
Later among the works it cites.