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 301–400 of 516
Time-warping invariant quantum recurrent neural networks via quantum-classical adaptive gating
Nikoloska, I., Simeone, O., Banchi, L., & Veličković, P. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/acff39 · Cited by 11
“Given the performance of the proposed model on prediction tasks, we expect it to be advantageous for tasks related to quantum phenomena, with extensions possibly operating directly on quantum data [39].”
BackgroundPitfalls when tackling the exponential concentration of parameterized quantum models
Saem, R. A., Tafreshi, B., Holmes, Z., & Thanasilp, S. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae2202 · Cited by 9
“Thus, changing the POVM and allowing access to multiple copies provides an advantage [100].”
Learning reduced representations for quantum classifiers
Odagiu, P., Belis, V., Schulze, L., Barkoutsos, P. K., Grossi, M., Reiter, F., Dissertori, G., Tavernelli, I., & Vallecorsa, S. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00331-y · Cited by 8
“…to biology, chemistry, and physics, remain inaccessible for Quantum Machine Learning (QML) algorithms, which surpass classical ML in a variety of specific tasks (Rebentrost et al. 2014, Liu et al. 2021, Muser et al. 2024, Huang et al. 2021, 2022, Pirnay et al. 2023, Gyurik and Dunjko 2023).”
QNet: A Quantum-Native Sequence Encoder Architecture
Day, W., Chen, H., & Sun, M.-T. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00035 · Cited by 4
Quantum Anomaly Detection with a Spin Processor in Diamond
Chai, Z., Liu, Y., Wang, M., Guo, Y., Shi, F., Li, Z., Wang, Y., & Du, J. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300385 · Cited by 5
“Among the learning tasks in data processing, many appear in the form of anomaly detection (AD), i.e., the identification of the outliers appearing inconsistent with others in the datasets.”
Enhancing quantum annealing in digital–analog quantum computing
Kadowaki, T. (2024) · APL Quantum · doi:10.1063/5.0179540 · Cited by 5
Ground state-based quantum feature maps
Umeano, C., & Kyriienko, O. (2026) · APL Quantum · doi:10.1063/5.0301000 · Cited by 16
Singh, B., Majumdar, S., & Indu, S. (2024) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-024-00330-x · Cited by 6
“Flexibility is very important in applications such as denoising, where the basic frequency and localization properties are controlled using several parameters [34].”
Optimal compression of constrained quantum time evolution
Tepaske, M. S. J., Luitz, D. J., & Hahn, D. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.205134 · Cited by 8
“Quantum computers are promising computational platforms which are expected to lead to breakthroughs for several difficult problems like integer factorization, optimization or machine learning algorithms by significant quantum speedups over their classical counter-parts [1–4].”
BackgroundAdaptive diversity-based quantum circuit architecture search
Huang, Y., Jin, S., Zeng, B., & Shao, Q. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033033 · Cited by 11
Local measurement strategies for multipartite entanglement quantification
Coffman, L., Seshadri, A., Smith, G., & Beckey, J. L. (2024) · Physical Review A · doi:10.1103/physreva.110.012454 · Cited by 8
Munasinghe, T., Cornell, K. A., Wei, J., Berg, G., & Hendler, J. (2024) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata62323.2024.10826005 · Cited by 3
A coherent approach to quantum-classical optimization
Cáliz, A. N., Riu, J., Bosch, J., Torrente, P., Miralles, J., & Riera, A. (2025) · Communications Physics · doi:10.1038/s42005-025-02111-3 · Cited by 9
Simulation of open quantum systems on universal quantum computers
Liu, H., Lin, X., Chen, Z., Xue, C., Sun, T., Li, Q.-S., Zhuang, X., Wang, Y.-J., Wu, Y.-C., Gong, M., et al. (2025) · Quantum · doi:10.22331/q-2025-06-05-1765 · Cited by 17
“To date, quantum processors with high-performance superconducting qubits [3], photons [4], or reconfigurable neutral atom arrays [5], have been realized for quantum advantages [6, 7, 8, 9].”
Unleashing the expressive power of pulse-based quantum neural networks
Tao, H.-X., Hu, J., & Wu, R.-B. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00332-x · Cited by 7
“Quantum computing has provable advantages over classical computing in the training, inference and sampling of machine learning processes [1–4].”
Distributed Quantum Neural Networks on Distributed Photonic Quantum Computing
Chen, K., Liu, C.-Y., Yu, S., Burt, F., & Leung, K. K. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00165 · Cited by 7
“…centralized quantum processing introduces critical bottlenecks: (i) high-dimensional data embedding necessitates deep circuits prone to decoherence [26], [27]; (ii) synchronous access to quantum hardware imposes latency incompatible with real-time applications [9]; and (iii) scaling to large…”
Quantum learning unravels quantum system
Dunjko, V. (2022) · Science · doi:10.1126/science.abp9885 · Cited by 3
Stable Many-Body Resonances in Open Quantum Systems
Peña, R., Kyaw, T. H., & Romero, G. (2022) · Symmetry · doi:10.3390/sym14122562 · Cited by 4
Quantum K-Means Model based on Optimization Framework
Shao, Z., Zhang, S., & Kumar, S. (2023) · Asia-Pacific Conference on Image Processing, Electronics and Computers (IPEC) · doi:10.1109/ipec57296.2023.00071 · Cited by 4
“…with the wide application of artificial intelligence and machine learning, it is a hot research field to achieve cross fusion of quantum and classical machine learning algorithms, such as Quantum Support Vector Machine (Quantum-SVM)[9] and Quantum Principal Component Analysis (Quantum-PCA)[10].”
MethodConstruction of ε-ASIC-POVMs via 2-to-1 PN functions and the Li bound
Cao, M., & Deng, X. (2024) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2024.102388 · Cited by 4
The Ethics of Life as It Could Be: Do We Have Moral Obligations to Artificial Life?
Witkowski, O., & Schwitzgebel, E. (2024) · Artificial Life · doi:10.1162/artl_a_00436 · Cited by 8
“Similarly, with quantum computers, some algorithms are asymptotically faster than the fastest possible classical algorithms, due to qubits being able to store multiple values at the same time, which gives them a computational advantage over classical algorithms (Huang et al., 2022).”
BackgroundSone, A., Tanji, A., & Yamamoto, N. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033198 · Cited by 4
“On the other hand, Huang et al. [50] study quantum and classical classifiers with a fixed quantum generator, and they demonstrate that the quantum classifier performs better if the quantum generator produces entanglement.”
BackgroundResultWaseem, H. M., Hafeez, M. A., Ahmed, S., Deebak, B. D., Munir, N., Majeed, A., & Hwang, S. O. (2024) · IEEE Access · doi:10.1109/access.2024.3477260 · Cited by 5
“Furthermore, the emergence of general-purpose quantum computers this decade, capable of efficiently tackling complex number theory problems like discrete logarithms and factorization, poses a significant threat to block cipher applications [29], [30], [31], [32], [33].”
BackgroundBenchmarking Quantum Computational Advantages on Supercomputers
Wu, J., & Liu, Y. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400143 · Cited by 5
Highly-entangled, highly-doped states that are efficiently cross-device verifiable
Denzler, J., Varona, S., Guaita, T., & Carrasco, J. (2025) · Physical Review Research · doi:10.1103/b6rb-yr6c · Cited by 6
“For our proposal to be implemented, each party needs to be able to approximately prepare a two-copy pure (and real) quantum state, a theoretical primitive that has been shown to be of interest in different contexts (see, e.g. [30] and references therein).”
Holographic classical shadow tomography
Zhang, S., Feng, X., Ippoliti, M., & You, Y. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.054306 · Cited by 9
The complexity of learning (pseudo)random dynamics of black holes and other chaotic systems
Yang, L., & Engelhardt, N. (2025) · Journal of High Energy Physics · doi:10.1007/jhep03(2025)153 · Cited by 25
Towards improved quantum machine learning for molecular force fields
Couzinié, Y., Daimon, S., Nishi, H., Ito, N., Harazono, Y., & Matsushita, Y. (2025) · Physical Review A · doi:10.1103/5s9m-h7yb · Cited by 5
“Early theoretical and experimental results suggest that, in specific scenarios such as QML on quantum data [28, 29], QML models may offer computational advantages, though the extent of QML’s computational advantages when applied on classical data is still a topic of debate [30–34].”
Song, W., Lim, Y., Jeong, K., Lee, J., Park, J. J., Kim, M. S., & Bang, J. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac94ef · Cited by 4
Berry Phase of Two Impurity Qubits as a Signature of Dicke Quantum Phase Transition
Lu, W., Zhai, C., Liu, Y., Song, Y., Yuan, J.-B., & Tang, S.-Q. (2022) · Photonics · doi:10.3390/photonics9110844 · Cited by 3
Almost Tight Sample Complexity Analysis of Quantum Identity Testing by Pauli Measurements
Yu, N. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3271206 · Cited by 3
“A related question is studied in [44], [45], and [47]: predicting the absolute value of just a single observable requires exponentially many copies in the conventional scenario where ρ = I ⊗n 2n or ρ = I⊗n±0.”
BackgroundMachine Learning for Anomaly Detection in Particle PhysicsPreprint
Belis, V., Odagiu, P., & Aarrestad, T. K. (2023) · arXiv (Cornell University) · doi:10.3929/ethz-b-000654879 · Cited by 3
Using Quantum Solved Deep Boltzmann Machines to Increase the Data Efficiency of RL Agents
Kent, D., O'Rourke, C., Southall, J., Duncan, K., & Bedford, A. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10298 · Cited by 4
“Early research indicates that Quantum Machine Learning (QML) offers a potential route to train ML models with less data than using classical ( i.e. non-quantum) computing [4]–[6].”
Ma, Q., Hao, C., Si, N., & Qu, D. (2024) · IEEE International Conference on Computer and Communications (ICCC) · doi:10.1109/iccc62609.2024.10941894 · Cited by 2
“At present, quantum machine learning (QML) is gaining increasing attention, and quantum machine learning has great potential compared with classical machine learning [1]–[3].”
Hardness of measuring magic resource
Garcia, R. J., Bhole, G., Bu, K., Chen, L., Arthanari, H., & Jaffe, A. (2025) · Physical Review Research · doi:10.1103/qcqv-3ym8 · Cited by 9
Nearly Query-Optimal Classical Shadow Estimation of Unitary Channels
Li, Z., Yi, C., Zhou, Y., & Zhu, H. (2025) · PRX Quantum · doi:10.1103/wccm-zys6 · Cited by 6
“Such properties play crucial roles in various research areas, including quantum machine learning [5, 29, 31, 32] and variational quantum algorithms [33– 35].”
InfluentialZheng, K., Fu, T., & Liang, Z. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00369-6 · Cited by 2
Parameter-efficient quantum anomaly detection method on a superconducting quantum processor
Wang, M., Jiang, J., & Coveney, P. V. (2025) · Physical Review Research · doi:10.1103/cv9y-2cnj · Cited by 9
“Finally, Section VII concludes the paper with a summary and discussion of future research directions.”
Two-stage behavior of mutual information in quantum neural networks
Zhang, X., Li, X., Dong, Z., & Hou, Y. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.131110 · Cited by 2
Chemically motivated simulation problems are efficiently solvable on a quantum computer
Schleich, P., Kristensen, L. B., Campos-Gonzalez-Angulo, J. A., Aldossary, A., Avagliano, D., Bagherimehrab, M., Gorgulla, C., Fitzsimons, J., & Aspuru‐Guzik, A. (2025) · Digital Discovery · doi:10.1039/d5dd00377f · Cited by 15
Quantum Advantage in Computational Chemistry?
Gundlach, H., Sharkey, K. L., Lynch, J., Hazoglou, V., Hsu, K.-C., Dukatz, C., Crane, E., Walczyk, K., Bodziak, M., Galatsanos-Dueck, J., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00249 · Cited by 7
“In these cases, quantum computers have a theoretical asymptotic exponential advantage in learning from quantum experiments over classical neural networks [57].”
Superior resilience to poisoning and amenability to unlearning in quantum machine learning
Chen, Y., & Zhang, S. (2026) · Nature Communications · doi:10.1038/s41467-026-70420-4 · Cited by 11
Supervised Quantum Machine Learning: A Future Outlook from Qubits to Enterprise Applications
Thudumu, S., Fisher, J., & Du, H. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00075 · Cited by 8
“Existing results are primarily confined to synthetic benchmarks or small-scale datasets, and a reproducible advantage over classical methods on real-world tasks has yet to be empirically demonstrated [6], [8].”
InfluentialImproving Quantum Machine Learning via Heat-Bath Algorithmic Cooling
Rodríguez-Briones, N. A., & Park, D. K. (2026) · PRX Quantum · doi:10.1103/24n3-tskj · Cited by 4
Design of expressive and trainable pulse-based quantum machine learning models
Tao, H.-X., Wang, X., & Wu, R.-B. (2026) · Physical Review Research · doi:10.1103/gvj4-kqwd · Cited by 4
Hoyos, D. I., Connors, P. F., Jang, H., Grain, N., Klich, I., Chern, G.-W., Liaw, P. K., Scully, J. R., & Poon, S. J. (2026) · npj Computational Materials · doi:10.1038/s41524-026-02032-x · Cited by 4
CQNAS: Convolutional quantum hybrid neural network architecture search for image classification
Kong, D., Jin, J., Cui, X., Yan, J., Tang, J., Fu, Y., Xu, J., & Wang, D. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.133236 · Cited by 2
Qi, H., Xu, Y., Wang, H., Gani, A., & Por, L. Y. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05186-1 · Cited by 2
Exploring the Power of Entangled Data in Quantum Machine Learning
Wang, X., Yuxuan, D. U., Tu, Z., Yong, L., Yuan, X., & Tao, D. (2024) · Wuhan University Journal of Natural Sciences · doi:10.1051/wujns/2024293193 · Cited by 2
Sudden death of quantum advantage in correlation generations
Sun, W., Wei, F., Shao, Y., & Wei, Z. (2024) · Science Advances · doi:10.1126/sciadv.adr5002 · Cited by 8
“…computational models, such as query complexity ( 10 , 11 ), communication complexity ( 12 , 13 ), and certain machine learning models ( 14 , 15 ), researchers have mathematically demonstrated quantum advantage, often by providing rough upper bounds on the power of quantum computing while…”
Protocols for i SWAP gates using a fixed coupler driven by two microwave pulses
Xu, P., Zhang, H., & Wu, S. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.034036 · Cited by 6
Monte Carlo Simulation of Operator Dynamics and Entanglement in Dual-Unitary Circuits
Song, M., Zeng, Z., Wang, T.-T., You, Y., Meng, Z. Y., & Zhang, P. (2025) · Quantum · doi:10.22331/q-2025-04-01-1681 · Cited by 3
Computable Model-Independent Bounds for Adversarial Quantum Machine Learning
Li, B., Alpcan, T., Thapa, C., & Parampalli, U. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3569922 · Cited by 8
“However, there is significant potential for growth in QML [9], [46], and research in adversarial QML is laying the necessary groundwork for future practical applications.”
Measure-theoretic approach to negative probabilities
Monchietti, E., Massri, C., de Barros, J. A., & Holik, F. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/adf478 · Cited by 6
Tuziemski, J., Maciejewski, F. B., Majsak, J., Słowik, O., Kotowski, M., Kowalczyk-Murynka, K., Podziemski, P., & Oszmaniec, M. (2025) · Open Systems & Information Dynamics · doi:10.1142/s1230161225500192 · Cited by 10
Auxiliary-Free Replica Shadows: Efficient Estimation of Multiple Nonlinear Quantum Properties
Liu, Q. Y., Li, Z., Yuan, X., Zhu, H., & Zhou, Y. (2026) · Physical Review Letters · doi:10.1103/5khs-7dyz · Cited by 24
“Second, one needs long-range CNOTs which are realizable in systems like ion-trap [88] and optical-tweezer platforms [89], but would be challenging for the ones with the nearest-neighbour architecture, like superconducting-qubit system [24, 90].”
Frontiers in computing for artificial intelligence
Humble, T. S., Perdue, G., Fahim, F., Lamm, H., & Schram, M. (2022) · Journal of Instrumentation · doi:10.1088/1748-0221/17/03/c03037 · Cited by 2
“[25] broadly treat the role played by the structure of the data when considering the problem of quantum advantage in machine learning, with specific scenarios constructed to demonstrate these advantage on a current quantum computer have been reported [26].”
BackgroundNoise tailoring for robust amplitude estimation
Dalal, A., & Katabarwa, A. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acb5bc · Cited by 7
Towards real-world implementations of quantum machine learning
Liu, J. (2023) · doi:10.22331/qv-2023-11-29-77 · Cited by 2
Learning quantum finite automata with queries
Qiu, D. (2023) · Mathematical Structures in Computer Science · doi:10.1017/s0960129523000373 · Cited by 2
Quantum approximated cloning-assisted density matrix exponentiation
Rodriguez-Grasa, P., Ibarrondo, R., Gonzalez-Conde, J., Ban, Y., Rebentrost, P., & Sanz, M. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013264 · Cited by 6
“…quantum algorithms that require density matrix exponentiation or are based on the availability of multiples copies of a quantum state as the non-linear transformations of density matrices [20, 49], the Virtual Distillation for Quantum Error Mitigation [50] or when learning from experiments [51].”
Towards provably efficient quantum algorithms for large-scale machine-learning modelsPreprint
Liu, J., Liu, M., Liu, J.-P., Ye, Z., Wang, Y., Alexeev, Y., Eisert, J., & Jiang, L. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2303.03428 · Cited by 2
“• Full-scale quantum machine learning algorithms have at the same time been established in the fault-tolerant setting, including steps of principle component analysis [23] (which has been largely de-quantized in the meantime [24]), quantum kernel methods [25, 26], or notions of quantum machine learning of quantum phys…”
BackgroundMethodInsights into Quantum Support Vector MachinePreprint
Jammalamadaka, S., & Cherukuri, A. K. (2024) · Research Square · doi:10.21203/rs.3.rs-4465421/v1 · Cited by 2
Digital Payments in Firm Networks: Theory of Adoption and Quantum AlgorithmPreprint
Priazhkina, S., Palmer, S. J., Martín-Ramiro, P., Orús, R., Mugel, S., & Skavysh, V. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5393545 · Cited by 2
Introducing Quantum Variational Circuit for Efficient Management of Common Pool Resources
Shahid, M., & Awais, M. (2023) · IEEE Access · doi:10.1109/access.2023.3322144 · Cited by 1
“Nonetheless, as the frontiers of scientific exploration continue to expand, attention has shifted towards harnessing the power of quantum computing [15] to potentially unlock new dimensions of problem-solving [16], [17], [18].”
BackgroundQuantum fidelity kernel with a trapped-ion simulation platform
Martínez‐Peña, R., Soriano, M. C., & Zambrini, R. (2024) · Physical Review A · doi:10.1103/physreva.109.042612 · Cited by 2
“In particular, quantum machine learning (QML) is a promising route toward quantum advantage, where some theoretical studies [3–6] and experimental evidence [7– 9] have already indicated positive progress in this direction.”
BackgroundGate-based quantum neurons in hybrid neural networks
Lu, C., Hu, M., Miao, F., & Hou, J. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad6f3d · Cited by 1
Experimental measurement and a physical interpretation of quantum shadow enumerators
Miller, D., Levi, K., Postler, L., Steiner, A., Bittel, L., White, G. A. L., Tang, Y., Kuehnke, E. J., Mele, A. A., Khatri, S., et al. (2026) · Physical Review Research · doi:10.1103/8h3b-brg1 · Cited by 22
“Most prominently, two-copy Bell sampling enables efficient learnability of purities and squared Pauli expectation values [11] with wide-ranging applications in quantum machine learning [30, 34] and topological data analysis [35].”
On the Role of Controllability in Pulse-based Quantum Machine Learning Models
Tao, H.-X., & Wu, R.-B. (2024) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc56724.2024.10886070 · Cited by 4
“Machine learning powered by fault-tolerant quantum computers can substantially improve the training or inference performance [3], [2], [1], [4].”
Boosting RBFNN performance in regression tasks with quantum kernel methods
Zhou, X., Geng, Q., & Jiang, T. (2025) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/add0a3 · Cited by 1
No-go theorem for environment-assisted invariance in non-unitary dynamics
Sone, A., Touil, A., Maeda, K., Cappellaro, P., & Deffner, S. (2025) · New Journal of Physics · doi:10.1088/1367-2630/ade46f · Cited by 4
“…glement underlying our quantum universe, with potential applications including, e.g., quantum metrology [23–25], quantum communication [26–31], quantum generative models [32–34], quantum error correction (QEC) [35–40], classical spacetime emergence via AdS/CFT correspondence [41–57], and many more.”
Identifying Quantum Computing Applications in the Study and Operation of Manufacturing Systems
Schiffmann, O., Gopsill, J., Ridley, M., & Valero, M. (2025) · Procedia CIRP · doi:10.1016/j.procir.2025.02.161 · Cited by 1
Forward Discrete‐Time Quantum Walk for Efficiently Identifying Critical Nodes of Complex Networks
Wang, Z., Gao, F., Xu, Y., Wang, X.-H., & Fang, J. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500234 · Cited by 1
Quantum AIXI: Universal Intelligence via Quantum Information
Perrier, E. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-00800-8_6 · Cited by 4
pLazyQML: a parallel package for efficient execution of QML models on classical computers
García-Vega, D., Plou, F., Castaño, A. L., Combarro, E. F., & Ranilla, J. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07714-9 · Cited by 3
Guided graph compression for quantum graph neural networks
Casals, M., Belis, V., Combarro, E. F., Alarcón, E., Vallecorsa, S., & Grossi, M. (2025) · Machine Learning Science and Technology · doi:10.1088/2632-2153/adffe2 · Cited by 7
Multi‐Channel Convolutional Neural Quantum Embedding
Kim, Y., Im, C., Kim, T., Hur, T., & Park, D. K. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500575 · Cited by 6
“Quantum machine learning (QML) is a promising approach to data processing and analysis beyond the capabilities of its classical counterparts [1–4].”
Perron, C., Bérubé-Lauzière, Y., & Drouin-Touchette, V. (2026) · Physical Review A · doi:10.1103/9bsf-gb5v · Cited by 4
Bell Sampling in Quantum Monte Carlo Simulations
Tarabunga, P. S., & Ding, Y.-M. (2025) · Physical Review Letters · doi:10.1103/fq8z-y55j · Cited by 7
Applications of Quantum Computation in Artificial Neural Network: Opportunities and Challenges
Dey, P. (2025) · Springer eBooks · doi:10.1007/978-981-95-3272-8_14 · Cited by 1
HiQC: hybrid quantum classical deep learning with parameter efficient quantum modules
Xu, L., Zhao, T., & Li, H. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00321-0 · Cited by 1
“Artificial intelligence (AI) has made remarkable progress in computer vision and data analysis applications; however, the growing complexity of AI models poses challenges for the exploration of new computing paradigms (Huang et al. 2022; Zha et al. 2025).”
Work and heat exchanged during sudden quenches of strongly coupled quantum systems
Davoudi, Z., Jarzynski, C., Mueller, N., Oruganti, G., Powers, C., & Halpern, N. Y. (2026) · Physical review. E · doi:10.1103/66j9-cwvx · Cited by 10
Quantum Advantage via Efficient Postprocessing on Qudit Classical Shadow Tomography
Wang, Y. (2025) · Physical Review Letters · doi:10.1103/92ky-ln8f · Cited by 1
Quantum Advantage in Storage and Retrieval of Isometry Channels
Yoshida, S., Miyazaki, J., & Murao, M. (2026) · Physical Review Letters · doi:10.1103/fdvq-9m8m · Cited by 18
“The investigation of SAR of unitary channels in the classical and quantum strategy provides insights into the advantage of quantum memory in learning tasks [45–47].”
Quantifying the effects of noise in a quantum convolutional neural network
Fan, Z., Lau, J. W. Z., & Kwek, L. C. (2025) · SciPost Physics Core · doi:10.21468/scipostphyscore.8.4.093 · Cited by 1
“Moreover, many examples of such algorithms have been successfully implemented on quantum computers using quantum input data [13].”
Quantum advantage for learning shallow neural networks with natural data distributions
Lewis, L., Gilboa, D., & McClean, J. R. (2025) · Nature Communications · doi:10.1038/s41467-025-68097-2 · Cited by 13
“Given that our universe is inherently quantum, it is natural to consider leveraging powerful quantum computers for ML tasks, in hopes of new scienti fi c advancements 24,27 – 41 .”
Self-citationSymmetry-constrained QCNN for few-shot learning with polylogarithmic generalization bounds
Guo, Z., Huang, C., Ding, W., & Ma, H. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05071-x · Cited by 1
“Toaddressthesecorelimitations,geometricquantummachinelearning (GQML)importssymmetryprinciplesfromclassicalgeometricdeeplearningand differentialgeometry[13–17].”
Entanglement and classical simulability in quantum extreme-learning machines
Lorenzis, A. D., Casado, M. P., Gullo, N. L., Lux, T., Plastina, F., & Riera, A. (2026) · Physical Review Applied · doi:10.1103/891x-ltcy · Cited by 10
Co-designed counterdiabatic quantum optimization on a photonic quantum processor
Shang, X.-W., Chen, X., Hegade, N. N., Lan, Z.-F., Tang, H., Dou, J.-P., Li, X.-K., Peng, Y.-Q., Solano, E., & Jin, X. (2026) · Physical Review Applied · doi:10.1103/7gl4-zrh6 · Cited by 5
Vast World of Quantum Advantage
Huang, H.-Y., Choi, S., McClean, J. R., & Preskill, J. P. (2026) · Physical Review X · doi:10.1103/tn89-g1xz · Cited by 77
“The answer is proven to be affirmative when quantum learning agents are applied to study many-body physical systems and dynamics [58 – 60, 63 , Rather than relying on unproven complexity assumptions, quantum advantages in the learning and sensing realm often emerge from the quantum nature of…”
InfluentialSelf-citationSoK: Critical Evaluation of Quantum Machine Learning for Adversarial Robustness
Nowmi, S. R., Lopez, J., Imon, M. M. A., Pouryousef, S., & Rahman, M. S. (2026) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp63933.2026.00137 · Cited by 8
Endohedral fullerenes as qubits: From synthesis to quantum computing applications
Nam, J., Han, J., Choi, J., Cho, F. H., Park, D. K., Park, S.-J., Hashikawa, Y., Murata, Y., Kwon, E., Kim, D., et al. (2026) · InfoMat · doi:10.1002/inf2.70158 · Cited by 1
Resgru: Syndrome decoder for heavy-hexagon quantum error correction code
Kumar, A., Haghparast, M., & Kettunen, L. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae87e2 · Cited by 1
“Beyond simulation, quantum algorithms have also shown potential speedups for certain optimization subroutines, and cryptographically relevant problems, sustaining a broad research effort toward scalable quantum information processing [22, 24, 26, 30].”
Hybrid Classical-Quantum Architecture for Vectorised Image Classification of Hand-Written Sketches
Cordero, Y., Biswas, S., Vilariño, F., & Bilkis, M. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-31673-8_24 · Cited by 1
Hardware-Aware Quantum Kernel Design Based on Graph Neural Networks
Meng, F., Liu, Y., Wang, L., Li, S., Han, Z., & Liu, L. (2026) · Entropy · doi:10.3390/e28080855 · Cited by 10
“…learning (QML), as a important class of quantum algorithms tailored for the Noisy Intermediate-Scale Quantum (NISQ) era [3], has demonstrated practical applicability in diverse real-world tasks, including classification [4–8], generative modeling [9–12], and learning physical systems [13, 14].”
Training Quantum Boltzmann Machines with Coresets
Viszlai, J., Tomesh, T., Gokhale, P., Anschuetz, E. R., & Chong, F. T. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00049 · Cited by 1
“There are many different types of quantum neural networks, and while the exact nature of the quantum speedup (if it exists) for some QML algorithms is unknown, recent work suggests that applications targeting quantum data are a promising direction [9, 10].”
BackgroundFrequency Analysis Attack on Ceaser Cipher using Quantum Support Vector Machine
Ajith, V., Mathews, M. M., & Panchami, V. (2022) · IEEE International Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI) · doi:10.1109/iatmsi56455.2022.10119286 · Cited by 1
“Quantum algorithms have been proposed for a number of problems like simulation [1], cryptanalysis and machine learning [2] that are proven to perform better than their classical counterparts.”
BackgroundSingh, B., Indu, S., & Majumdar, S. (2023) · International Conference on Artificial Intelligence and Signal Processing (AISP) · doi:10.1109/aisp57993.2023.10134825 · Cited by 5
Quantum-enhanced learning with a controllable bosonic variational sensor network
Liao, P., Zhang, B., & Zhuang, Q. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad752d · Cited by 9
“Unlike various proposals for quantum machine learning algorithms aimed at solving classical problems, the SLAEN approach [14] addresses quantum data classification within physical processes, a domain that has recently garnered significant attention in the quantum machine learning community [ 25–28].”
Sample complexity of purity and inner product estimation
Gong, W., Haferkamp, J., Ye, Q., & Zhang, Z. (2026) · Physical Review Research · doi:10.1103/kh2j-jkn6 · Cited by 41
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.