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

Gaussian boson sampling using threshold detectors

Open access
Quesada, Nicolás, Arrazola, Juan Miguel, Killoran, Nathan·2018·Physical Review A

Abstract

We study what is arguably the most experimentally appealing boson sampling architecture: Gaussian states sampled with threshold detectors. We show that, in this setting, the probability of observing a given outcome is related to a matrix function that we name the Torontonian, which plays an analogous role to the permanent or the Hafnian in other models. We also prove that, provided that the probability of observing two or more photons in a single output mode is sufficiently small, our model remains intractable to simulate classically under standard complexity-theoretic conjectures. Finally, we leverage the mathematical simplicity of the model to introduce a physically motivated, exact sampling algorithm for all boson sampling models that employ Gaussian states and threshold detectors.

Integrity signals

Registry

Crossref · 10.1103/physreva.98.062322

Cites

33 of 33 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?

  • A simpler form of the GBS experiment where only the presence or absence of photons is detected can be used to sample from the Torontonian function of a matrix.

    “A simpler form of the experiment where instead of counting the number of photons in each mode, we only detect if there are photons or not in each mode, can be used to sample from the so-called Torontonian function of a matrix (Quesada et al. , 2018).”

    From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Quesada et al., 2018

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Quesada, N., Arrazola, J. M., & Killoran, N.
Venue
Physical Review A
Published
2018-12-18
Volume
98
Issue
6
ISSN
  • 0556-2791 (ISSN-L)
  • 2469-9926
  • 2469-9934
OpenAlex
W2810513857
Cited by
120
References
33
Citations by year
2026: 6 · 2025: 17 · 2024: 21 · 2023: 22 · 2022: 21 · 2021: 14 · 2020: 12 · 2019: 7
FWCI
4.62
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (publishedVersion)
  • PolyPublie (École Polytechnique de Montréal) (submittedVersion)
  • arXiv (Cornell University)
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, threshold detectors, permanent, hafnian, Gaussian states, photon number statistics

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