Fetching the paper…
Reading the bibliography…
Quantum annealing is a heuristic quantum algorithm which exploits quantum resources to minimize an objective function embedded as the energy levels of a programmable physical system.
On the computational complexity of ising spin glass models
Barahona, Francisco · 1982
Earlier work this paper cites.
Optimization by simmulated annealing
Kirkpatrick, Scott, Vecchi, MP, et al · 1983
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, Peter W · 1997
Earlier work this paper cites.
Quantum annealing in the transverse ising model
Kadowaki, Tadashi and Nishimori, Hidetoshi · 1998
Earlier work this paper cites.
Quantum annealing of a disordered magnet
Brooke, J, Bitko, D, Rosenbaum, T, and Aeppli, G · 1999
Earlier work this paper cites.
Quantum computation by adiabatic evolution
Farhi, Edward, Goldstone, Jeffrey, Gutmann, Sam, and Sipser, Michael · 2000
Earlier work this paper cites.
Classical and quantum computation
Kitaev, Alexei Yu, Shen, Alexander, and Vyalyi, Mikhail N · 2002
Earlier work this paper cites.
Theory of quantum annealing of an ising spin glass
Santoro, Giuseppe E, Martoňák, Roman, Tosatti, Erio, and Car, Roberto · 2002
Earlier work this paper cites.
On l2-norm regularization and the gaussian prior
Rennie, Jason · 2003
Cited alongside, same era.
Pattern recognition and machine learning (information science and statistics). 2006, 2006
Bishop, Christopher M · 2006
Cited alongside, same era.
Evidence contrary to the statistical view of boosting
Mease, David and Wyner, Abraham · 2008
Cited alongside, same era.
Quantum simulations of classical annealing processes
Somma, RD, Boixo, S, Barnum, H, and Knill, E · 2008
Cited alongside, same era.
Random classification noise defeats all convex potential boosters
Long, Philip M and Servedio, Rocco A · 2010
Cited alongside, same era.
Quantum annealing with manufactured spins
Johnson, MW, Amin, MHS, Gildert, S, Lanting, T, Hamze, F, Dickson, N, Harris, R, Berkley, AJ, Johansson, J, Bunyk, P, Chapple, EM, Enderud, C, Hilton, JP, Karimi, K, Ladizinsky, E, Ladizinsky, N, Oh, T, Perminov, I, Rich, C Thom, MC, Tolkacheva, E Truncik, CJS, Uchaikin, S, Wang, J, Wilson, B, and Rose, B · 2011
Robust classification with adiabatic quantum optimization
Denchev, Vasil, Ding, Nan, Neven, Hartmut, and Vishwanathan, SVN · 2012
Later among the works it cites.
Agnostic learning of monomials by halfspaces is hard
Feldman, Vitaly, Guruswami, Venkatesan, Raghavendra, Prasad, and Wu, Yi · 2012
Later among the works it cites.
Quantum speedup by quantum annealing
Somma, Rolando D, Nagaj, Daniel, and Kieferová, Mária · 2012
Later among the works it cites.
Resource efficient gadgets for compiling adiabatic quantum optimization problems
Babbush, Ryan, O’Gorman, Bryan, and Aspuru-Guzik, Alán · 2013
Later among the works it cites.
Noise tolerance under risk minimization
Manwani, Naresh and Sastry, PS · 2013
Later among the works it cites.
Superconducting quantum circuits at the surface code threshold for fault tolerance
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
On quadratization of pseudo-boolean functions
Boros, Endre and Gruber, Aritanan · 2012
Cited alongside, same era.
Barends, R, Kelly, J, Megrant, A, Veitia, A, Sank, D, Jeffrey, E, White, TC, Mutus, J, Fowler, AG, Campbell, Chen, Y, Chen, Z, Chiaro, B, Dunsworth, A, Neill, C, O’Malley, P, Roushan, P, Vainsencher, A, Wenner, J, Korotkov, AN, Cleland, AN, and Martinis, J · 2014
Closest in time.
Evidence for quantum annealing with more than one hundred qubits
Boixo, Sergio, Rønnow, Troels F, Isakov, Sergei V, Wang, Zhihui, Wecker, David, Lidar, Daniel A, Martinis, John M, and Troyer, Matthias · 2014
Closest in time.