CoChat
Sign Up
Cited by 106Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Quantum computational advantage via high-dimensional Gaussian boson sampling

Open access
Deshpande, Abhinav, Mehta, Arthur, Vincent, Trevor, Quesada, Nicolás, Hinsche, Marcel, Ioannou, Marios, Madsen, Lars, Lavoie, Jonathan +5 more·2022·Science Advances
DOI 10.1126/sciadv.abi7894PMC PMC8730598
Open this paper in CoChat — free account

Abstract

A programmable quantum computer based on fiber optics outperforms classical computers with a high level of confidence.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1126/sciadv.abi7894

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • If one were to target a universal and programmable interferometer with depth equal to the number of modes that covers densely the set of unitary matrices, the exponential accumulation of loss would prohibit showing a quantum advantage.

    “if one were to target a universal and programmable interferometer, with depth equal to the number of modes, that covers densely the set of unitary matrices, the exponential accumulation of loss would prohibit showing a quantum advantage.”

    From Quantum computational advantage with a programmable photonic processor (2022) · cites this paper as [5]

  • Tensor network techniques are ruled out for speeding up simulation of the circuit considered; even with effectively infinite memory they require significantly more time than hafnian-based methods to calculate probability amplitudes.

    “this possibility is ruled out in ref. 5 where it is shown that, even when giving tensor network algorithms effectively infinite memory, they require significantly more time than hafnian based methods to calculate probability amplitudes.”

    From Quantum computational advantage with a programmable photonic processor (2022) · cites this paper as [5]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 48

  1. [3]E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, R. Wisnieff, Leveraging secondary storage to simulate deep 54-qubit sycamore circuits. arXiv: 1910.09534 (2019). · arXiv
  2. [4]G. Kalai, G. Kindler, Gaussian noise sensitivity and BosonSampling. arXiv: 1409.3093 (2014). · arXiv
  3. [5]J. J. Renema, Marginal probabilities in boson samplers with arbitrary input states. arXiv: 2012.14917 (2020). · arXiv
  4. [8]J. E. Bourassa, R. N. Alexander, M. Vasmer, A. Patil, I. Tzitrin, T. Matsuura, D. Su, B. Q. Baragiola, S. Guha, G. Dauphinais, K. K. Sabapathy, N. C. Menicucci, I. Dhand, Blueprint for a scalable photonic fault-tolerant quantum computer. Quantum 5, 392 (2021).
  5. [9]S. Bartolucci, P. Birchall, H. Bombin, H. Cable, C. Dawson, M. Gimeno-Segovia, E. Johnston, K. Kieling, N. Nickerson, M. Pant, F. Pastawski, T. Rudolph, C. Sparrow, Fusion-based quantum computation. arXiv: 2101.09310 (2021). PMC9938229 36805650 · arXiv
  6. [10]C. S. Hamilton, R. Kruse, L. Sansoni, S. Barkhofen, C. Silberhorn, I. Jex, Gaussian boson sampling. Phys. Rev. Lett. 119, 170501 (2017). 29219463
  7. [13]A. Bouland, B. Fefferman, Z. Landau, Y. Liu, Noise and the frontier of quantum supremacy. arXiv: 2102.01738 (2021). · arXiv
  8. [14]A. Björklund, B. Gupt, N. Quesada, A faster hafnian formula for complex matrices and its benchmarking on a supercomputer. ACM J. Exp. Algorithmics 24, 1– 17 (2019).
  9. [15]L. Stockmeyer, in Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (ACM, 1983), pp. 118–126.
  10. [17]T. Jiang, The entries of circular orthogonal ensembles. J. Math. Phys. 50, 063302 (2009).
  11. [19]T. Jiang, Y. Ma, Distances between random orthogonal matrices and independent normals. Trans. Am. Math. Soc. 372, 1509– 1553 (2017).
  12. [20]Y. Kondo, R. Mori, R. Movassagh, Fine-grained analysis and improved robustness of quantum supremacy for random circuit sampling. arXiv: 2102.01960 (2021). · arXiv
  13. [21]R. Movassagh, Quantum supremacy and random circuits. arXiv: 1909.06210 (2019). · arXiv
  14. [22]K. Fujii, Noise threshold of quantum supremacy. arXiv: 2102.01738 (2016). · arXiv
  15. [23]M. Oszmaniec, D. J. Brod, Classical simulation of photonic linear optics with lost particles. New J. Phys. 20, 092002 (2018).
  16. [24]E. Knill, Quantum gates using linear optics and postselection. Phys. Rev. A 66, 052306 (2002).
  17. [25]S. Rahimi-Keshari, A. Scherer, A. Mann, A. T. Rezakhani, A. I. Lvovsky, B. C. Sanders, Quantum process tomography with coherent states. New J. Phys. 13, 013006 (2011).
  18. [27]R. García-Patrón, J. J. Renema, V. Shchesnovich, Simulating boson sampling in lossy architectures. Quantum 3, 169 (2019).
  19. [28]H. Qi, D. Cifuentes, K. Brádler, R. Israel, T. Kalajdzievski, N. Quesada, Efficient sampling from shallow gaussian quantum-optical circuits with local interactions. arXiv: 2009.11824 (2020). · arXiv
  20. [29]J. Bermejo-Vega, D. Hangleiter, M. Schwarz, R. Raussendorf, J. Eisert, Architectures for quantum simulation showing a quantum speedup. Phys. Rev. X 8, 021010 (2018).
  21. [30]K. R. Motes, A. Gilchrist, J. P. Dowling, P. P. Rohde, Scalable boson sampling with time-bin encoding using a loop-based architecture. Phys. Rev. Lett. 113, 120501 (2014). 25279613
  22. [31]T. Nitsche, S. Barkhofen, R. Kruse, L. Sansoni, M. Štefaňák, A. Gábris, V. Potoček, T. Kiss, I. Jex, C. Silberhorn, Probing measurement-induced effects in quantum walks via recurrence. Sci. Adv. 4, eaar6444 (2018). 29963626 PMC6025909
  23. [32]C. Taballione, R. van der Meer, H. J. Snijders, P. Hooijschuur, J. P. Epping, M. de Goede, B. Kassenberg, P. Venderbosch, C. Toebes, H. van den Vlekkert, P. W. H. Pinkse, J. J. Renema, A 12-mode universal photonic processor for quantum information processing. Mater. Quantum. Technol. 1, 035002 (2020).
  24. [33]K. R. Motes, J. P. Dowling, A. Gilchrist, P. P. Rohde, Implementing bosonsampling with time-bin encoding: Analysis of loss, mode mismatch, and time jitter. Phys. Rev. A 92, 052319 (2015).
  25. [34]C. Oh, Y. Lim, B. Fefferman, L. Jiang, Classical simulation of bosonic linear-optical random circuits beyond linear light cone. arXiv: 2102.10083 (2021). · arXiv
  26. [35]Y. He, X. Ding, Z.-E. Su, H.-L. Huang, J. Qin, C. Wang, S. Unsleber, C. Chen, H. Wang, Y.-M. He, X.-L. Wang, W.-J. Zhang, S.-J. Chen, C. Schneider, M. Kamp, L.-X. You, Z. Wang, S. Höfling, C.-Y. Lu, J.-W. Pan, Time-bin-encoded boson sampling with a single-photon device. Phys. Rev. Lett. 118, 190501 (2017). 28548532
  27. [36]H. Wang, J. Qin, X. Ding, M.-C. Chen, S. Chen, X. You, Y.-M. He, X. Jiang, L. You, Z. Wang, C. Schneider, J.-J. Renema, S. Höfling, C.-Y. Lu, J.-W. Pan, Boson sampling with 20 input photons and a 60-mode interferometer in a 1014-Dimensional hilbert space. Phys. Rev. Lett. 123, 250503 (2019). 31922765
  28. [37]A. Schreiber, A. Gábris, P. P. Rohde, K. Laiho, M. Štefaňák, V. Potoček, C. Hamilton, I. Jex, C. Silberhorn, A 2d quantum walk simulation of two-particle dynamics. Science 336, 55– 58 (2012). 22403179
  29. [38]L. Lorz, E. Meyer-Scott, T. Nitsche, V. Potoček, A. Gábris, S. Barkhofen, I. Jex, C. Silberhorn, Photonic quantum walks with four-dimensional coins. Phys. Rev. Res. 1, 033036 (2019).
  30. [40]J. M. Arrazola, V. Bergholm, K. Brádler, T. R. Bromley, M. J. Collins, I. Dhand, A. Fumagalli, T. Gerrits, A. Goussev, L. G. Helt, J. Hundal, T. Isacsson, R. B. Israel, J. Izaac, S. Jahangiri, R. Janik, N. Killoran, S. P. Kumar, J. Lavoie, A. E. Lita, D. H. Mahler, M. Menotti, B. Morrison, S. W. Nam, L. Neuhaus, H. Y. Qi, N. Quesada, A. Repingon, K. K. Sabapathy, M. Schuld, D. Su, J. Swinarton, A. Száva, K. Tan, P. Tan, V. D. Vaidya, Z. Vernon, Z. Zabaneh, Y. Zhang, Quantum circuits with many photons on a programmable nanophotonic chip. Nature 591, 54– 60 (2021). 33658692 PMC11008968
  31. [41]S. Takeda, K. Takase, A. Furusawa, On-demand photonic entanglement synthesizer. Sci. Adv. 5, eaaw4530 (2019). 31114809 PMC6524974
  32. [42]I. Dhand, M. Engelkemeier, L. Sansoni, S. Barkhofen, C. Silberhorn, M. B. Plenio, Proposal for quantum simulation via all-optically-generated tensor network states. Phys. Rev. Lett. 120, 130501 (2018). 29694179
  33. [43]D. J. Brod, Complexity of simulating constant-depth Boson Sampling. Phys. Rev. A 91, 042316 (2015).
  34. [44]N. Quesada, J. M. Arrazola, Exact simulation of gaussian boson sampling in polynomial space and exponential time. Phys. Rev. Res. 2, 023005 (2020).
  35. [45]J. Gray, S. Kourtis, Hyper-optimized tensor network contraction. Quantum 5, 410 (2021).
  36. [46]D. Hangleiter, J. Bermejo-Vega, M. Schwarz, J. Eisert, Anti-concentration theorems for schemes showing a quantum computational speedup. Quantum 2, 65 (2018).
  37. [47]M. V. Larsen, X. Guo, C. R. Breum, J. S. Neergaard-Nielsen, U. L. Andersen, Deterministic generation of a two-dimensional cluster state. Science 366, 369– 372 (2019). 31624213
  38. [48]N. Quesada, R. S. Chadwick, B. A. Bell, J. M. Arrazola, T. Vincent, H. Qi, R. García-Patrón, Quadratic speedup for simulating gaussian boson sampling. arXiv: 2010.15595 (2020). · arXiv
  39. [49]Z. Vernon, N. Quesada, M. Liscidini, B. Morrison, M. Menotti, K. Tan, J. Sipe, Scalable squeezed-light source for continuous-variable quantum sampling. Phys. Rev. Appl. 12, 064024 (2019).
  40. [50]V. Dodonov, O. Man’ko, V. Man’ko, Photon distribution for one-mode mixed light with a generic gaussian wigner function. Phys. Rev. A 49, 2993– 3001 (1994). 9910582
  41. [51]N. Quesada, L. G. Helt, J. Izaac, J. M. Arrazola, R. Shahrokhshahi, C. R. Myers, K. K. Sabapathy, Simulating realistic non-gaussian state preparation. Phys. Rev. A 100, 022341 (2019).
  42. [52]I. L. Markov, A. Fatima, S. V. Isakov, S. Boixo, Quantum supremacy is both closer and farther than it appears. arXiv: 1807.10749 (2018). · arXiv
  43. [54]Y. Li, M. Chen, Y. Chen, H. Lu, L. Gan, C. Lu, J. Pan, H. Fu, G. Yang, Benchmarking 50-photon gaussian boson sampling on the sunway TaihuLight. arXiv: 2009.01177 (2020). · arXiv
  44. [55]T.-W. Huang, D.-L. Lin, Y. Lin, C.-X. Lin, Cpp-taskflow: A general-purpose parallel and heterogeneous task programming system at scale. arXiv: 2004.10908 (2020). · arXiv
  45. [56]B. Gupt, J. Izaac, N. Quesada, The walrus: A library for the calculation of hafnians, hermite polynomials and gaussian boson sampling. J. Open Source Softw. 4, 1705 (2019).
  46. [57]B. Villalonga, D. Lyakh, S. Boixo, H. Neven, T. S. Humble, R. Biswas, E. G. Rieffel, A. Ho, S. Mandrà, Establishing the quantum supremacy frontier with a 281 pflop/s simulation. Quantum Sci. Technol. 5, 034003 (2020).
  47. [58]B. Villalonga, S. Boixo, B. Nelson, C. Henze, E. Rieffel, R. Biswas, S. Mandrà, A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware. nph Quant. Inf. 5, 86 (2019).
  48. [60]M. Ponce, R. van Zon, S. Northrup, D. Gruner, J. Chen, F. Ertinaz, A. Fedoseev, L. Groer, F. Mao, B. C. Mundim, et al., Deploying a top-100 supercomputer for large parallel workloads: The Niagara supercomputer. Proceedings of the practice and experience in advanced research computing on rise of the machines (learning) (2019), pp. 1–8.

Cited by

Sorted by citations

Authors
Deshpande, A., Mehta, A., Vincent, T., Quesada, N., Hinsche, M., Ioannou, M., Madsen, L., Lavoie, J., Qi, H., Eisert, J., Hangleiter, D., Fefferman, B., & Dhand, I.
Affiliations
  • California Institute of Technology (US)
  • University of Toronto (CA)
  • Xanadu Quantum Technologies (Canada) (CA)
  • Freie Universität Berlin (DE)
  • Helmholtz-Zentrum Berlin für Materialien und Energie (DE)
  • Joint Center for Quantum Information and Computer Science (US)
  • University of Chicago (US)
  • Universität Ulm (DE)
Corresponding author
  • Deshpande, Abhinav
  • Mehta, Arthur
  • Dhand, Ish
ORCID
Venue
Science Advances
Publisher
American Association for the Advancement of Science (AAAS)
Published
2022-01-07
Volume
8
Issue
1
Pages
eabi7894-eabi7894
ISSN
2375-2548 (ISSN-L)
DOI
10.1126/sciadv.abi7894
PMC
PMC8730598
OpenAlex
W4205363984
Cited by
106
References
7
Citations by year
2026: 8 · 2025: 26 · 2024: 22 · 2023: 30 · 2022: 20
FWCI
8.06
Type
journal article
Language
en
Open access
Licence
cc-by-nc
Locations
  • Science Advances (publishedVersion, cc-by-nc)
  • PubMed Central (publishedVersion, cc-by-nc)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (acceptedVersion)
  • CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by-nc)
  • Knowledge@UChicago (University of Chicago) (submittedVersion, cc-by-nc-nd)
  • HZB Repository (Helmholtz-Zentrum Berlin für Materialien und Energie GmbH (HZB)) (submittedVersion, other-oa)
  • PolyPublie (École Polytechnique de Montréal) (submittedVersion)
  • Refubium (Universitätsbibliothek der Freien Universität Berlin) (submittedVersion, cc-by-nc)
  • arXiv (Cornell University)
  • Universitätsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver
  • University of Chicago
Funders
  • European Commission
  • Deutsche Forschungsgemeinschaft
  • Bundesministerium für Bildung und Forschung
  • Mitacs
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
quantum advantage, Gaussian boson sampling, photonics, quantum simulation algorithms

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