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
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447323 · Cited by 457
Devoret, M. H., Martinis, J. M., & Clarke, J. (1985) · Physical Review Letters · doi:10.1103/physrevlett.55.1908 · Cited by 454
Macroscopic Quantum Tunneling in 1-μm Nb Josephson Junctions
Voss, R. F., & Webb, R. A. (1981) · Physical Review Letters · doi:10.1103/physrevlett.47.265 · Cited by 436
Entangled quantum state of magnetic dipoles
Ghosh, S., Rosenbaum, T. F., Aeppli, G., & Coppersmith, S. N. (2003) · Nature · doi:10.1038/nature01888 · Cited by 343
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor
Harris, R., Johnson, M. W., Lanting, T., Berkley, A. J., Johansson, J., Bunyk, P., Tolkacheva, E., Ladizinsky, E., Ladizinsky, N., Oh, T., et al. (2010) · Physical Review B · doi:10.1103/physrevb.82.024511 · Cited by 273
Self-citationQuantum non-demolition measurement of a superconducting two-level system
Lupaşcu, A., Saito, S., Picot, T., de Groot, P. C., Harmans, C. J. P. M., & Mooij, J. E. (2007) · Nature Physics · doi:10.1038/nphys509 · Cited by 251
Experimental Implementation of an Adiabatic Quantum Optimization Algorithm
Steffen, M., van Dam, W., Hogg, T., Breyta, G., & Chuang, I. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.067903 · Cited by 183
Experimental demonstration of a robust and scalable flux qubit
Harris, R., Johansson, J., Berkley, A. J., Johnson, M. W., Lanting, T., Han, S., Bunyk, P., Ladizinsky, E., Oh, T., Perminov, I., et al. (2010) · Physical Review B · doi:10.1103/physrevb.81.134510 · Cited by 177
Self-citationMultilevel quantum description of decoherence in superconducting qubits
Burkard, G., Koch, R. H., & DiVincenzo, D. P. (2004) · Physical Review B · doi:10.1103/physrevb.69.064503 · Cited by 176
Realizable Hamiltonians for universal adiabatic quantum computers
Biamonte, J. D., & Love, P. J. (2008) · Physical Review A · doi:10.1103/physreva.78.012352 · Cited by 173
Amplitude spectroscopy of a solid-state artificial atom
Berns, D. M., Rudner, M. S., Valenzuela, S. O., Berggren, K. K., Oliver, W. D., Levitov, L. S., & Orlando, T. P. (2008) · Nature · doi:10.1038/nature07262 · Cited by 157
Compound Josephson-junction coupler for flux qubits with minimal crosstalk
Harris, R., Lanting, T., Berkley, A. J., Johansson, J., Johnson, M. W., Bunyk, P., Ladizinsky, E., Ladizinsky, N., Oh, T., & Han, S. (2009) · Physical Review B · doi:10.1103/physrevb.80.052506 · Cited by 95
Self-citationSpin dynamics of heterometallic Cr7M wheels ( M=Mn , Zn, Ni) probed by inelastic neutron scattering
Caciuffo, R., Guidi, T., Amoretti, G., Carretta, S., Liviotti, E., Santini, P. M., Mondelli, C., Timco, G. A., Muryn, C. A., & Winpenny, R. E. P. (2005) · Physical Review B · doi:10.1103/physrevb.71.174407 · Cited by 92
Elementary Excitations in the Cyclic Molecular Nanomagnet Cr8
Waldmann, O., Guidi, T., Carretta, S., Mondelli, C., & Dearden, A. L. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.237202 · Cited by 91
S Mixing and Quantum Tunneling of the Magnetization in Molecular Nanomagnets
Carretta, S., Liviotti, E., Magnani, N., Santini, P. M., & Amoretti, G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.207205 · Cited by 85
Probing Noise in Flux Qubits via Macroscopic Resonant Tunneling
Harris, R., Johnson, M. W., Han, S., Berkley, A. J., Johansson, J., Bunyk, P., Ladizinsky, E., Govorkov, S., Thom, M. C., Uchaikin, S., et al. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.117003 · Cited by 81
Self-citationHogg, T. (2000) · Physical Review A · doi:10.1103/physreva.61.052311 · Cited by 70
Molecular nanomagnets: towards molecular spintronics
Wernsdorfer, W. (2010) · International Journal of Nanotechnology · doi:10.1504/ijnt.2010.031732 · Cited by 61
Coherent oscillations in a superconducting tunable flux qubit manipulated without microwaves
Poletto, S., Chiarello, F., Castellano, M. G., Lisenfeld, J., Lukashenko, A., Cosmelli, C., Torrioli, G., Carelli, P., & Ustinov, A. V. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/1/013009 · Cited by 50
Comparative assessment of methods for aligning multiple genome sequences
Chen, X., & Tompa, M. (2010) · Nature Biotechnology · doi:10.1038/nbt.1637 · Cited by 48
Inelastic neutron scattering study of the molecular grid nanomagnet Mn- [3×3]
Guidi, T., Carretta, S., Santini, P. M., Liviotti, E., Magnani, N., Mondelli, C., Waldmann, O., Thompson, L. K., Zhao, L., Frost, C. D., et al. (2004) · Physical Review B · doi:10.1103/physrevb.69.104432 · Cited by 35
Correlated flux noise and decoherence in two inductively coupled flux qubits
Yoshihara, F., Nakamura, Y., & Tsai, J. S. (2010) · Physical Review B · doi:10.1103/physrevb.81.132502 · Cited by 35
Decoherence in rf SQUID qubits
Bennett, D. A., Longobardi, L., Patel, V., Chen, W., Averin, D. V., & Lukens, J. E. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0099-8 · Cited by 30
Multiphoton excitations and inverse population in a system of two flux qubits
Il’ichev, E. V., Shevchenko, S. N., van der Ploeg, S. H. W., Grajcar, M., Temchenko, E. A., Omelyanchouk, A. N., & Meyer, H. ‐. (2010) · Physical Review B · doi:10.1103/physrevb.81.012506 · Cited by 19
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
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.