Fetching the paper…
Reading the bibliography…
Physical implementations of quantum annealing unavoidably operate at finite temperatures.
T. Kato, “On the adiabatic theorem of quantum mechanics,” J. Phys. Soc. Jap. 5
1950
Earlier work this paper cites.
Leslie G. Valiant, “The complexity of enumeration and reliability problems,” SIAM Journal on Computing 8
1979
Earlier work this paper cites.
M. Falcioni, E. Marinari, M.L. Paciello, G. Parisi, and B. Taglienti, “Complex zeros in the partition function of the four-dimensional su(2) lattice gauge model,” Physics Letters B 108
1982
Earlier work this paper cites.
Alan M. Ferrenberg and Robert H. Swendsen, “Optimized monte carlo data analysis,” Phys. Rev. Lett. 63
1989
Earlier work this paper cites.
C. J. Geyer, “Parallel tempering,” in Computing Science and Statistics Proceedings of the 23rd Symposium on the Interface , edited by E. M. Keramidas (American Statistical Association, New York, 1991) p. 156
1991
Earlier work this paper cites.
A. B. Finnila, M. A. Gomez, C. Sebenik, C. Stenson, and J. D. Doll, “Quantum annealing: A new method for minimizing multidimensional functions,” Chemical Physics Letters 219
1994
Earlier work this paper cites.
C.H. Papadimitriou, Computational Complexity (Addison Wesley Longman, Reading, Massachusetts, 1995)
1995
Earlier work this paper cites.
Koji Hukushima and Koji Nemoto, “Exchange monte carlo method and application to spin glass simulations,” Journal of the Physical Society of Japan 65
1996
Earlier work this paper cites.
Lov K. Grover, “Quantum mechanics helps in searching for a needle in a haystack,” Phys. Rev. Lett. 79
1997
Earlier work this paper cites.
Tadashi Kadowaki and Hidetoshi Nishimori, “Quantum annealing in the transverse Ising model,” Phys. Rev. E 58
1998
Earlier work this paper cites.
J. Brooke, D. Bitko, T. F., Rosenbaum, and G. Aeppli, “Quantum annealing of a disordered magnet,” Science 284
1999
Earlier work this paper cites.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser, “Quantum Computation by Adiabatic Evolution,” arXiv:quant-ph/0001106 (2000)
2000
Earlier work this paper cites.
Giuseppe E. Santoro, Roman Martoňák, Erio Tosatti, and Roberto Car, “Theory of quantum annealing of an Ising spin glass,” Science 295
2002
Earlier work this paper cites.
Jérémie Roland and Nicolas J. Cerf, “Quantum search by local adiabatic evolution,” Phys. Rev. A 65
2002
Earlier work this paper cites.
Firas Hamze and Nando de Freitas, “From fields to trees,” in UAI , edited by David Maxwell Chickering and Joseph Y. Halpern (AUAI Press, Arlington, Virginia, 2004) pp. 243–250
2004
Earlier work this paper cites.
Vilhelm Dahllöf, Peter Jonsson, and Magnus Wahlström, “Counting models for 2sat and 3sat formulae,” Theoretical Computer Science 332
2005
Earlier work this paper cites.
T. Jörg, J. Lukic, E. Marinari, and O. C. Martin, “Strong universality and algebraic scaling in two-dimensional ising spin glasses,” Phys. Rev. Lett. 96
2006
Earlier work this paper cites.
S. P. Jordan, E. Farhi, and P. W. Shor, “Error-correcting codes for adiabatic quantum computation,” Phys. Rev. A 74
2006
Earlier work this paper cites.
Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler, “Bounds for the adiabatic approximation with applications to quantum computation,” J. Math. Phys. 48
2007
Earlier work this paper cites.
V. Martín-Mayor, “Microcanonical approach to the simulation of first-order phase transitions,” Phys. Rev. Lett. 98
2007
Earlier work this paper cites.
A. P. Young, S. Knysh, and V. N. Smelyanskiy, “Size dependence of the minimum excitation gap in the quantum adiabatic algorithm,” Phys. Rev. Lett. 101
2008
Earlier work this paper cites.
Vicky Choi, “Minor-embedding in adiabatic quantum computation: I. The parameter setting problem,” Quant. Inf. Proc. 7
2008
Earlier work this paper cites.
A. P. Young, S. Knysh, and V. N. Smelyanskiy, “First-order phase transition in the quantum adiabatic algorithm,” Phys. Rev. Lett. 104
2010
Earlier work this paper cites.
M W Johnson, P Bunyk, F Maibaum, E Tolkacheva, A J Berkley, E M Chapple, R Harris, J Johansson, T Lanting, I Perminov, E Ladizinsky, T Oh, and G Rose, “A scalable control system for a superconducting adiabatic quantum optimization processor,” Superconductor Science and Technology 23
2010
Earlier work this paper cites.
A J Berkley, M W Johnson, P Bunyk, R Harris, J Johansson, T Lanting, E Ladizinsky, E Tolkacheva, M H S Amin, and G Rose, “A scalable readout system for a superconducting adiabatic quantum optimization system,” Superconductor Science and Technology 23
2010
Earlier work this paper cites.
R. Harris, M. W. Johnson, T. Lanting, A. J. Berkley, J. Johansson, P. Bunyk, E. Tolkacheva, E. Ladizinsky, N. Ladizinsky, T. Oh, F. Cioata, I. Perminov, P. Spear, C. Enderud, C. Rich, S. Uchaikin, M. C. Thom, E. M. Chapple, J. Wang, B. Wilson, M. H. S. Amin, N. Dickson, K. Karimi, B. Macready, C. J. S. Truncik, and G. Rose, “Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor,” Phys. Rev. B 82
2010
Cited alongside, same era.
Boris Altshuler, Hari Krovi, and Jérémie Roland, “Anderson localization makes adiabatic quantum optimization fail,” Proceedings of the National Academy of Sciences 107
2010
Cited alongside, same era.
Itay Hen and A. P. Young, “Exponential complexity of the quantum adiabatic algorithm for certain satisfiability problems,” Phys. Rev. E 84
2011
Cited alongside, same era.
Vicky Choi, “Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design,” Quant. Inf. Proc. 10
2011
Cited alongside, same era.
Walter Vinci, Tameem Albash, Gerardo Paz-Silva, Itay Hen, and Daniel A. Lidar, “Quantum annealing correction with minor embedding,” Phys. Rev. A 92
2015
Later among the works it cites.
2015
Later among the works it cites.
Adam D. Bookatz, Edward Farhi, and Leo Zhou, “Error suppression in hamiltonian-based quantum computation using energy penalties,” Physical Review A 92
2015
Later among the works it cites.
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. K. Thomas, D. A. Huse, and A. A. Middleton, “Zero and low temperature behavior of the two-dimensional ± j \pm j ising spin glass,” Phys. Rev. Lett. 107
2011
Cited alongside, same era.
Francesco Parisen Toldin, Andrea Pelissetto, and Ettore Vicari, “Finite-size scaling in two-dimensional ising spin-glass models,” Phys. Rev. E 84
2011
Cited alongside, same era.
2012
Cited alongside, same era.
Matthew A. Broome, Alessandro Fedrizzi, Saleh Rahimi-Keshari, Justin Dove, Scott Aaronson, Timothy C. Ralph, and Andrew G. White, “Photonic boson sampling in a tunable circuit,” Science 339
2013
Cited alongside, same era.
Justin B. Spring, Benjamin J. Metcalf, Peter C. Humphreys, W. Steven Kolthammer, Xian-Min Jin, Marco Barbieri, Animesh Datta, Nicholas Thomas-Peter, Nathan K. Langford, Dmytro Kundys, James C. Gates, Brian J. Smith, Peter G. R. Smith, and Ian A. Walmsley, “Boson sampling on a photonic chip,” Science 339
2013
Cited alongside, same era.
Sergio Boixo, Tameem Albash, Federico M. Spedalieri, Nicholas Chancellor, and Daniel A. Lidar, “Experimental signature of programmable quantum annealing,” Nat. Commun. 4
2013
Cited alongside, same era.
2013
Cited alongside, same era.
Tomoyuki Morimae, Keisuke Fujii, and Joseph F. Fitzsimons, “Hardness of classically simulating the one-clean-qubit model,” Phys. Rev. Lett. 112
2014
Cited alongside, same era.
2015
Later among the works it cites.
Michael J. Bremner, Ashley Montanaro, and Dan J. Shepherd, “Average-case complexity versus approximate simulation of commuting quantum computations,” Phys. Rev. Lett. 117
2016
Later among the works it cites.
2016
Later among the works it cites.
L. A. Fernandez, E. Marinari, V. Martin-Mayor, G. Parisi, and J. J. Ruiz-Lorenzo, “Universal critical behavior of the two-dimensional ising spin glass,” Phys. Rev. B 94
2016
Later among the works it cites.
Walter Vinci and Daniel A. Lidar, “Optimally stopped optimization,” Phys. Rev. Applied 6
2016
Later among the works it cites.
Zheng Zhu, Andrew J. Ochoa, Stefan Schnabel, Firas Hamze, and Helmut G. Katzgraber, “Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities,” Phys. Rev. A 93
2016
Later among the works it cites.
Walter Vinci, Tameem Albash, and Daniel A Lidar, “Nested quantum annealing correction,” Npj Quantum Information 2
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
Sergey Knysh, “Zero-temperature quantum annealing bottlenecks in the spin-glass phase,” Nature Communications 7
2016
Later among the works it cites.
Michael J. Bremner, Ashley Montanaro, and Dan J. Shepherd, “Achieving quantum supremacy with sparse and noisy commuting quantum computations,” Quantum 1
2017
Closest in time.
Xun Gao, Sheng-Tao Wang, and L.-M. Duan, “Quantum supremacy for simulating a translation-invariant ising spin model,” Phys. Rev. Lett. 118
2017
Closest in time.
2017
Closest in time.
Shunji Matsuura, Hidetoshi Nishimori, Walter Vinci, Tameem Albash, and Daniel A. Lidar, “Quantum-annealing correction at finite temperature: Ferromagnetic p p -spin models,” Phys. Rev. A 95
2017
Closest in time.
Nicholas Chancellor, “Modernizing quantum annealing using local searches,” New Journal of Physics 19
2017
Closest in time.
Hamed Karimi and Gili Rosenberg, “Boosting quantum annealer performance via sample persistence,” Quantum Information Processing 16
2017
Closest in time.
2017
Closest in time.
Zhang Jiang and Eleanor G. Rieffel, “Non-commuting two-local hamiltonians for quantum error suppression,” Quantum Information Processing 16
2017
Closest in time.
Milad Marvian and Daniel A. Lidar, “Error suppression for hamiltonian-based quantum computation using subsystem codes,” Phys. Rev. Lett. 118
2017
Closest in time.