TY - JOUR
T1 - Percolation thresholds for photonic quantum computing
AU - Pant, Mihir
AU - Towsley, Don
AU - Englund, Dirk
AU - Guha, Saikat
N1 - Funding Information:
MP, DE, and SG acknowledge support from the DARPA seedling project Scalable Engineering of Quantum Optical Information Processing Architectures (SEQUOIA), under US Army contract number W31P4Q-15-C-0045. MP and DE acknowledge support from the Air Force Office of Scientific Research MURI (FA9550-14-1-0052). SG acknowledges support from the Office of Naval Research MURI on Optical Computing under US Navy contract number N00014-16-C-2069. MP, DE, and SG acknowledge extremely valuable discussions with Terry Rudolph, Pete Shadbolt, and Mercedes Gimeno-Segovia during their visit to Boston in April 2016, which was partially supported by the MIT-Imperial College London Seed Fund.
Publisher Copyright:
© 2019, The Author(s).
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 -