CoChat

Percolation thresholds for photonic quantum computing

Open access
Pant, Mihir, Towsley, Don, Englund, Dirk, Guha, Saikat · 2019 · Nature Communications
Cited by 74

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

Abstract

Despite linear-optical fusion (Bell measurement) being probabilistic, photonic cluster states for universal quantum computation can be prepared without feed-forward by fusing small n-photon entangled clusters, if the success probability of each fusion attempt is above a threshold, $${\mathrm{\lambda }}_{\mathrm{c}}^{(n)}$$ λ c ( n ) . We prove a general bound $${\mathrm{\lambda }}_{\mathrm{c}}^{(n)} \ge 1/(n - 1)$$ λ c ( n ) ≥ 1 ∕ ( n - 1 ) , and develop a conceptual method to construct long-range-connected clusters where $${\mathrm{\lambda }}_{\mathrm{c}}^{(n)}$$ λ c ( n ) becomes the bond percolation threshold of a logical graph. This mapping lets us find constructions that require lower fusion success probabilities than currently known, and settle a heretofore open question by showing that a universal cluster state can be created by fusing 3-photon clusters over a 2D lattice with a fusion success probability that is achievable with linear optics and single photons, making this attractive for integrated-photonic realizations.

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.1038/s41467-019-08948-x

Cites

13 of 13 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 13 references

Cited by

See all 74

Metadata

Authors
Pant, M., Towsley, D., Englund, D., & Guha, S.
Venue
Nature Communications
Published
2019-03-06
Volume
10
Issue
1
Pages
1070-1070
ISSN
2041-1723 (ISSN-L)
OpenAlex
W2572320999
Cited by
74
References
13
FWCI
3.11
Type
journal article
Language
en
Open access
gold

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: Percolation thresholds for photonic quantum computing. https://app.cochat.ai/papers/10.1038/s41467-019-08948-x
The paper
Pant, M., Towsley, D., Englund, D., & Guha, S. (2019). Percolation thresholds for photonic quantum computing. Nature Communications. https://doi.org/10.1038/s41467-019-08948-x

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.