CoChat

Quantum advantage in learning from experiments

Open access

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

Abstract

Quantum technology promises to revolutionize how we learn about the physical world. An experiment that processes quantum data with a quantum computer could have substantial advantages over conventional experiments in which quantum states are measured and outcomes are processed with a classical computer. We proved that quantum machines could learn from exponentially fewer experiments than the number required by conventional experiments. This exponential advantage is shown for predicting properties of physical systems, performing quantum principal component analysis, and learning about physical dynamics. Furthermore, the quantum resources needed for achieving an exponential advantage are quite modest in some cases. Conducting experiments with 40 superconducting qubits and 1300 quantum gates, we demonstrated that a substantial quantum advantage is possible with today’s quantum processors.

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.abn7293

Cites

68 of 68 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

Show all 68 references

Research works printed but not linked: 4

  1. M. Cerezo K. Sharma A. Arrasmith P. J. Coles Variational quantum state eigensolver. arXiv.2004.01372 [quant-ph] (2020). · arXiv
  2. I. Goodfellow Y. Bengio A. Courville Deep Learning (The MIT Press 2016).
  3. S. Chen J. Cotler H.-Y. Huang J. Li A hierarchy for replica quantum advantage. arXiv.2111.05874 [quant-ph] (2021). · arXiv
  4. R. S. Sutton A. G. Barto Reinforcement Learning: An introduction (The MIT press 2018).

Cited by

Items 501–516 of 516

Metadata

Authors
Huang, H.-Y., Broughton, M., Cotler, J., Chen, S., Li, J., Mohseni, M., Neven, H., Babbush, R., Kueng, R., Preskill, J., & McClean, J. R.
Affiliations
  • California Institute of Technology (US)
  • Google (United States) (US)
  • Harvard Society of Fellows, Cambridge, MA 02138, USA.
  • University of California, Berkeley (US)
  • Microsoft (United States) (US)
  • Johannes Kepler University of Linz (AT)
Corresponding author
  • Huang, Hsin-Yuan
  • McClean, Jarrod R.
Venue
Science
Published
2022-06-10
Volume
376
Issue
6598
Pages
1182-1186
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W3216228299
Cited by
519
References
68
Citations by year
2026: 89 · 2025: 145 · 2024: 144 · 2023: 108 · 2022: 32
FWCI
35.15
Type
journal article
Language
en
Open access
Locations
  • Science (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by)
  • Zenodo (CERN European Organization for Nuclear Research) (submittedVersion, cc-by)
  • arXiv (Cornell University) (cc-by)
  • Zenodo (CERN European Organization for Nuclear Research) (cc-by)
Funders
U.S. Department of Energy (DESC0007870, DESC0020290)
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 machine learning, quantum principal component analysis, superconducting qubits, quantum computing, experimental data processing

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.