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
Degen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045
Giovannetti, V., Lloyd, S., & Maccone, L. (2011) · Nature Photonics · doi:10.1038/nphoton.2011.35 · Cited by 3,894
Siamese Neural Networks for One-shot Image Recognition
Koch, G. E., Zemel, R. S., & Salakhutdinov, R. (2015) · Cited by 3,740
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
API design for machine learning software: experiences from the scikit-learn project
Buitinck, L., Louppe, G., Blondel, M., Pedregosa, F., Mueller, A., Grisel, O., Niculae, V., Prettenhofer, P., Gramfort, A., Grobler, J., et al. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.0238 · Cited by 1,871
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Self-citationDocument Modeling with Gated Recurrent Neural Network for Sentiment Classification
Tang, D., Qin, B., & Liu, T. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1167 · Cited by 1,519
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Self-citationLvovsky, A. I., Sanders, B. C., & Tittel, W. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.231 · Cited by 1,480
Quantum principal component analysis
Lloyd, S., Mohseni, M., & Rebentrost, P. (2014) · Nature Physics · doi:10.1038/nphys3029 · Cited by 1,385
Self-citationHigh-Dimensional Probability: An Introduction with Applications in Data Science
Vershynin, R. (2018) · Cambridge University Press eBooks · doi:10.1017/9781108231596 · Cited by 1,382
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
Predicting many properties of a quantum system from very few measurements
Huang, H.-Y., Kueng, R., & Preskill, J. (2020) · Nature Physics · doi:10.1038/s41567-020-0932-7 · Cited by 1,240
Self-citationQuantum nonlocality without entanglement
Bennett, C. H., DiVincenzo, D. P., Fuchs, C. A., Mor, T., Rains, E., Shor, P. W., Smolin, J. A., & Wootters, W. K. (1999) · Physical Review A · doi:10.1103/physreva.59.1070 · Cited by 1,130
Foundations of Machine Learning
Singh, A. (2019) · SSRN Electronic Journal · doi:10.2139/ssrn.3399990 · Cited by 1,123 · cited 1×
“These experiments demonstrated that supervised and unsupervised ML models (27, 32) employing data obtained from quantumenhanced experiments could predict properties and discover underlying structure in physical systems that are beyond the scope of conventional experiments.”
Foundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
High-Dimensional Probability: An Introduction with Applications in Data Science
Vershynin, R. (2018) · Cited by 1,031
Generalization in quantum machine learning from few training data
Caro, M. C., Huang, H.-Y., Cerezo, M., Sharma, K., Sornborger, A., Cincio, L., & Coles, P. J. (2022) · Nature Communications · doi:10.1038/s41467-022-32550-3 · Cited by 476
Self-citationLonger-Baseline Telescopes Using Quantum Repeaters
Gottesman, D., Jennewein, T., & Croke, S. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.070503 · Cited by 442
Quantum-process tomography: Resource analysis of different strategies
Mohseni, M., Rezakhani, A. T., & Lidar, D. A. (2008) · Physical Review A · doi:10.1103/physreva.77.032322 · Cited by 416
Self-citationOptimal detection of quantum information
Peres, A., & Wootters, W. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.66.1119 · Cited by 355
Ji, Z., Liu, Y.-K., & Song, F. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_5 · Cited by 333
Shadow Tomography of Quantum States
Aaronson, S. (2020) · SIAM Journal on Computing · doi:10.1137/18m120275x · Cited by 315
Yu, B. (1997) · Festschrift for Lucien Le Cam · doi:10.1007/978-1-4612-1880-7_29 · Cited by 309
TensorFlow Quantum: A Software Framework for Quantum Machine Learning
Broughton, M., Verdon, G., McCourt, T., Martinez, A. J., Yoo, J. H., Isakov, S. V., Massey, P., Halavati, R., Niu, M. Y., Zlokapa, A., et al. (2020) · arXiv · doi:10.48550/arxiv.2003.02989 · Cited by 308
Self-citationPerspectives on quantum transduction
Lauk, N., Sinclair, N., Barzanjeh, S., Covey, J. P., Saffman, M., Spiropulu, M., & Simon, C. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab788a · Cited by 305
Information-Theoretic Bounds on Quantum Advantage in Machine Learning
Huang, H.-Y., Kueng, R., & Preskill, J. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.190505 · Cited by 250
Self-citationSample-optimal tomography of quantum states
Haah, J., Harrow, A. W., Ji, Z., Wu, X., & Yu, N. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897585 · Cited by 238
Exponential Separations Between Learning With and Without Quantum Memory
Chen, S., Cotler, J. S., Huang, H.-Y., & Li, J. Z. (2022) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs52979.2021.00063 · Cited by 238
Self-citationProvably efficient machine learning for quantum many-body problems
Huang, H.-Y., Kueng, R., Torlai, G., Albert, V. V., & Preskill, J. (2022) · Science · doi:10.1126/science.abk3333 · Cited by 228
Self-citationVirtual Distillation for Quantum Error Mitigation
Huggins, W. J., McArdle, S., O’Brien, T. E., Lee, J., Rubin, N. C., Boixo, S., Whaley, K. B., Babbush, R., & McClean, J. R. (2021) · Physical Review X · doi:10.1103/physrevx.11.041036 · Cited by 205
Self-citationQuantum algorithmic measurement
Aharonov, D., Cotler, J. S., & Qi, X.-L. (2022) · Nature Communications · doi:10.1038/s41467-021-27922-0 · Cited by 202 · cited 3×
“The second taskwe studied, which pertains to Theorem 3, was inspired by the recent observation that quantum-enhanced experiments can efficiently identify the symmetry class of a quantum evolution operator, whereas conventional experiments cannot (9, 13).”
BackgroundInfluentialSelf-citationVariational quantum state diagonalization
LaRose, R., Tikku, A., O’Neel-Judy, É., Cincio, L., & Coles, P. J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0167-6 · Cited by 199
Gentle measurement of quantum states and differential privacy
Aaronson, S., & Rothblum, G. N. (2019) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3313276.3316378 · Cited by 184
Sample-optimal tomography of quantum states
Haah, J., Harrow, A. W., Ji, Z., Wu, X., & Yu, N. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2719044 · Cited by 171
Chia, N.-H., Gilyén, A., Li, T., Lin, H.-H., Tang, E., & Wang, C. (2020) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3357713.3384314 · Cited by 170
Optimal quantum learning of a unitary transformation
Bisio, A., Chiribella, G., D’Ariano, G. M., Facchini, S., & Perinotti, P. (2010) · Physical Review A · doi:10.1103/physreva.81.032324 · Cited by 148
Exponential Error Suppression for Near-Term Quantum Devices
Koczor, B. (2021) · Physical Review X · doi:10.1103/physrevx.11.031057 · Cited by 147
Tang, E. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.060503 · Cited by 140
Quantum advantages for Pauli channel estimation
Chen, S., Zhou, S., Seif, A., & Jiang, L. (2022) · Physical Review A · doi:10.1103/physreva.105.032435 · Cited by 121
Self-citationChia, N.-H., Gilyén, A., Li, T., Lin, H.-H., Tang, E., & Wang, C. (2022) · Journal of the ACM · doi:10.1145/3549524 · Cited by 93
The dominant eigenvector of a noisy quantum state
Koczor, B. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac37ae · Cited by 74
Direct characterization of quantum dynamics: General theory
Mohseni, M., & Lidar, D. A. (2007) · Physical Review A · doi:10.1103/physreva.75.062331 · Cited by 65
Self-citationRevisiting dequantization and quantum advantage in learning tasksPreprint
Cotler, J. S., Huang, H.-Y., & McClean, J. R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.00811 · Cited by 65 · cited 1×
“See (23), which provides a detailed exposition of these matters.”
BackgroundSelf-citationCotler, J. S., Choi, S., Lukin, A., Gharibyan, H., Grover, T., Tai, M. E., Rispoli, M., Schittko, R., Preiss, P. M., Kaufman, A. M., et al. (2019) · Physical Review X · doi:10.1103/physrevx.9.031013 · Cited by 62
Self-citationExponential separations between learning with and without quantum memoryPreprint
Chen, S., Cotler, J. S., Huang, H.-Y., & Li, J. Z. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.05881 · Cited by 51
Self-citationDistributed Quantum inner product estimation
Anshu, A., Landau, Z. A., & Liu, Y. (2022) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3519935.3519974 · Cited by 50
Entanglement is Necessary for Optimal Quantum Property Testing
Bubeck, S., Chen, S., & Li, J. Z. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00070 · Cited by 38
Self-citation(Pseudo) Random Quantum States with Binary Phase
Brakerski, Z., & Shmueli, O. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-36030-6_10 · Cited by 37
Quantum memories and the double-slit experiment: implications for astronomical interferometry
Bland‐Hawthorn, J., Sellars, M. J., & Bartholomew, J. G. (2021) · Journal of the Optical Society of America B · doi:10.1364/josab.424651 · Cited by 35
Computations with greater Quantum depth are strictly more powerful (relative to an oracle)
Coudron, M., & Menda, S. (2020) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3357713.3384269 · Cited by 29
On the need for large Quantum depth
Chia, N.-H., Chung, K.-M., & Lai, C. (2020) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3357713.3384291 · Cited by 29
Improved quantum data analysis
Bădescu, C., & O’Donnell, R. (2024) · TheoretiCS · doi:10.46298/theoretics.24.7 · Cited by 27
Scalable Pseudorandom Quantum States
Brakerski, Z., & Shmueli, O. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_15 · Cited by 24
Quantum State Discrimination Using the Minimum Average Number of Copies
Slussarenko, S., Weston, M. M., Li, J., Campbell, N., Wiseman, H. M., & Pryde, G. J. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.030502 · Cited by 22
Self-citationA Hierarchy for Replica Quantum AdvantagePreprint
Chen, S., Cotler, J. S., Huang, H.-Y., & Li, J. Z. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.05874 · Cited by 5
Self-citationExperimental multi-state quantum discrimination through optical networks
Laneve, A., Geraldi, A., Hamiti, F., Mataloni, P., & Caruso, F. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac5a0f · Cited by 5
Online identification of symmetric pure states
Sentís, G., Martínez-Vargas, E., & Muñoz-Tapia, R. (2022) · Quantum · doi:10.22331/q-2022-02-21-658
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
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
“By making use of the full outcome distribution, we can also evaluate the absolute value of all 4 N Pauli strings, from a single dataset, in which N is the number of qubits involved in each copy of the state 22 .”
BackgroundMethodInfluentialChallenges 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
“It was recently shown [64, 66, 115, 116] that there is an exponential quantum advantage in sample complexity when we can use a quantum sensor, quantum memory, and quantum computer to retrieve, store, and process quantum information from experiments.”
BackgroundMethodInfluentialSelf-citationIntelligent Computing: The Latest Advances, Challenges, and Future
Zhu, S., Yu, T., Xu, T., Chen, H., Dustdar, S., Gigan, S., Gunduz, D., Hossain, E., Jin, Y., Lin, F., et al. (2023) · Intelligent Computing · doi:10.34133/icomputing.0006 · Cited by 290
Quantum Computing for High-Energy Physics: State of the Art and Challenges
Di Meglio, A., Jansen, K., Tavernelli, I., Alexandrou, C., Arunachalam, S., Bauer, C. W., Borras, K., Carrazza, S., Crippa, A., Croft, V., et al. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.037001 · Cited by 215
Exponential concentration in quantum kernel methods
Thanasilp, S., Wang, S., Cerezo, M., & Holmes, Z. (2024) · Nature Communications · doi:10.1038/s41467-024-49287-w · Cited by 189
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.