The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
Power of data in quantum machine learning
Open accessAbstract
The use of quantum computing for machine learning is among the most exciting prospective applications of quantum technologies. However, machine learning tasks where data is provided can be considerably different than commonly studied computational tasks. In this work, we show that some problems that are classically hard to compute can be easily predicted by classical machines learning from data. Using rigorous prediction error bounds as a foundation, we develop a methodology for assessing potential quantum advantage in learning tasks. The bounds are tight asymptotically and empirically predictive for a wide range of learning models. These constructions explain numerical results showing that with the help of data, classical machine learning models can be competitive with quantum models even if they are tailored to quantum problems. We then propose a projected quantum model that provides a simple and rigorous quantum speed-up for a learning problem in the fault-tolerant regime. For near-term implementations, we demonstrate a significant prediction advantage over some classical models on engineered data sets designed to demonstrate a maximal quantum advantage in one of the largest numerical tests for gate-based quantum machine learning to date, up to 30 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
Figures




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 source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“measures such as the effective dimension have been motivated from an information-theoretic standpoint and depend on the Fisher information”
From The power of quantum neural networks (2021) · cites this paper as [21]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“For instance, in [57], it is shown how the quality and the amount of data can sensibly affect the performance of classical and QML models in such a way that the quantum advantage is not always guaranteed.”
From On Circuit-Based Hybrid Quantum Neural Networks for Remote Sensing Imagery Classification (2022) · cites this paper as [57]
The cited source says what the claim attributes to it.
In the citing paper
“However, there is not a shared consensus on how and when QML can be advantageous with respect to its classical counterpart on general classes of problems.”
From On Circuit-Based Hybrid Quantum Neural Networks for Remote Sensing Imagery Classification (2022) · cites this paper as [57]
In the citing paper
“a quantity that describes the geometry of a model's parameter space and is essential in both statistics and machine learning [20-22].”
From The power of quantum neural networks (2021) · cites this paper as [21]
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Hohenberg, P., & Kohn, W. (1964) · Physical Review · doi:10.1103/physrev.136.b864 · Cited by 53,541
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Libsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
Least Squares Support Vector Machine Classifiers
Suykens, J. A. K., & Vandewalle, J. (1999) · Neural Processing Letters · doi:10.1023/a:1018628609742 · Cited by 9,362
Density-Functional Theory for Time-Dependent Systems
Runge, E., & Gross, E. K. U. (1984) · Physical Review Letters · doi:10.1103/physrevlett.52.997 · Cited by 8,914
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Re-epithelialization and immune cell behaviour in an ex vivo human skin model
Rakita, A., Nikolić, N., Mildner, M., Matiasek, J., & Elbe-Bürger, A. (2020) · Scientific Reports · doi:10.1038/s41598-019-56847-4 · Cited by 8,228
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Self-citation
Cited by
The power of quantum neural networks
Abbas, A., Sutter, D., Zoufal, C., Lucchi, A., Figalli, A., & Woerner, S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00084-1 · Cited by 1,082
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
AI for next generation computing: Emerging trends and future directions
Gill, S. S., Xu, M., Ottaviani, C., Patros, P., Bahsoon, R., Shaghaghi, A., Golec, M., Stankovski, V., Wu, H., Abraham, A., et al. (2022) · Internet of Things · doi:10.1016/j.iot.2022.100514 · Cited by 686
“With quantum computers accelerating machine learning, the potential for impact s certain to be enormous [173].”
Challenges and opportunities in quantum machine learning
Cerezo, M., Verdon, G., Huang, H.-Y., Cincio, L., & Coles, P. J. (2022) · Nature Computational Science · doi:10.1038/s43588-022-00311-3 · Cited by 689
“However, one should be cautious about the availability of data in ML tasks, which makes classical ML algorithms computationally more powerful [13, 119].”
BackgroundMethodInfluentialSelf-citationPractical quantum advantage in quantum simulation
Daley, A. J., Bloch, I., Kokail, C., Flannigan, S., Pearson, N., Troyer, M., & Zoller, P. (2022) · Nature · doi:10.1038/s41586-022-04940-6 · Cited by 669
“…simulating these models by using the large-scale entangling operations implied by many-body dynamics as a variational circuit that can form the basis for methods such as variational quantum eigensolver 105 , quantum approximate optimization 106 and quantum machine learning 53,69,71–73, 107 , 108 on”
Method
Metadata
- Authors
- Huang, H.-Y., Broughton, M., Mohseni, M., Babbush, R., Boixo, S., Neven, H., & McClean, J. R.
- Affiliations
- California Institute of Technology (US)
- Google (United States) (US)
- Corresponding author
- McClean, Jarrod R.
- Venue
- Nature Communications
- Published
- 2021-05-11
- Volume
- 12
- Issue
- 1
- Pages
- 2631-2631
- ISSN
- 2041-1723 (ISSN-L)
- PMC
- PMC8113501
- OpenAlex
- W3096052452
- Cited by
- 896
- References
- 67
- Citations by year
- 2026: 220 · 2025: 220 · 2024: 157 · 2023: 140 · 2022: 107 · 2021: 52
- FWCI
- 39.93
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Nature Communications (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by)
- RePEc: Research Papers in Economics (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Bulletin of the American Physical Society
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum machine learning, quantum advantage, prediction error bounds, classical machine learning, fault-tolerant quantum computing, gate-based quantum computing, quantum-classical comparison
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: Power of data in quantum machine learning. https://app.cochat.ai/papers/10.1038/s41467-021-22539-9
- The paper
- Huang, H.-Y., Broughton, M., Mohseni, M., Babbush, R., Boixo, S., Neven, H., & McClean, J. R. (2021). Power of data in quantum machine learning. Nature Communications. https://doi.org/10.1038/s41467-021-22539-9
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.