Quantum annealing with manufactured spins
The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Abstract
Many interesting but practically intractable problems can be reduced to that of finding the ground state of a system of interacting spins; however, finding such a ground state remains computationally difficult. It is believed that the ground state of some naturally occurring spin systems can be effectively attained through a process called quantum annealing. If it could be harnessed, quantum annealing might improve on known methods for solving certain types of problem. However, physical investigation of quantum annealing has been largely confined to microscopic spins in condensed-matter systems. Here we use quantum annealing to find the ground state of an artificial Ising spin system comprising an array of eight superconducting flux quantum bits with programmable spin-spin couplings. We observe a clear signature of quantum annealing, distinguishable from classical thermal annealing through the temperature dependence of the time at which the system dynamics freezes. Our implementation can be configured in situ to realize a wide variety of different spin networks, each of which can be monitored as it moves towards a low-energy configuration. This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples. Moreover, with an increased number of spins, such a system may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effect…
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Quantum annealing (QA) has the potential to signi fi cantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [3]
In the citing paper
“The quantum annealer is a special quantum computer designed to solve combinatorial optimization problems with problem-size-independent time complexity 3 -5 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [3]
In the citing paper
“Suf fi ciently slow evolution from H 0 to Hp enables the quantumsystem to stay at the ground state, which leads to the identi fi cation of the optimal solution of a given combinatorial optimization problem 3,40 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [3]
In the citing paper
“The most prominent exponent of this approach is the company D-Wave Systems, which has built large machines designed to implement this algorithm, 36 with the most recent such machine ( ' D-Wave 2X ' ) announced as having up to 1,152 qubits.”
From Quantum algorithms: an overview (2016) · cites this paper as [36]
Citations
Cites
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Manipulating the Quantum State of an Electrical Circuit
Vion, D., Aassime, A., Cottet, A., Joyez, P., Pothier, H., Urbina, C., Esteve, D., & Devoret, M. H. (2002) · Science · doi:10.1126/science.1069372 · Cited by 1,622
Rocha, A. R., García-suárez, V. M., Bailey, S. W., Lambert, C. J., Ferrer, J., & Sanvito, S. (2005) · Nature Materials · doi:10.1038/nmat1349 · Cited by 1,318
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306 · cited 2×
“Here we modify this annealing procedure to perform a specialized experiment that permits us to distinguish between these two cases, by allowing the hi in equation (1) to be time dependent.”
BackgroundMethodDemonstration of two-qubit algorithms with a superconducting quantum processor
DiCarlo, L., Chow, J. M., Gambetta, J. M., Bishop, L. S., Johnson, B. R., Schuster, D. I., Majer, J., Blais, A., Frunzio, L., Girvin, S. M., et al. (2009) · Nature · doi:10.1038/nature08121 · Cited by 1,172
Quantum simulation of frustrated Ising spins with trapped ions
Kim, K., Chang, M.-S., Korenblit, S., Islam, R., Edwards, E. E., Freericks, J. K., Lin, G.-D., Duan, L.-M., & Monroe, C. (2010) · Nature · doi:10.1038/nature09071 · Cited by 750
Quantum annealing: A new method for minimizing multidimensional functions
Finnila, A. B., Gomez, M. A., Sebenik, C., Stenson, C., & Doll, J. D. (1994) · Chemical Physics Letters · doi:10.1016/0009-2614(94)00117-0 · Cited by 644
Quantum Annealing of a Disordered Magnet
Brooke, J., Bitko, D., F., T., Rosenbaum, & Aeppli, G. (1999) · Science · doi:10.1126/science.284.5415.779 · Cited by 518
Cited by
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
“It is probable that the successful experimental implementations of AQO with the most qubits are on devices generated by DWave Systems [11, 12, 13].6 As such, we now discuss the ease with which these Hamiltonians can be encoded onto such a device.”
BackgroundMethodInfluentialA quantum engineer's guide to superconducting qubits
Krantz, P., Kjaergaard, M., Yan, F., Orlando, T. P., Gustavsson, S., & Oliver, W. D. (2019) · Applied Physics Reviews · doi:10.1063/1.5089550 · Cited by 2,004
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
“This remains an area of very active research, partly due to the original (still unmaterialized) hope that the QAA would deliver quantum speedups for NP-complete problems (Farhi et al., 2001), and partly due the availability of commercial quantum annealing devices such as those manufactured by D-Wave Systems Inc. (John…”
BackgroundSuperconducting Qubits: Current State of Play
Kjaergaard, M., Schwartz, M. E., Braumüller, J., Krantz, P., Wang, J. I.-J., Gustavsson, S., & Oliver, W. D. (2020) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031119-050605 · Cited by 1,544
Self-citationTrapped-ion quantum computing: Progress and challenges
Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (2019) · Applied Physics Reviews · doi:10.1063/1.5088164 · Cited by 1,483
Microwave photonics with superconducting quantum circuits
Gu, X., Kockum, A. F., Miranowicz, A., Liu, Y.-X., & Nori, F. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.002 · Cited by 1,307
Superconducting Qubits: Current State of PlayPreprint
Kjærgaard, M., Schwartz, M. E., Braumüller, J., Krantz, P., Wang, J. I.-J., Gustavsson, S., & Oliver, W. D. (2020) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,192
Self-citationQuantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
“, which has built large machines designed to implement this algorithm [51], with the most recent such machine (“D-Wave 2X”) announced as having up to 1152 qubits.”
On-chip quantum simulation with superconducting circuits
Houck, A. A., Türeci, H. E., & Koch, J. (2012) · Nature Physics · doi:10.1038/nphys2251 · Cited by 1,069
Scalable Quantum Simulation of Molecular Energies
O’Malley, P. J. J., Babbush, R., Kivlichan, I. D., Romero, J., McClean, J. R., Barends, R., Kelly, J., Roushan, P., Tranter, A., Ding, N., et al. (2016) · Physical Review X · doi:10.1103/physrevx.6.031007 · Cited by 1,059
Grollier, J., Querlioz, D., Camsari, K. Y., Everschor-Sitte, K., Fukami, S., & Stiles, M. D. (2020) · Nature Electronics · doi:10.1038/s41928-019-0360-9 · Cited by 975
Quantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
“n as quantum circuits and to be able to prot from coherence and entanglement. The D-Wave Systems machines are built top-down - scaling up is based on ux qubits and circuits with short coherence time [123,124,389]. As a result, the coherence and entanglement properties have to be investigated by performing various type…”
BackgroundNeural-network quantum state tomography
Torlai, G., Mazzola, G., Carrasquilla, J., Troyer, M., Melko, R., & Carleo, G. (2018) · Nature Physics · doi:10.1038/s41567-018-0048-5 · Cited by 843
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810
“In this work we report on computer simulations and experimental tests on a D-Wave One device [13] in order to address central open questions about quantum annealers: is the device actually a quantum annealer, i.”
BackgroundMethodInfluentialA coherent Ising machine for 2000-node optimization problems
Inagaki, T., Haribara, Y., Igarashi, K., Sonobe, T., Tamate, S., Honjo, T., Marandi, A., McMahon, P. L., Umeki, T., Enbutsu, K., et al. (2016) · Science · doi:10.1126/science.aah4243 · Cited by 796
A fully programmable 100-spin coherent Ising machine with all-to-all connections
McMahon, P. L., Marandi, A., Haribara, Y., Hamerly, R., Langrock, C., Tamate, S., Inagaki, T., Takesue, H., Utsunomiya, S., Aihara, K., et al. (2016) · Science · doi:10.1126/science.aah5178 · Cited by 702
Embedded Devices for Neuromorphic Time-Series Assessment
Mazumder, A. N., Hosseini, M., & Mohsenin, T. (2022) · Research Explorer (The University of Manchester) · doi:10.13016/m2ksy0-wxr3 · Cited by 652
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Defining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601
Network of time-multiplexed optical parametric oscillators as a coherent Ising machine
Marandi, A., Wang, Z., Takata, K., Byer, R. L., & Yamamoto, Y. (2014) · Nature Photonics · doi:10.1038/nphoton.2014.249 · Cited by 541
“sical and quantum computers. Currently, simulated annealing [2] and various approximate algorithms [8–10] are among the widely used methods in classical digital computers. Recently, quantum annealing [3, 4, 6] and adiabatic quantum computation [5] have been studied intensively for solving those NP problems. Even thoug…”
Amin, M. H., Andriyash, E., Rolfe, J., Kulchytskyy, B., & Melko, R. (2018) · Physical Review X · doi:10.1103/physrevx.8.021050 · Cited by 520
“With the development of quantum annealing processors [14], it has become possible to test machine learning ideas with an actual quantum hardware [15, 16].”
BackgroundSelf-citationPerspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
Traffic Flow Optimization Using a Quantum Annealer
Neukart, F., Compostella, G., Seidel, C., von Dollen, D., Yarkoni, S., & Parney, B. (2017) · Frontiers in ICT · doi:10.3389/fict.2017.00029 · Cited by 458
“Quantum annealing technologies such as the quantum processing units (QPUs) made by D-Wave Systems are designed to solve complex combinatorial optimization problems (Johnson et al., 2011).”
BackgroundPhysics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., & Katzgraber, H. G. (2019) · Frontiers in Physics · doi:10.3389/fphy.2019.00048 · Cited by 442
“Efforts to benchmark quantum annealers against classical counterparts such as simulated annealing (SA) [15] have abounded [14, 16–30].”
BackgroundTunable Coupling Scheme for Implementing High-Fidelity Two-Qubit Gates
Yan, F., Krantz, P., Sung, Y., Kjaergaard, M., Campbell, D. L., Orlando, T. P., Gustavsson, S., & Oliver, W. D. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.10.054062 · Cited by 423
“) coupling is a phenomenon commonly seen in many systems, including Rydberg atoms [4, 7], trapped ions [5, 8], semiconductor spin qubits [9, 10], and superconducting qubits [11, 12].”
BackgroundCombinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
Goto, H., Tatsumura, K., & Dixon, A. R. (2019) · Science Advances · doi:10.1126/sciadv.aav2372 · Cited by 405
What is the Computational Value of Finite-Range Tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., & Neven, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.031015 · Cited by 399
Cai, F., Kumar, S., Van Vaerenbergh, T., Sheng, X., Liu, R., Li, C., Liu, Z., Foltin, M., Yu, S., Xia, Q., et al. (2020) · Nature Electronics · doi:10.1038/s41928-020-0436-6 · Cited by 393
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) · Scientific Reports · doi:10.1038/srep00571 · Cited by 366
Self-citationA 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS Annealing
(2016) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2015.2498601 · Cited by 368
“Ising computing [5] using superconductors is an example of the natural computing.”
MethodRealizing the classical XY Hamiltonian in polariton simulators
Berloff, N. G., Silva, M., Kalinin, K., Askitopoulos, A., Töpfer, J. D., Cilibrizzi, P., Langbein, W., & Lagoudakis, P. G. (2017) · Nature Materials · doi:10.1038/nmat4971 · Cited by 341
Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor
Bunyk, P. I., Hoskinson, E. M., Johnson, M. W., Tolkacheva, E., Altomare, F., Berkley, A. J., Harris, R., Hilton, J. P., Lanting, T., Przybysz, A. J., et al. (2014) · IEEE Transactions on Applied Superconductivity · doi:10.1109/tasc.2014.2318294 · Cited by 312
“The authors have previously presented the architecture, design, and operation of an SFQbased system for controlling [3] and reading out [4] a quantum annealing processor based on flux qubits [1], [5] at the core of D-Wave One system.”
BackgroundSelf-citationQuantum Simulation for High-Energy Physics
Bauer, C. W., Davoudi, Z., Balantekin, A. B., Bhattacharya, T., Carena, M., de Jong, W. A., Draper, P., El-Khadra, A., Gemelke, N., Hanada, M., et al. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.027001 · Cited by 326
Large-Scale Photonic Ising Machine by Spatial Light Modulation
Pierangeli, D., Marcucci, G., & Conti, C. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.213902 · Cited by 347
“Quantum and classical Ising systems have been realized by trapped atoms [4, 5], single photons [6], superconducting circuits [7], electromechanical modes [8], nanomagnets [9] and polariton condensates [10].”
Background100,000-spin coherent Ising machine
Honjo, T., Sonobe, T., Inaba, K., Inagaki, T., Ikuta, T., Yamada, Y., Kazama, T., Enbutsu, K., Umeki, T., Kasahara, R., et al. (2021) · Science Advances · doi:10.1126/sciadv.abh0952 · Cited by 341
Quantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
“The D-Wave device [9, 16, 25, 27] is designed to run the QADI and its performance has been contrasted with simulations of the QADI as well as as with simulated annealing algorithms [8, 15, 30].”
MethodStrawberry Fields: A Software Platform for Photonic Quantum Computing
Killoran, N., Izaac, J., Quesada, N., Bergholm, V., Amy, M., & Weedbrook, C. (2019) · Quantum · doi:10.22331/q-2019-03-11-129 · Cited by 323
“Popular techniques include variational quantum eigensolvers [5, 6], quantum approximate optimization algorithms [7, 8], sampling from computationally hard probability distributions [9–17], and quantum annealing [18, 19].”
MethodKavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · doi:10.1093/oso/9780198782995.001.0001 · Cited by 326
Quantum Machine Learning: What Quantum Computing Means to Data Mining
Wittek, P. (2014) · Cited by 483
Observation of topological phenomena in a programmable lattice of 1,800 qubits
King, A. D., Carrasquilla, J., Raymond, J., Ozfidan, I., Andriyash, E., Berkley, A., Reis, M., Lanting, T., Harris, R., Altomare, F., et al. (2018) · Nature · doi:10.1038/s41586-018-0410-x · Cited by 323
Self-citationEntanglement in a Quantum Annealing Processor
Lanting, T., Przybysz, A. J., Smirnov, A. Y., Spedalieri, F. M., Amin, M. H., Berkley, A. J., Harris, R., Altomare, F., Boixo, S., Bunyk, P., et al. (2014) · Physical Review X · doi:10.1103/physrevx.4.021041 · Cited by 195
“We have built a processor that implements HS using superconducting flux qubits as effective spins [6,7,23,24].”
BackgroundMethodSelf-citationWitnessing Quantum Coherence: from solid-state to biological systems
Li, C.-M., Lambert, N., Chen, Y.-N., Chen, G.-Y., & Nori, F. (2012) · Scientific Reports · doi:10.1038/srep00885 · Cited by 297
“, transport in nanostructures, biological systems, and perhaps even large-arrays of qubits used in adiabatic quantum computing [51].”
BackgroundHigh-Coherence Fluxonium Qubit
Nguyen, L. B., Lin, Y.-H., Somoroff, A., Mencia, R., Grabon, N., & Manucharyan, V. E. (2019) · Physical Review X · doi:10.1103/physrevx.9.041041 · Cited by 261
Quantum implementation of the unitary coupled cluster for simulating molecular electronic structure
Shen, Y., Zhang, X., Zhang, S., Zhang, J.-N., Yung, M.-H., & Kim, K. (2017) · Physical Review A · doi:10.1103/physreva.95.020501 · Cited by 295
Realizing the classical XY Hamiltonian in polariton simulators.
Berloff, N. G., Silva, M., Kalinin, K. P., Askitopoulos, A., Töpfer, J. D., Cilibrizzi, P., Langbein, W., & Lagoudakis, P. G. (2017) · Apollo (University of Cambridge) · doi:10.17863/cam.43426 · Cited by 287
Experimental signature of programmable quantum annealing
Boixo, S., Albash, T., Spedalieri, F. M., Chancellor, N., & Lidar, D. A. (2013) · Nature Communications · doi:10.1038/ncomms3067 · Cited by 293
A practical heuristic for finding graph minors
Cai, J. L., Macready, W. G., & Roy, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.2741 · Cited by 219
“D-Wave Two solves these problems using adiabatic quantum annealing [8]: a quantum system is slowly evolved until the ground state of the system encodes the solution to the optimization problem [11, 13].”
BackgroundCoupled oscillators for computing: A review and perspective
Csaba, G., & Porod, W. (2020) · Applied Physics Reviews · doi:10.1063/1.5120412 · Cited by 279
Quantum adiabatic Markovian master equations
Albash, T., Boixo, S., Lidar, D. A., & Zanardi, P. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123016 · Cited by 281
Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice
McGeoch, C. C. (2014) · Synthesis lectures on quantum computing · doi:10.2200/s00585ed1v01y201407qmc008 · Cited by 341
Warm-starting quantum optimization
Egger, D. J., Mareček, J., & Woerner, S. (2021) · Quantum · doi:10.22331/q-2021-06-17-479 · Cited by 269
“The quantum approximate optimization algorithm (QAOA) [16–18], inspired by Trotterization of adiabatic quantum computing [19–21], can be run on gate-based quantum computers [22, 23].”
MethodLarge-scale Ising spin network based on degenerate optical parametric oscillators
Inagaki, T., Inaba, K., Hamerly, R., Inoue, K., Yamamoto, Y., & Takesue, H. (2016) · Nature Photonics · doi:10.1038/nphoton.2016.68 · Cited by 258
“Various schemes have been proposed and demonstrated that simulate the Ising Hamiltonian with physical systems, such as superconducting circuits [1], trapped ions [2], CMOS devices [3], and electro-mechanical oscillators [4].”
BackgroundA quantum annealing architecture with all-to-all connectivity from local interactions
Lechner, W., Hauke, P., & Zoller, P. (2015) · Science Advances · doi:10.1126/sciadv.1500838 · Cited by 256
Coherent Ising machines—optical neural networks operating at the quantum limit
Yamamoto, Y., Aihara, K., Leleu, T., Kawarabayashi, K.-I., Kako, S., Fejer, M., Inoue, K., & Takesue, H. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0048-9 · Cited by 258
Intrinsic optimization using stochastic nanomagnets
Sutton, B., Camsari, K. Y., Behin-Aein, B., & Datta, S. (2017) · Scientific Reports · doi:10.1038/srep44370 · Cited by 226
“Many diverse systems have been proposed to solve NP-hard optimization problems such as those based on simulated annealing [2], DNA[3, 4], quantum annealing [5, 6], Cellular Neural Networks [7–9], CMOS [10], trapped ions [11], electromechanics [12], optics [13–20], and magnets [21–23].”
BackgroundQuantum critical dynamics in a 5,000-qubit programmable spin glass
King, A. D., Raymond, J., Lanting, T., Harris, R., Zucca, A., Altomare, F., Berkley, A. J., Boothby, K., Ejtemaee, S., Enderud, C., et al. (2023) · Nature · doi:10.1038/s41586-023-05867-2 · Cited by 242
Self-citationp-bits for probabilistic spin logic
Camsari, K. Y., Sutton, B. M., & Datta, S. (2019) · Applied Physics Reviews · doi:10.1063/1.5055860 · Cited by 225
“Optimization by quantum annealing: An approach that has been explored is the process of quantum annealing using a network of quantum spins implemented with superconducting q-bits 83,84 .”
MethodAlgebraic versus Exponential Decoherence in Dissipative Many-Particle Systems
Cai, Z., & Barthel, T. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.150403 · Cited by 243
Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
Albash, T., & Lidar, D. A. (2018) · Physical Review X · doi:10.1103/physrevx.8.031016 · Cited by 238
“We answer this question in the affirmative and report on the first observation of a quantum hardware scaling advantage when comparing simulated annealing with singlespin updates (SA) [8] to a quantum annealer [9], for a specific problem class we introduce here.”
BackgroundTrade-Off Between Speed and Cost in Shortcuts to Adiabaticity
Campbell, S., & Deffner, S. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.100601 · Cited by 235
“Hence, our analysis is particularly important for current efforts in building and improving quantum computing hardware [72,74,75].”
BackgroundLimitations of optimization algorithms on noisy quantum devices
Stilck França, D., & García-Patrón, R. (2021) · Nature Physics · doi:10.1038/s41567-021-01356-3 · Cited by 232
Reverse quantum annealing approach to portfolio optimization problems
Venturelli, D., & Kondratyev, A. (2019) · Quantum Machine Intelligence · doi:10.1007/s42484-019-00001-w · Cited by 233
Computational multiqubit tunnelling in programmable quantum annealers
Boixo, S., Smelyanskiy, V. N., Shabani, A., Isakov, S. V., Dykman, M., Denchev, V. S., Amin, M. H., Smirnov, A. Y., Mohseni, M., & Neven, H. (2016) · Nature Communications · doi:10.1038/ncomms10327 · Cited by 233
Self-citationHigh-performance combinatorial optimization based on classical mechanics
Goto, H., Endo, K., Suzuki, M., Sakai, Y., Kanao, T., Hamakawa, Y., Hidaka, R., Yamasaki, M., & Tatsumura, K. (2021) · Science Advances · doi:10.1126/sciadv.abe7953 · Cited by 231
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network
Goto, H. (2016) · Scientific Reports · doi:10.1038/srep21686 · Cited by 226
Thermally assisted quantum annealing of a 16-qubit problem
Dickson, N. G., Johnson, M. W., Amin, M. H., Harris, R., Altomare, F., Berkley, A. J., Bunyk, P., Cai, J., Chapple, E. M., Chavez, P., et al. (2013) · Nature Communications · doi:10.1038/ncomms2920 · Cited by 225
Self-citationA case study in programming a quantum annealer for hard operational planning problems
Rieffel, E. G., Venturelli, D., O’Gorman, B., Do, M. B., Prystay, E. M., & Smelyanskiy, V. N. (2015) · Quantum Information Processing · doi:10.1007/s11128-014-0892-x · Cited by 218
“Quantum annealing [16, 18, 24, 42] is a metaheuristic for solving optimization problems which bears some resemblance to simulated annealing, a classical metaheuristic.”
Benedetti, M., Realpe-Gómez, J., Biswas, R., & Perdomo-Ortiz, A. (2016) · Physical Review A · doi:10.1103/physreva.94.022308 · Cited by 215
Quantum versus classical annealing of Ising spin glasses
Heim, B., Rønnow, T. F., Isakov, S. V., & Troyer, M. (2015) · Science · doi:10.1126/science.aaa4170 · Cited by 193
Coherent quantum annealing in a programmable 2,000 qubit Ising chain
King, A. D., Suzuki, S., Raymond, J., Zucca, A., Lanting, T., Altomare, F., Berkley, A. J., Ejtemaee, S., Hoskinson, E., Huang, S., et al. (2022) · Nature Physics · doi:10.1038/s41567-022-01741-6 · Cited by 213
Self-citationBöhm, F., Verschaffelt, G., & Van der Sande, G. (2019) · Nature Communications · doi:10.1038/s41467-019-11484-3 · Cited by 211
Quantum Optimization of Fully Connected Spin Glasses
Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.031040 · Cited by 209
“[29] MW Johnson, MHS Amin, S Gildert, T Lanting, F Hamze, N Dickson, R Harris, AJ Berkley, J Johansson, P Bunyk, et al.”
BackgroundCombinatorial optimization with physics-inspired graph neural networks
Schuetz, M. J. A., Brubaker, J. K., & Katzgraber, H. G. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00468-6 · Cited by 203
“…era, our approach could be used as a broadly applicable, scalable benchmark for emerging quantum technologies, including special-purpose quantum [6] and quantum-inspired annealers [20], while not being resource constrained nor being limited to problem instances in QUBO form, as is also the case…”
BackgroundLi, R. Y., Di Felice, R., Rohs, R., & Lidar, D. A. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0060-8 · Cited by 202
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
“The problems chosen should be sufficiently hard for state-of-the-art classical solvers to leave a margin for quantum methods, but”
Quantum variational autoencoder
Khoshaman, A., Vinci, W., Denis, B., Andriyash, E., Sadeghi, H., & Amin, M. H. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aada1f · Cited by 167
Self-citationWhen does a physical system compute?
Horsman, D., Stepney, S., Wagner, R. C., & Kendon, V. (2014) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2014.0182 · Cited by 196
Efficient partition of integer optimization problems with one-hot encoding
Okada, S., Ohzeki, M., & Taguchi, S. (2019) · Scientific Reports · doi:10.1038/s41598-019-49539-6 · Cited by 190
Error-corrected quantum annealing with hundreds of qubits
Pudenz, K. L., Albash, T., & Lidar, D. A. (2014) · Nature Communications · doi:10.1038/ncomms4243 · Cited by 198
OIM: Oscillator-Based Ising Machines for Solving Combinatorial Optimisation Problems
Wang, T., & Roychowdhury, J. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-19311-9_19 · Cited by 186
Adiabatic Quantum Simulation of Quantum Chemistry
Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014) · Scientific Reports · doi:10.1038/srep06603 · Cited by 191
“How to cite this article: Babbush, R., Love, P.J. & Aspuru-Guzik, A. Adiabatic Quantum Simulation of Quantum Chemistry.”
MethodInfluentialSolving the Optimal Trading Trajectory Problem Using a Quantum Annealer
Rosenberg, G., Haghnegahdar, P., Goddard, P., Carr, P., Wu, K., & de Prado, M. L. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2574703 · Cited by 171
Quantum annealing: an overview
Rajak, A., Suzuki, S., Dutta, A., & Chakrabarti, B. K. (2023) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2021.0417 · Cited by 166
“[88] reported on the remarkable development and functioning of a Josephson-JunctionCoupled circuit quantum Ising spin glass annealing machine, built and later marketed by DWave Systems.”
MethodDesigning metamaterials with quantum annealing and factorization machines
Kitai, K., Guo, J., Ju, S., Tanaka, S., Tsuda, K., Shiomi, J., & Tamura, R. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013319 · Cited by 181
Analog Coupled Oscillator Based Weighted Ising Machine
Chou, J., Bramhavar, S., Ghosh, S., & Herzog, W. (2019) · Scientific Reports · doi:10.1038/s41598-019-49699-5 · Cited by 177
Application of Quantum Annealing to Training of Deep Neural Networks
Adachi, S. H., & Henderson, M. P. (2015) · arXiv · doi:10.48550/arxiv.1510.06356 · Cited by 176
“erposition and tunneling imply that certain types of energy landscapes can be more efficiently explored by quantum annealing than classical simulated annealing [1]. The devices made by D-Wave Systems [2] constitute physical implementations of quantum annealing, and there is some evidence for coherent quantum tunneling…”
BackgroundStimulated Raman adiabatic passage in a three-level superconducting circuit
Kumar, K. S., Vepsäläinen, A., Danilin, S., & Paraoanu, G. S. (2016) · Nature Communications · doi:10.1038/ncomms10628 · Cited by 179
NISQ computing: where are we and where do we go?
Lau, J. W. Z., Lim, K. H., Shrotriya, H., & Kwek, L. C. (2022) · AAPPS Bulletin · doi:10.1007/s43673-022-00058-z · Cited by 173
“More technical details about QA can be found in [98, 103].”
BackgroundMethodSupport vector machines on the D-Wave quantum annealer
Willsch, D., Willsch, M., De Raedt, H., & Michielsen, K. (2020) · Computer Physics Communications · doi:10.1016/j.cpc.2019.107006 · Cited by 174
Exploratory Combinatorial Optimization with Reinforcement Learning
Barrett, T., Clements, W., Foerster, J., & Lvovsky, A. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5723 · Cited by 159
An Ising Hamiltonian solver based on coupled stochastic phase-transition nano-oscillators
Dutta, S., Khanna, A., Assoa, A. S., Paik, H., Schlom, D. G., Toroczkai, Z., Raychowdhury, A., & Datta, S. (2021) · Nature Electronics · doi:10.1038/s41928-021-00616-7 · Cited by 171
Rietsche, R., Dremel, C., Bosch, S., Steinacker, L., Meckel, M., & Leimeister, J. M. (2022) · Electronic Markets · doi:10.1007/s12525-022-00570-y · Cited by 232
Probing for quantum speedup in spin-glass problems with planted solutions
Hen, I., Job, J., Albash, T., Rønnow, T. F., Troyer, M., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.92.042325 · Cited by 167
Superadiabatic population transfer in a three-level superconducting circuit
Vepsäläinen, A., Danilin, S., & Paraoanu, G. S. (2019) · Science Advances · doi:10.1126/sciadv.aau5999 · Cited by 162
Experimental evaluation of an adiabiatic quantum system for combinatorial optimization
McGeoch, C. C., & Wang, C. (2013) · Proceedings of the ACM International Conference on Computing Frontiers · doi:10.1145/2482767.2482797 · Cited by 166
“Finally there has been some debate as to whether D-Wave chips form a “truly’ quantum system; this has been demonstrated for smaller (8 and 16 qubit) systems [22], [25] but not, as yet, for the full hardware graph.”
BackgroundFast clique minor generation in Chimera qubit connectivity graphs
Boothby, T., King, A. D., & Roy, A. (2016) · Quantum Information Processing · doi:10.1007/s11128-015-1150-6 · Cited by 156
“D-Wave quantum annealing processors are designed to sample low-energy spin configurations in the Ising model using open-system quantum annealing [1,2, 6,8].”
MethodQuantum machine learning for chemistry and physics
Sajjan, M., Li, J., Selvarajan, R., Sureshbabu, S. H., Kale, S. S., Gupta, R., Singh, V., & Kais, S. (2022) · Chemical Society Reviews · doi:10.1039/d2cs00203e · Cited by 214
Searching for quantum speedup in quasistatic quantum annealers
Amin, M. H. (2015) · Physical Review A · doi:10.1103/physreva.92.052323 · Cited by 155
Self-citationGrover Adaptive Search for Constrained Polynomial Binary Optimization
Gilliam, A., Woerner, S., & Gonciulea, C. (2021) · Quantum · doi:10.22331/q-2021-04-08-428 · Cited by 153
Metadata
- Authors
- Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., Chapple, E. M., Enderud, C., Hilton, J. P., Karimi, K., Ladizinsky, E., Ladizinsky, N., Oh, T., Perminov, I., Rich, C., Thom, M. C., Tolkacheva, E., Truncik, C. J. S., Uchaikin, S., Wang, J., Wilson, B., & Rose, G.
- Affiliations
- D-Wave Systems (Canada) (CA)
- University of Agder (NO)
- Simon Fraser University (CA)
- Corresponding author
- Johnson, M. W.
- ORCID
- Venue
- Nature
- Published
- 2011-05
- Volume
- 473
- Issue
- 7346
- Pages
- 194-198
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2024860775
- Semantic Scholar
- d0019f2ef578736cd60d7387c99c47bca4272faf
- Cited by
- 1,891
- References
- 34
- Citations by year
- 2026: 130 · 2025: 177 · 2024: 181 · 2023: 173 · 2022: 185 · 2021: 184 · 2020: 152 · 2019: 138 · 2018: 103 · 2017: 141 · 2016: 99 · 2015: 87 · 2014: 75 · 2013: 32 · 2012: 28
- FWCI
- 41.46
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Condensed Matter Physics › Physics of Superconductivity and Magnetism
- Keywords
- quantum annealing, Ising spin systems, superconducting flux qubit, ground state search, spin freezing, combinatorial optimization, quantum algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.