Cited by 48Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Quadratic Speed-Up for Simulating Gaussian Boson Sampling

Open access
Quesada, Nicolás, Chadwick, Rachel S., Bell, Bryn A., Arrazola, Juan Miguel, Vincent, Trevor, Qi, Haoyu, García−Patrón, Raúl·2022·PRX Quantum

Abstract

We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods.The complexity of the algorithm is exponential in the number of photon pairs detected, not the number of photons, and is directly proportional to the time required to calculate a probability amplitude for a pure Gaussian state.The main innovation is to use auxiliary conditioning variables to reduce the problem of sampling to the computation of the pure-state probability amplitudes, for which the most computationally expensive step is the calculation of a loop hafnian.We implement and benchmark an improved loop-hafnian algorithm and show that it can be used to compute pure-state probabilities, the dominant step in the sampling algorithm, of events involving up to 50 photons in a single workstation, i.e., without the need of a supercomputer.

Integrity signals

Registry

Crossref · 10.1103/prxquantum.3.010306

Cites

38 of 38 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • On average, it would take more than 9,000 years for the best available algorithms and supercomputers to produce, using exact methods, a single sample from the programmed distribution.

    “On average, it would take more than 9,000 years for the best available algorithms and supercomputers to produce, using exact methods, a single sample from the programmed distribution”
  • The best-known algorithm to simulate GBS scales with the total number of modes and the time it takes to calculate a probability amplitude of a pure-state GBS instance.

    “The best-known algorithm to simulate GBS30,34 scales with the total number of modes and the time it takes to calculate a probability amplitude of a pure-state GBS instance.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Quesada, N., Chadwick, R. S., Bell, B. A., Arrazola, J. M., Vincent, T., Qi, H., & García−Patrón, R.
Affiliations
  • Xanadu Quantum Technologies (Canada) (CA)
  • University of Bristol (GB)
  • Imperial College London (GB)
  • University of Edinburgh (GB)
Venue
PRX Quantum
Published
2022-01-11
Volume
3
Issue
1
ISSN
2691-3399 (ISSN-L)
OpenAlex
W3095883505
Cited by
48
References
38
Citations by year
2026: 5 · 2025: 10 · 2024: 10 · 2023: 9 · 2022: 11 · 2021: 3
FWCI
3.29
Type
journal article
Language
en
Open access
Locations
  • PRX Quantum (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • PolyPublie (École Polytechnique de Montréal) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Engineering and Physical Sciences Research Council (EP/LO15730/1)
  • FrEQuMP (846073)
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 Mechanics and Applications
Keywords
Gaussian boson sampling, classical simulation, computational complexity

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