Quantum computational advantage using photons
Open accessThe DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Abstract
A light approach to quantum advantage: Quantum computational advantage or supremacy is a long-anticipated milestone toward practical quantum computers. Recent work claimed to have reached this point, but subsequent work managed to speed up the classical simulation and pointed toward a sample size–dependent loophole. Quantum computational advantage, rather than being a one-shot experimental proof, will be the result of a long-term competition between quantum devices and classical simulation. Zhong et al. sent 50 indistinguishable single-mode squeezed states into a 100-mode ultralow-loss interferometer and sampled the output using 100 high-efficiency single-photon detectors. By obtaining up to 76-photon coincidence, yielding a state space dimension of about 10 30 , they measured a sampling rate that is about 10 14 -fold faster than using state-of-the-art classical simulation strategies and supercomputers. Science , this issue p. 1460
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Recent advances in control and readout of quantum bits have underscored the spectacular promise of QIP [82,83].”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [83]
In the citing paper
“After that, Zhong etal. generated up to 76 output photon clicks. This experiment yielded an output state-space dimension of 10 30 by the photonic quantum computer, Jiuzhang.”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [6]
In the citing paper
“It is the fastest calculation than the state-of-the-art simulation approach [6].”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [6]
In the citing paper
“Existing quantum devices contain on the order of 100 physical qubits.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Zhong et al., 2020
In the citing paper
“and GBS has recently become the second platform to show quantum computational supremacy (Zhong et al. , 2020)”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Zhong et al., 2020
4 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
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 · cited 1×
“A very recent experiment on a quantum processor with 53 superconducting qubits has generated a million noisy (~0.2% fidelity) samples in 200 seconds ( 10 ), while the first estimation would take about 10,000 years on a state-of-the-art classical supercomputer.”
BackgroundInfluentialSimulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Measurement of subpicosecond time intervals between two photons by interference
Hong, C. K., Ou, Z. Y., & Mandel, L. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.2044 · Cited by 4,369 · cited 1×
“-nm filtering (Fig. S6, S7). A second estimation of the purity is by unheralded secondorder correlation measurements (47), which agrees with independent calibrations using time-delayed Hong-Ou-Mandel (48) interference visibility at low pump power. The 5 measured pair-wise photon purities are plotted in Fig. 2D, which…”
MethodInfluentialNew High-Intensity Source of Polarization-Entangled Photon Pairs
Kwiat, P. G., Mattle, K., Weinfurter, H., Zeilinger, A., Sergienko, A. V., & Shih, Y. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4337 · Cited by 3,102 · cited 1×
“outstanding experimental challenge. The early proof-of-principle demonstrations of boson sampling (20-23) used probabilistic, post-selected pseudo-single photons from parametric down-conversion (PDC) (28). Improved on-demand single-photon sources based on semiconductor quantum dots were developed and employed to signi…”
MethodCarolan, J., Harrold, C., Sparrow, C., Martín-López, E., Russell, N. J., Silverstone, J. W., Shadbolt, P. J., Matsuda, N., Oguma, M., Itoh, M., et al. (2015) · Science · doi:10.1126/science.aab3642 · Cited by 1,093 · cited 1×
“There have been various validation methods ( 51-54 ) proposed and related experiments ( 24-27,29-31, 44, 45, 55-58 ) to gather supporting or circumstantial evidence for the correct operations of the boson-samplers.”
MethodThe computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874 · cited 5×
“mple. In addition, boson samplers use photons which can be operated at room temperature and are robust to decoherence, and are appealing to show the surprising yet remarkable computational complexity (5,19). Inspired by the original proposal of Aaronson and Arkhipov (5), numerous experiments have demonstrated boson sa…”
BackgroundMethodInfluentialBoson Sampling on a Photonic Chip
Spring, J. B., Metcalf, B. J., Humphreys, P. C., Kolthammer, W. S., Jin, X.-M., Barbieri, M., Datta, A., Thomas-Peter, N., Langford, N. K., Kundys, D., et al. (2013) · Science · doi:10.1126/science.1231692 · Cited by 837 · cited 2×
“The early proof-of-principle demonstrations of boson sampling (20-23) used probabilistic, post-selected pseudo-single photons from parametric down-conversion (PDC) (28).”
BackgroundTillmann, M., Dakić, B., Heilmann, R., Nolte, S., Szameit, A., & Walther, P. (2013) · Nature Photonics · doi:10.1038/nphoton.2013.102 · Cited by 709 · cited 2×
“The early proof-of-principle demonstrations of boson sampling (20-23) used probabilistic, post-selected pseudo-single photons from parametric down-conversion (PDC) (28).”
BackgroundQuantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 702 · cited 1×
“This sample size dependence of the computational advantage—an analog to the loopholes in Bell tests ( 13 )—suggests that a quantum computational advantage would require long-term competitions between faster classical simulations and improved quantum devices.”
BackgroundIntegrated multimode interferometers with arbitrary designs for photonic boson sampling
Crespi, A., Osellame, R., Ramponi, R., Brod, D. J., Galvão, E. F., Spagnolo, N., Vitelli, C., Maiorino, E., Mataloni, P., & Sciarrino, F. (2013) · Nature Photonics · doi:10.1038/nphoton.2013.112 · Cited by 662 · cited 1×
“The early proof-of-principle demonstrations of boson sampling ( 20-23 ) used probabilistic, post-selected pseudo-single photons from parametric down-conversion (PDC) ( 28 ).”
Background
Research works printed but not linked: 8
- E. Bernstein U. Vazirani in Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993). 10.1145/167088.167097 · DOI · Paper page
- P. W. Shor in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994).
- S. Aaronson L. Chen in Proceedings of the 32nd Computational Complexity Conference (2017).
- J. Preskill Rapporteur talk at the 25th Solvay Conference on Physics Brussels (2012).
- E. Pednault J. A. Gunnels G. Nannicini L. Horesh R. Wisnieff Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits. arXiv 1910.09534 [quant-ph] (22 October 2019). · arXiv
- P. Clifford R. Clifford in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (2018).
- X. Li et al . Benchmarking 50-Photon Gaussian Boson Sampling on the Sunway TaihuLight. arXiv 2009.01177 [cs.DC] (2 September 2020). · arXiv
- S. M. Barnett P. M. Radmore Methods in Theoretical Quantum Optics (Oxford Science 1997).
Cited by
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
“This size actually allows one to achieve quantum supremacy, outperforming the best classical supercomputer, for certain contrived mathematical tasks [8, 9].”
BackgroundNoisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Integrated photonics on thin-film lithium niobate
Zhu, D., Shao, L., Yu, M., Cheng, R., Desiatov, B., Xin, C. J., Hu, Y., Holzgrafe, J., Ghosh, S., Shams-Ansari, A., et al. (2021) · Advances in Optics and Photonics · doi:10.1364/aop.411024 · Cited by 1,516
Self-citationLogical 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
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor
Wu, Y., Bao, W.-S., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.180501 · Cited by 1,059
Self-citation
Metadata
- Authors
- Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., Hu, P., Yang, X.-Y., Zhang, W.-J., Li, H., Li, Y., Jiang, X., Gan, L., Yang, G., You, L., Wang, Z., Li, L., Liu, N.-L., Lu, C.-Y., & Pan, J.-W.
- Affiliations
- University of Science and Technology of China (CN)
- Chinese Academy of Sciences (CN)
- Beijing National Research Center for Information Science and Technology (CN)
- Corresponding author
- Lu, Chao-Yang
- Pan, Jian-Wei
- ORCID
- Venue
- Science
- Published
- 2020-12-18
- Volume
- 370
- Issue
- 6523
- Pages
- 1460-1463
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W3107463944
- Cited by
- 2,405
- References
- 40
- Citations by year
- 2026: 217 · 2025: 372 · 2024: 419 · 2023: 536 · 2022: 499 · 2021: 351 · 2020: 8
- FWCI
- 135.76
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Figshare (submittedVersion, cc-by)
- arXiv (Cornell University) (cc-by)
- Funders
- National Natural Science Foundation of China
- Chinese Academy of Sciences
- Science and Technology Commission of Shanghai Municipality
- Anhui Initiative in Quantum Information Technologies
- National Key R and D Program of China
- 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 Mechanics and Applications
- Keywords
- quantum advantage, single-photon interference, squeezed light, single-photon detectors, coincidence measurement, classical simulation, state space dimension, photonic quantum computing
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.