A quantum machine learning algorithm based on generative models
Open accessThe DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
We propose a quantum learning algorithm for a quantum generative model and prove its advantages compared with classical models.
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.
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 2×
“2 (C and D), the correlator between x1 and x2 in the QGM is then given by d1ðx1Þd2ðx2Þ l1dx1x2 þ l2 1 dx1x2 ð Þ 1⁄2 =2, and one simple solution with d1(0) = d2(0) = l1/2 = 1 and d1(1) = e b + , d2(1) = e c + , l2 = 2e makes it equal to the correlation function f(x1, x2) with arbitrary coefficients a, b, c.”
BackgroundMethodBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“Becausewe require the precision of the quantumphase estimation to beD to distinguish the ground state from the excited states ofHt, the quantumphase estimation algorithm in substep 1 has runtime complexity ~ Oðn2c=DÞ for the QGMdefined on a constant-degree graph (32–34), where D = mintDt and ~ Oð⋅Þ suppresses slowly g…”
BackgroundUnderstanding Machine Learning: From Theory to Algorithms
Shalev-Shwartz, S., & Ben-David, S. (2014) · doi:10.1017/cbo9781107298019 · Cited by 3,115
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Quantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
Quantum principal component analysis
Lloyd, S., Mohseni, M., & Rebentrost, P. (2014) · Nature Physics · doi:10.1038/nphys3029 · Cited by 1,385 · cited 1×
“In a QRAM, the number of required quantum routing operations ( 16 ) scales up exponentially with the number of qubits in those algorithms ( 9 , 15 , 17 ).”
Background
Cited by
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
A rigorous and robust quantum speed-up in supervised machine learning
Liu, Y., Arunachalam, S., & Temme, K. (2021) · Nature Physics · doi:10.1038/s41567-021-01287-z · Cited by 649
A Comprehensive Review on Generative AI for Education
Mittal, U., Sai, S., Chamola, V., & Sangwan, D. (2024) · IEEE Access · doi:10.1109/access.2024.3468368 · Cited by 383
A generative modeling approach for benchmarking and training shallow quantum circuits
Benedetti, M., Garcia-Pintos, D., Perdomo, O., Leyton-Ortega, V., Nam, Y., & Perdomo-Ortiz, A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0157-8 · Cited by 379
“[28] Xun Gao, Zhengyu Zhang, and Luming Duan, “A quantum machine learning algorithm based on generative models,” Science Advances 4 (2018), 10.”
BackgroundMethodGround-state energy estimation of the water molecule on a trapped-ion quantum computer
Nam, Y., Chen, J.-S., Pisenti, N. C., Wright, K., Delaney, C., Maslov, D., Brown, K. R., Allen, S., Amini, J. M., Apisdorf, J., et al. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0259-3 · Cited by 345
Metadata
- Authors
- Gao, X., Zhang, Z.-Y., & Duan, L.-M.
- Venue
- Science Advances
- Published
- 2018-12-07
- Volume
- 4
- Issue
- 12
- Pages
- eaat9004-eaat9004
- ISSN
- 2375-2548 (ISSN-L)
- OpenAlex
- W2903891684
- Cited by
- 147
- References
- 24
- FWCI
- 7.21
- Type
- journal article
- Language
- en
- Open access
- gold
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: A quantum machine learning algorithm based on generative models. https://app.cochat.ai/papers/10.1126/sciadv.aat9004
- The paper
- Gao, X., Zhang, Z.-Y., & Duan, L.-M. (2018). A quantum machine learning algorithm based on generative models. Science Advances. https://doi.org/10.1126/sciadv.aat9004
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.