Percolation thresholds for photonic quantum computing

Mihir Pant, Don Towsley, Dirk Englund, Saikat Guha

Research output: Contribution to journalArticle

3 Citations (Scopus)

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, λc(n). We prove a general bound λc(n)≥1∕(n-1), and develop a conceptual method to construct long-range-connected clusters where λ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.

Original languageEnglish (US)
Article number1070
JournalNature communications
Volume10
Issue number1
DOIs
StatePublished - Dec 1 2019

Fingerprint

Optics and Photonics
Quantum theory
quantum computation
Photons
Photonics
quantum mechanics
Fusion reactions
photonics
Electrons
fusion
thresholds
electrons
photons
Quantum computers
Optics
bells
optics

ASJC Scopus subject areas

  • Chemistry(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Physics and Astronomy(all)

Cite this

Percolation thresholds for photonic quantum computing. / Pant, Mihir; Towsley, Don; Englund, Dirk; Guha, Saikat.

In: Nature communications, Vol. 10, No. 1, 1070, 01.12.2019.

Research output: Contribution to journalArticle

Pant, Mihir ; Towsley, Don ; Englund, Dirk ; Guha, Saikat. / Percolation thresholds for photonic quantum computing. In: Nature communications. 2019 ; Vol. 10, No. 1.
@article{1a49761f8d5740dbaeea7cb8668bc717,
title = "Percolation thresholds for photonic quantum computing",
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, λc(n). We prove a general bound λc(n)≥1∕(n-1), and develop a conceptual method to construct long-range-connected clusters where λ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.",
author = "Mihir Pant and Don Towsley and Dirk Englund and Saikat Guha",
year = "2019",
month = "12",
day = "1",
doi = "10.1038/s41467-019-08948-x",
language = "English (US)",
volume = "10",
journal = "Nature Communications",
issn = "2041-1723",
publisher = "Nature Publishing Group",
number = "1",

}

TY - JOUR

T1 - Percolation thresholds for photonic quantum computing

AU - Pant, Mihir

AU - Towsley, Don

AU - Englund, Dirk

AU - Guha, Saikat

PY - 2019/12/1

Y1 - 2019/12/1

N2 - 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, λc(n). We prove a general bound λc(n)≥1∕(n-1), and develop a conceptual method to construct long-range-connected clusters where λ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.

AB - 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, λc(n). We prove a general bound λc(n)≥1∕(n-1), and develop a conceptual method to construct long-range-connected clusters where λ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.

UR - http://www.scopus.com/inward/record.url?scp=85062585455&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062585455&partnerID=8YFLogxK

U2 - 10.1038/s41467-019-08948-x

DO - 10.1038/s41467-019-08948-x

M3 - Article

C2 - 30842425

AN - SCOPUS:85062585455

VL - 10

JO - Nature Communications

JF - Nature Communications

SN - 2041-1723

IS - 1

M1 - 1070

ER -