Fetching the paper…
Reading the bibliography…
Evolutions of local Hamiltonians in short times are expected to remain local and thus limited.
Beweis des adiabatensatzes
M. Born and V. Fock · 1928
Earlier work this paper cites.
On the adiabatic theorem of quantum mechanics
T. Kato · 1950
Earlier work this paper cites.
The finite group velocity of quantum spin systems
E.H. Lieb and D.W. Robinson · 1972
Earlier work this paper cites.
Ramanujan graphs
A. Lubotzky, R. Phillips, and P. Sarnak · 1988
Earlier work this paper cites.
Isoperimetric numbers of graphs
B. Mohar · 1989
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M. X. Goemans and D. P. Williamson · 1995
Earlier work this paper cites.
Matrix analysis
R. Bhatia · 1996
Earlier work this paper cites.
Quantum annealing in the transverse Ising model
T. Kadowaki and H. Nishimori · 1998
Earlier work this paper cites.
Quantum Computation by Adiabatic Evolution
E. Farhi, J. Goldstone, S. Gutmann and M. Sipser · 2000
Earlier work this paper cites.
Quantum annealing of the traveling-salesman problem
R. Martoňák, G. E. Santoro, and E. Tosatti · 2004
Earlier work this paper cites.
Short Cycles in Random Regular Graphs
B.D. McKay, N.C. Wormald, and B. Wysocka · 2004
Earlier work this paper cites.
Random MAX SAT, random MAX CUT, and their phase transitions
D. Coppersmith, D. Gamarnik, M.T. Hajiaghayi, and G.B. Sorkin · 2004
Earlier work this paper cites.
Optimization by quantum annealing: Lessons from simple cases
L. Stella, G. E. Santoro, and E. Tosatti · 2005
Earlier work this paper cites.
Propagation of correlations in quantum lattice systems
B. Nachtergaele, Y. Ogata, and R. Sims · 2006
Earlier work this paper cites.
Lieb-robinson bounds and the generation of correlations and topological quantum order
S. Bravyi, M. B. Hastings, and F. Verstraete · 2006
Earlier work this paper cites.
Positive definite matrices
R. Bhatia · 2007
Earlier work this paper cites.
Lieb-Robinson bounds in quantum many-body physics
B. Nachtergaele and R. Sims · 2010
Earlier work this paper cites.
Quantum annealing of the graph coloring problem
O. Titiloye and A. Crispin · 2011
Earlier work this paper cites.
Quantum annealing with manufactured spins
M. W Johnson, et al · 2011
Earlier work this paper cites.
Finding low-energy conformations of lattice protein models by quantum annealing
A. Perdomo-Ortiz, N. Dickson, M. Drew-Brook, G. Rose, and A. Aspuru-Guzik · 2012
Cited alongside, same era.
Quantum Speedup by Quantum Annealing
R. D. Somma, D. Nagaj, and M. Kieferová · 2012
Cited alongside, same era.
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
F. Kardoš, D. Král, and J. Volec · 2012
Cited alongside, same era.
Experimental signature of programmable quantum annealing
S. Boixo, T. Albash, F. M. Spedalieri, N. Chancellor, and D. A. Lidar · 2013
Cited alongside, same era.
Error-corrected quantum annealing with hundreds of qubits
K. L. Pudenz, T. Albash, and D. A Lidar · 2014
Cited alongside, same era.
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes
A. W. Marcus, D. A. Spielman, and N. Srivastava · 2018
Later among the works it cites.
Ramanujan coverings of graphs
C. Hall, D. Puder, and W. F. Sawin · 2018
Later among the works it cites.
Benchmarking an 11-qubit quantum computer
K. Wright, et al · 2019
Later among the works it cites.
Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
B. Foxen, et al · 2020
Later among the works it cites.
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples
E. Farhi, D. Gamarnik, and S. Gutmann · 2020
Later among the works it cites.
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. Farhi, J. Goldstone, and S. Gutmann · 2014
Cited alongside, same era.
A quantum annealing architecture with all-to-all connectivity from local interactions
W. Lechner, P. Hauke, and P. Zoller · 2015
Cited alongside, same era.
Quantum annealing correction for random Ising problems
K. L. Pudenz, T. Albash, and D. A Lidar · 2015
Cited alongside, same era.
Application of quantum annealing to training of deep neural networks
S. H. Adachi and M. P. Henderson · 2015
Cited alongside, same era.
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes
A. W. Marcus, D. A. Spielman, and N. Srivastava · 2015
Cited alongside, same era.
Quantum Annealing for Constrained Optimization
I. Hen and F. M. Spedalieri · 2016
Cited alongside, same era.
Quantum annealing with all-to-all connected nonlinear oscillators
S. Puri, C. K. Andersen, A. L. Grimsmo, and A. Blais · 2017
Cited alongside, same era.
E. Farhi, D. Gamarnik, and S. Gutmann · 2020
Later among the works it cites.
Obstacles to Variational Quantum Optimization from Symmetry Protection
S. Bravyi, A. Kliesch, R. Koenig, and E. Tang · 2020
Later among the works it cites.
Prospects for quantum enhancement with diabatic quantum annealing
E. J. Crosson and D. A. Lidar · 2021
Closest in time.
Classical algorithms for quantum mean values
S. Bravyi, D. Gosset, and R. Movassagh · 2021
Closest in time.
Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems
L. T. Brady, C. L. Baldwin, A. Bapat, Y. Kharkov, and A. V. Gorshkov · 2021
Closest in time.
Behavior of Analog Quantum Algorithms
L. T. Brady, L. Kocia, P. Bienias, A. Bapat, Y. Kharkov, and A. V. Gorshkov · 2021
Closest in time.
Optimal Control for Quantum Optimization of Closed and Open Systems
L. C. Venuti, D. D’Alessandro, and D. A. Lidar · 2021
Closest in time.
Theory of Trotter Error with Commutator Scaling
A. M. Childs, Y. Su, M. C. Tran, N. Wiebe, and S. Zhu · 2021
Closest in time.
Operator growth bounds from graph theory
C.-F. Chen and A. Lucas · 2021
Closest in time.
The Power of Adiabatic Quantum Computation with No Sign Problem
M. B. Hastings · 2021
Closest in time.
(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem
A. Gilyén, M. B. Hastings, and U. Vazirani · 2021
Closest in time.
Coherent quantum annealing in a programmable 2000-qubit Ising chain
A. D. King, et al · 2022
Closest in time.
Hybrid quantum-classical algorithms for approximate graph coloring
S. Bravyi, A. Kliesch, R. Koenig, and E. Tang · 2022
Closest in time.