CoChat

Defining and detecting quantum speedup

Open access

The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.

Abstract

How to benchmark a quantum computer: Quantum machines offer the possibility of performing certain computations much faster than their classical counterparts. However, how to define and measure quantum speedup is a topic of debate. Rønnow et al. describe methods for fairly evaluating the difference in computational power between classical and quantum processors. They define various types of quantum speedup and consider quantum processors that are designed to solve a specific class of problems. Science , this issue p. 420

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1126/science.1252319

Cites

37 of 37 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Research works printed but not linked: 8

  1. P. W. Shor in Proceedings 35th Annual Symposium on Foundations of Computer Science (IEEE New York 1994) pp. 124–134.
  2. S. Boixo T. Albash F. M. Spedalieri N. Chancellor D. A. Lidar http://arxiv.org/abs/1212.1739 (2012). · arXiv
  3. W. Vinci T. Albash A. Mishra P. A. Warburton D. A. Lidar http://arxiv.org/abs/1403.4228 (2014). · arXiv
  4. J. A. Smolin G. Smith http://arxiv.org/abs/1305.4904 (2013). · arXiv
  5. S. W. Shin G. Smith J. A. Smolin U. Vazirani http://arxiv.org/abs/1401.7087 (2014). · arXiv
  6. S. Isakov I. Zintchenko T. Rønnow M. Troyer http://arxiv.org/abs/1401.1084 (2014). · arXiv
  7. C. C. McGeoch C. Wang in Proceedings of the ACM Conference on Computing Frontiers (ACM New York 2013) pp. XX–XX.
  8. S. Santra G. Quiroz G. V. Steeg D. A. Lidar http://arxiv.org/abs/1307.3931 (2013). · arXiv

Cited by

  • Quantum Computing in the NISQ era and beyond

    Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830

    “But as of now we don’t have a convincing theoretical argument or persuasive experimental evidence indicating that quantum annealers can really speed up the time to solution compared to the best classical hardware running the best algorithms for the same problems [28, 29].”
    Background
  • Quantum machine learning

    Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779

    “This is known as a quantum speedup [106].”
  • Probing many-body dynamics on a 51-atom quantum simulator

    Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460

    “perconducting [13] and optical [14] systems, but these realizations lack either coherence or quantum nonlinearity, which are essential for achieving full quantum speedup.”
    Background
  • Adiabatic quantum computation

    Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546

    “Moreover, its role in (Boixo et al., 2016; Denchev et al., 2016) is limited to a prefactor, and does not translate into a scaling advantage, i.e., it does not qualify as a speedup according to the classification of (Rønnow et al., 2014).”
    BackgroundMethodSelf-citation
  • Superconducting 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

See all 603

Metadata

Authors
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M.
Affiliations
  • ETH Zurich (CH)
  • University of Southern California (US)
  • Google (Switzerland) (CH)
  • Microsoft (United States) (US)
  • University of California, Santa Barbara (US)
Corresponding author
Troyer, Matthias
Venue
Science
Published
2014-07-25
Volume
345
Issue
6195
Pages
420-424
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W2028918948
Cited by
601
References
37
Citations by year
2026: 35 · 2025: 50 · 2024: 47 · 2023: 50 · 2022: 45 · 2021: 54 · 2020: 47 · 2019: 54 · 2018: 45 · 2017: 44 · 2016: 55 · 2015: 51 · 2014: 24
FWCI
57.83
Type
journal article
Language
en
Open access
Locations
  • Science (publishedVersion)
  • PubMed (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 advantage, quantum annealing, superconducting qubits

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.