Percolation thresholds for photonic quantum computing
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904 · cited 1×
“Many variants of KLM were proposed [5, 18, 26] that use entangled ancillas to reduce the overheads, but the hardness was pushed into creating those ancillas.”
BackgroundExperimental realization of any discrete unitary operator
Reck, M., Zeilinger, A., Bernstein, H. J., & Bertani, P. (1994) · Physical Review Letters · doi:10.1103/physrevlett.73.58 · Cited by 2,155
Carolan, J., Harrold, C., Sparrow, C., Martín-López, E., Russell, N. J., Silverstone, J. W., Shadbolt, P. J., Matsuda, N., Oguma, M., Itoh, M., et al. (2015) · Science · doi:10.1126/science.aab3642 · Cited by 1,093 · cited 3×
“To construct G1, we begin with (1) a (two- or higherdimensional) spatial arrangement of three-photon line clusters, (2) identifying pairs of photons (belonging to distinct clusters), upon which fusions will be attempted, and (3) one of two types for each of those fusions: blue or green, linear optical circuits to real…”
BackgroundMethodThe computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Resource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790 · cited 2×
“Although Browne and Rudolph’s original paper that coined the term ‘fusion’ [5] also proposed an alternative linear optical fusion circuit (called fusion-I), subsequent work has focussed on Bell-measurement based fusion (fusion-II of [5]) because of its natural loss tolerance and recent progress in boosting its success…”
BackgroundQuantum transport simulations in a programmable nanophotonic processor
Harris, N. C., Steinbrecher, G. R., Prabhu, M., Lahini, Y., Mower, J., Bunandar, D., Chen, C., Wong, F. N. C., Baehr-Jones, T., Hochberg, M., et al. (2017) · Nature Photonics · doi:10.1038/nphoton.2017.95 · Cited by 519 · cited 10×
“First, we consider a 4D extension of the (10,3)-b lattice (see Fig.”
BackgroundMethodInfluentialSelf-citationWhy I am optimistic about the silicon-photonic route to quantum computing
Rudolph, T. (2017) · APL Photonics · doi:10.1063/1.4976737 · Cited by 350 · cited 2×
“A major challenge, as expounded in [28] as well, is an experimental scheme to build an on-demand source of high-fidelity small entangled cluster states, e.”
BackgroundGreenberger-Horne-Zeilinger-state analyzer
Pan, J.-W., & Zeilinger, A. (1998) · Physical Review A · doi:10.1103/physreva.57.2208 · Cited by 213 · cited 2×
“Very little is known about linear-optical circuits for m > 2 qubit fusion [24] (e.”
Background
Cited by
Photonic quantum information processing: a concise review
Slussarenko, S., & Pryde, G. J. (2019) · Applied Physics Reviews · doi:10.1063/1.5115814 · Cited by 644
The potential and global outlook of integrated photonics for quantum technologies
Pelucchi, E., Fagas, G., Aharonovich, I., Englund, D., Figueroa, E., Gong, Q., Hannes, H., Liu, J., Lu, C.-Y., Matsuda, N., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00398-z · Cited by 533
Self-citationRole of artificial intelligence in operations environment: a review and bibliometric analysis
Dhamija, P., & Bag, S. (2020) · The TQM Journal · doi:10.1108/tqm-10-2019-0243 · Cited by 390
Fusion-based quantum computation
Bartolucci, S., Birchall, P., Bombín, H., Cable, H., Dawson, C., Gimeno-Segovia, M., Johnston, E., Kieling, K., Nickerson, N., Pant, M., et al. (2023) · Nature Communications · doi:10.1038/s41467-023-36493-1 · Cited by 371
Self-citationWhy I am optimistic about the silicon-photonic route to quantum computing
Rudolph, T. (2017) · APL Photonics · doi:10.1063/1.4976737 · Cited by 350
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.