CoChat

Gaussian boson sampling for perfect matchings of arbitrary graphs

Open access
Brádler, Kamil, Dallaire-Demers, Pierre-Luc, Rebentrost, Patrick, Su, Daiqin, Weedbrook, Christian · 2018 · Physical Review A
Cited by 95

The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.

Abstract

A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is, the number of unique and complete pairings of the vertices of a graph. We propose a method to estimate the number of perfect matchings of undirected graphs based on the relation between Gaussian boson sampling and graph theory. The probability of measuring zero or one photons in each output mode is directly related to the hafnian of the adjacency matrix, and thus to the number of perfect matchings of a graph. We present encodings of the adjacency matrix of a graph into a Gaussian state and show strategies to boost the sampling success probability for the studied graphs. With our method, a Gaussian boson sampling device can be used to estimate the number of perfect matchings significantly faster and with lower-energy consumption compared to a classical computer.

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.

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

Integrity signals

Registry

Crossref · 10.1103/physreva.98.032310

Cites

12 of 12 references verified0 citation errors · 0 not checkable

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.

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

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

Show all 12 references

Cited by

See all 95

Metadata

Authors
Brádler, K., Dallaire-Demers, P.-L., Rebentrost, P., Su, D., & Weedbrook, C.
Venue
Physical Review A
Published
2018-09-10
Volume
98
Issue
3
ISSN
  • 0556-2791 (ISSN-L)
  • 2469-9926
  • 2469-9934
OpenAlex
W2781364653
Cited by
95
References
12
FWCI
6.22
Type
journal article
Language
en
Open access
green

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: Gaussian boson sampling for perfect matchings of arbitrary graphs. https://app.cochat.ai/papers/10.1103/physreva.98.032310
The paper
Brádler, K., Dallaire-Demers, P.-L., Rebentrost, P., Su, D., & Weedbrook, C. (2018). Gaussian boson sampling for perfect matchings of arbitrary graphs. Physical Review A. https://doi.org/10.1103/physreva.98.032310

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.