Percolation thresholds for photonic quantum computing
Name
s41467-019-08948-x.pdf
Description
Published version
Size
2.51 MB
Format
Adobe PDF
Checksum (MD5)
0b791a0cf6c251ed9837c9e57c00ce13
Author(s)
Pant, Mihir
Englund, Dirk
Guha, Saikat
Date Issued
March 6, 2019
Journal
Nature communications
Publisher
Springer Science and Business Media LLC
Citation
Pant, Mihir et al. "Percolation thresholds for photonic quantum computing." Nature communications 10 (2019): 1038 © 2019 The Author(s)
Version
Final published version
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.
Subjects
General Biochemistry, Genetics and Molecular Biology
General Physics and Astronomy
General Chemistry
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1038/s41467-019-08948-x
