.png){kind=icon}
.png){kind=icon}
Return
Percolation thresholds for photonic quantum computing
.png){kind=icon}
OA
AI
DOI：10.1038/s41467-019-08948-x.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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, lambda((n))(c). We prove a general bound lambda((n))(c) >= 1/(n - 1), and develop a conceptual method to construct long-range-connected clusters where lambda((n))(c) 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.
Keywords:
COMPUTATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
15.7
Papers:
9.3W
Citations:
91.2W