Percolation thresholds for photonic quantum computing.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 30842425.
- Also identified by DOI 10.1038/s41467-019-08948-x and PMC identifier 6403388.
- Licence recorded as CC BY.
- The licence permits redistribution, so the abstract is shown in full and the full text is available from the publisher.
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, [Formula: see text]. We prove a general bound [Formula: see text], and develop a conceptual method to construct long-range-connected clusters where [Formula: see text] 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.