The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Evidence for quantum annealing with more than one hundred qubits
Open accessAbstract
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. A quantum annealer, in particular, solves optimization problems by evolving a known initial configuration at non-zero temperature towards the ground state of a Hamiltonian encoding a given problem. Here, we present results from tests on a 108 qubit D-Wave One device based on superconducting flux qubits. By studying correlations we find that the device performance is inconsistent with classical annealing or that it is governed by classical spin dynamics. In contrast, we find that the device correlates well with simulated quantum annealing. We find further evidence for quantum annealing in the form of small-gap avoided level crossings characterizing the hard problems. To assess the computational power of the device we compare it against optimized classical algorithms. Quantum annealing is expected to solve certain optimization problems more efficiently, but there are still open questions regarding the functioning of devices such as D-Wave One. A numerical and experimental investigation of its performance shows evidence for quantum annealing with 108 qubits.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“For example, the achievable rate for the transmission of classical information over a noisy quantum channel is given by the Holevo-Schumacher-Westmorel (HSW) coding theorem [136], which generalizes the Shannon's theorem in quantum settings.”
From Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future (2019) · cites this paper as [136]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134 · cited 1×
“Mimicking this process in computer simulations is the idea behind simulated annealing as an optimisation method [8], which views the cost function of an optimisation problem as the energy of a physical system.”
MethodEquation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
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 · cited 3×
“Unlike adiabatic quantum computing [16], which has a similar schedule but assumes fully coherent adiabatic ground state evolution at zero temperature, quantum annealing [4–6, 10] is a positive temperature method involving an open quantum system coupled to a thermal bath.”
BackgroundMethodQuantum simulations with ultracold quantum gases
Bloch, I., Dalibard, J., & Nascimbène, S. (2012) · Nature Physics · doi:10.1038/nphys2259 · Cited by 2,339 · cited 1×
“At a time when quantum effects start to pose limits to further miniaturisation of devices and the exponential performance increase due to Moore’s law, quantum technology is maturing to the point where quantum devices, such as quantum communication systems [1], quantum random number generators [2] and quantum simulator…”
BackgroundA 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 · cited 1×
“Unlike adiabatic quantum computing [16], which has a similar schedule but assumes fully coherent adiabatic ground state evolution at zero temperature, quantum annealing [4–6, 10] is a positive temperature method involving an open quantum system coupled to a thermal bath.”
MethodQuantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891 · cited 3×
“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.”
BackgroundMethodInfluentialEquation of state calculations by fast computing machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · doi:10.2172/4390578 · Cited by 1,701
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 1×
“This problem is nondeterministic polynomially (NP) hard [15], meaning that it is at least as hard as the hardest problems in NP, a class which includes notoriously difficult problems such as traveling salesman, satisfiablity of logical formulas, and ar X iv :1 30 4.”
BackgroundTheory of Quantum Annealing of an Ising Spin Glass
Santoro, G. E., Martoňák, R., Tosatti, E., & Car, R. (2002) · Science · doi:10.1126/science.1068774 · Cited by 734 · cited 3×
“[11], we also observe that the simulated quantum annealer here scales slightly worse than the simulated classical annealer.”
BackgroundMethodInfluential
Research works printed but not linked: 1
- McGeoch, C. C. & Wang, C. Proc. 2013 ACM Conf. Comput. Frontiers (ACM, 2013).
Cited by
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
“The scaling of the algorithm with n is then determined from the scaling with n of TTSopt, as, e.g., in (Boixo et al., 2014).”
MethodSelf-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
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Self-citation
Metadata
- Authors
- Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M.
- Affiliations
- University of Southern California (US)
- ETH Zurich (CH)
- Microsoft (United States) (US)
- University of California, Santa Barbara (US)
- Corresponding author
- Troyer, Matthias
- Venue
- Nature Physics
- Published
- 2014-02-28
- Volume
- 10
- Issue
- 3
- Pages
- 218-224
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2117762142
- Cited by
- 810
- References
- 49
- Citations by year
- 2026: 35 · 2025: 49 · 2024: 49 · 2023: 51 · 2022: 68 · 2021: 71 · 2020: 67 · 2019: 71 · 2018: 66 · 2017: 97 · 2016: 67 · 2015: 68 · 2014: 41
- FWCI
- 90.73
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- 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 › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum annealing, superconducting flux qubit, avoided crossings, spin correlations, optimization problems, ground state, simulated quantum annealing
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Evidence for quantum annealing with more than one hundred qubits. https://app.cochat.ai/papers/10.1038/nphys2900
- The paper
- Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014). Evidence for quantum annealing with more than one hundred qubits. Nature Physics. https://doi.org/10.1038/nphys2900
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.