Percolation thresholds for photonic quantum computing

Mihir Pant, Don Towsley, Dirk Englund, Saikat Guha

Research output: Contribution to journalArticle

4 Scopus citations

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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Percolation thresholds for photonic quantum computing'. Together they form a unique fingerprint.

  • Cite this