Quantum advantage in learning from experiments
Open accessThe 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.
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 cited source says what the claim attributes to it.
In the citing paper
“Two-copy measurements can also be used to simultaneously extract information about all 4N Pauli strings22.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [22]
The cited source says what the claim attributes to it.
In the citing paper
“A powerful method to extract various quantities of interest are Bell-basis measurements between two copies of the same state21,22,52.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [22]
The cited source says what the claim attributes to it.
In the citing paper
“By making use of the full outcome distribution, we can also evaluate the absolute value of all 4N Pauli strings, from a single dataset, in which N is the number of qubits involved in each copy of the state22.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [22]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physical-qubit fidelities at both cross-entropy benchmarking and quantum simulations of fast scrambling21,22.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [22]
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
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Exploiting Generative AI to Scale up Intelligent Tutoring Systems
Jakubův, J., Chvalovský, K., Goertzel, Z., Kaliszyk, C., Olšák, M., Piotrowski, B., Schulz, S., Suda, M., & Urban, J. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itp.2023.19 · Cited by 76,658
Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling
Chung, J., Gulcehre, C., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1412.3555 · Cited by 11,008 · cited 2×
“Our second method is more flexible and hence more broadly applicable; we make predictions by feeding the measurement data to a supervised ML model based on a recurrent neural network (25, 26, 27), as depicted in Fig.”
BackgroundMethod(2012) · Cited by 9,062
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Self-citationNonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A., & Müller, K.-R. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,084
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-citationBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Research works printed but not linked: 4
- M. Cerezo K. Sharma A. Arrasmith P. J. Coles Variational quantum state eigensolver. arXiv.2004.01372 [quant-ph] (2020). · arXiv
- I. Goodfellow Y. Bengio A. Courville Deep Learning (The MIT Press 2016).
- S. Chen J. Cotler H.-Y. Huang J. Li A hierarchy for replica quantum advantage. arXiv.2111.05874 [quant-ph] (2021). · arXiv
- R. S. Sutton A. G. Barto Reinforcement Learning: An introduction (The MIT press 2018).
Cited by
Items 501–516 of 516
Overcoming Challenges in Implementing Quantum AI
Mahata, A. (2026) · Springer eBooks · doi:10.1007/978-3-032-19536-4_13
Disambiguating Pauli Noise in Quantum Computers
Chen, E. H., Chen, S., Fischer, L. E., Eddins, A., Govia, L. C. G., Mitchell, B., He, A., Kim, Y., Jiang, L., & Seif, A. (2026) · PRX Quantum · doi:10.1103/69wc-gzl6 · Cited by 23
“While learning a quantum process by itself can be a candidate for quantum advantage [55], for example by utilizing entanglement to obtain a substantially lower sample complexity [56,57], it can also be used for more precise diagnosis of the most immediate hardware or material limitations to be…”
Self-citationEfficient Classification of Photonic Quantum States with Quantum Kernel Method
Ooka, S., Anai, K., Nakayama, A., Tomoda, H., Morohoshi, Y., Chin, Y., Miki, S., Yabuno, M., Terai, H., van Loock, P., et al. (2026) · doi:10.1364/cleo_fs.2026.fm3a.5
Quantum Neural Networks in the NISQ Era: Architectures, Challenges, and Applications
Palihakkara, K. W., & Jayakody, M. N. (2026) · Proceedings in Technology Transfer · doi:10.1007/978-981-92-0423-6_19
Eliminating vendor lock-in in quantum machine learning via framework-agnostic neural networks
Kumaresan, P., Singaravelu, S., Rajendran, L., & Sivasubramani, S. (2026) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2026.1862700
Hu, Z., Zhu, J., Zhou, M., Cao, J., & Pu, Q. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7192756
Towards Explainable Quantum Machine Learning: A Hybrid Quantum SHAP-based Framework
Ramu, M., Deepika, D., Baddula, N., Reshma, S., Reddy, R. V., & Deepika, P. (2026) · International Conference on Computing Methodologies and Communication (ICCMC) · doi:10.1109/iccmc69250.2026.11624890
“To address this challenge, this paper presents a hybrid explainable quantum machine learning framework that integrates a quantum-aware feature attribution method with hybrid quantum-classical models [8].”
Coupled integrated photonic quantum memristors using a single photon source made of a colour center
Baldazzi, A., Ancel, R. P. G. K., Guaraldo, S., Fattori, I., Chen, X., Akar, Z. A., Déturche, R., Azzini, S., Couteau, C., & Pavesi, L. (2026) · Opto-Electronic Advances · doi:10.29026/oea.2026.260048 · Cited by 2
ANQOR: Anchor-based Quantum Multi-class Image Classification
Islam, A. K. M. M., Huang, Y., Yan, Y., & Li, G. (2026) · IEEE Cloud Summit · doi:10.1109/cloudsummit68932.2026.00013
“Prior work in quantum machine learning has explored a range of supervised and reinforcement learning tasks using variational circuits [1], [13]–[15].”
Quantum Machine Learning: Foundational Principles to Practical Applications
Pati, A. K., Vayyala, R., Mohanty, K., & Das, U. (2026) · IEEE Access · doi:10.1109/access.2026.3720798
“…subroutines such as HHL [9]; (ii) richer feature representations through quantum kernel methods that may be classically hard to simulate [8]; and (iii) native processing of quantum data arising in chemistry, sensing, and many-body physics, completely avoiding the classical encoding bottleneck [14].”
Quantum Fusion Learning for 6G Networks With Kolmogorov–Arnold Networks
Paracha, U. I., Khalid, U., Rizvi, S. M. A., Duong, T. Q., Win, M. Z., & Shin, H. (2026) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2026.3725065
“From the kernel perspective, concentration effects and data access limitations constrain potential quantum advantages, while recent studies emphasize the importance of informative datasets and controlled experimental demonstrations [38], [52], [67].”
Farsi, M., Mahmoud, M., & Helmy, A. (2026) · Sensors · doi:10.3390/s26175629
“Quantum advantages depend critically on data structure and access [13]; an experimental demonstration of exponential advantage appears in Huang et al. [47].”
Optimal Shadow Estimation with Minimal Measurement Settings
Anonymous, Chen, D., & Zhu, H. (2026) · Physical Review Letters · doi:10.1103/g4lh-56r1 · Cited by 6
“Shadow estimation has since found broad applications in fidelity estimation [2–5], entanglement detection [6–11], and Hamiltonian learning [12–15], with experimental demonstrations on photonic [16, 17], super-conducting [18, 19], and trapped-ion [6, 20] platforms.”
Quantum statistical learning theory: concepts, regimes, and open problems
Çatak, F. Ö. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05356-1
Albuquerque, E. L. (2026) · Annual reports in medicinal chemistry · doi:10.1016/bs.armc.2026.09.004
Re-uploading quantum data: a universal function approximator for quantum inputs
Cha, H., Park, D. K., & Lee, J. (2026) · Quantum · doi:10.22331/q-2026-10-29-2256 · Cited by 2
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.
- ORCID
- 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
- green
- arxiv.org
- 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.