Fetching the paper…
Reading the bibliography…
Quantum technology is maturing to the point where quantum devices, such as quantum communication systems, quantum random number generators and quantum simulators, may be built with capabilities exceeding classical computers.
Equation of state calculations by fast computing machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H. & Teller, E · 1953
Earlier work this paper cites.
On the computational complexity of Ising spin glass models
Barahona, F · 1982
Earlier work this paper cites.
Optimization by simulated annealing
Kirkpatrick, S., Gelatt, C. D. & Vecchi, M. P · 1983
Earlier work this paper cites.
A fast algorithm for the Cyber 205 to simulate the 3d Ising model
Bhanot, G., Duke, D. & Salvador, R · 1986
Earlier work this paper cites.
The beginnings of metallurgy in the old world
Muhly, J · 1988
Earlier work this paper cites.
Sherrington-Kirkpatrick model in a transverse field: Absence of replica symmetry breaking due to quantum fluctuations
Ray, P., Chakrabarti, B. K. & Chakrabarti, A · 1989
Earlier work this paper cites.
A fast vectorized Fortran 77 program for the Monte Carlo simulation of the three-dimensional Ising system
Heuer, H.-O · 1990
Earlier work this paper cites.
Quantum annealing: A new method for minimizing multidimensional functions
Finnila, A., Gomez, M., Sebenik, C., Stenson, C. & Doll, J · 1994
Earlier work this paper cites.
Quantum annealing in the transverse Ising model
Kadowaki, T. & Nishimori, H · 1998
Earlier work this paper cites.
Quantum annealing of a disordered magnet
Brooke, J., Bitko, D., F., T., Rosenbaum & Aeppli, G · 1999
Earlier work this paper cites.
Quantum spin chains in a magnetic field
Kashurnikov, V. A., Prokof’ev, N. V., Svistunov, B. V. & Troyer, M · 1999
Earlier work this paper cites.
Bucket elimination: A unifying framework for reasoning
Dechter, R · 1999
Earlier work this paper cites.
Application of a continuous time cluster algorithm to the two-dimensional random quantum Ising ferromagnet
Rieger, H. & Kawashima, N · 1999
Earlier work this paper cites.
A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
Farhi, E. et al · 2001
Earlier work this paper cites.
Ising models of quantum frustration
Moessner, R. & Sondhi, S. L · 2001
Earlier work this paper cites.
Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model
Martoňák, R., Santoro, G. E. & Tosatti, E · 2002
Cited alongside, same era.
Theory of quantum annealing of an Ising spin glass
Santoro, G. E., Martoňák, R., Tosatti, E. & Car, R · 2002
Cited alongside, same era.
Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model
Martoňák, R., Santoro, G. E. & Tosatti, E · 2002
Cited alongside, same era.
Optimization by quantum annealing: Lessons from hard satisfiability problems
Battaglia, D. A., Santoro, G. E. & Tosatti, E · 2005
Cited alongside, same era.
Size dependence of the minimum excitation gap in the quantum adiabatic algorithm
Young, A. P., Knysh, S. & Smelyanskiy, V. N · 2008
Cited alongside, same era.
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
Experimental signature of programmable quantum annealing (2012)
Boixo, S., Albash, T., Spedalieri, F. M., Chancellor, N. & Lidar, D. A · 2012
Later among the works it cites.
Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
Farhi, E. et al · 2012
Later among the works it cites.
Experimental determination of Ramsey numbers with quantum annealing (2012)
Bian, Z., Chudak, F., Macready, W. G., Clark, L. & Gaitan, F · 2012
Later among the works it cites.
Finding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G. & Aspuru-Guzik, A · 2012
Later among the works it cites.
Improved exact solver for the weighted max-sat problem
Kuegel, A · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Choi, V · 2008
Cited alongside, same era.
First order quantum phase transition in adiabatic quantum computation
Amin, M. H. S. & Choi, V · 2009
Cited alongside, same era.
First-order transitions and the performance of quantum algorithms in random optimization problems
Jörg, T., Krzakala, F., Semerjian, G. & Zamponi, F · 2010
Cited alongside, same era.
Anderson localization makes adiabatic quantum optimization fail
Altshuler, B., Krovi, H. & Roland, J · 2010
Cited alongside, same era.
Experimental demonstration of a robust and scalable flux qubit
Harris, R. et al · 2010
Cited alongside, same era.
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor
Harris, R. et al · 2010
Cited alongside, same era.
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Rendl, F., Rinaldi, G. & Wiegele, A · 2010
Cited alongside, same era.
Adiabatic quantum programming: Minor embedding with hard faults
Klymko, C., Sullivan, B. D. & Humble, T. S · 2012
Later among the works it cites.
Excitation gap from optimized correlation functions in quantum Monte Carlo simulations
Hen, I · 2012
Later among the works it cites.
Thermally assisted quantum annealing of a 16-qubit problem
Dickson, N. G. et al · 2013
Closest in time.
Ising formulations of many NP problems (2013)
Lucas, A · 2013
Closest in time.
Comment on: ‘Classical signature of quantum annealing’ (2013)
Wang, L. et al · 2013
Closest in time.
Classical signature of quantum annealing (2013)
Smolin, J. A. & Smith, G · 2013
Closest in time.
Experimental evaluation of an adiabatic quantum system for combinatorial optimization
McGeoch, C. C. & Wang, C · 2013
Closest in time.
The quantum adiabatic algorithm applied to random optimization problems: The quantum spin glass perspective
Bapst, V., Foini, L., Krzakala, F., Semerjian, G. & Zamponi, F · 2013
Closest in time.
A scalable readout system for a superconducting adiabatic quantum optimization system
Berkley, A. J. et al · 2048
Closest in time.