Loss-tolerant teleportation on large stabilizer states. (9th April 2019)

• Record Type: Journal Article
• Authors: Morley-Short, Sam; Gimeno-Segovia, Mercedes; Rudolph, Terry; Cable, Hugo
• Is Part Of: Quantum science and technology. Volume 4:Number 2(2019)
• Publication Date: 2019-04-09
• Subjects: quantum teleportation -- loss tolerance -- quantum networks -- stabilizer states -- graph states -- quantum computation -- measurement-base quantum computation; Quantum theory -- Periodicals; Quantum theory; Periodicals; 530
• DOI: 10.1088/2058-9565/aaf6c4
• Languages: English
• ISSNs: 2058-9565

Abstract

Abstract: We present a general method for finding loss-tolerant teleportation on large, entangled stabilizer states using only single-qubit measurements, known as stabilizer pathfinding (SPF). For heralded loss, SPF is shown to generate optimally loss-tolerant measurement patterns on any given stabilizer state. Furthermore, SPF also provides highly loss-tolerant teleportation strategies when qubit loss is unheralded. We provide a fast algorithm for SPF that updates continuously as a state is generated and measured, which is therefore suitable for real-time implementation on a quantum-computing device. When compared to simulations of previous heuristics for loss-tolerant teleportation on graph states, SPF provides considerable gains in tolerance to both heralded and unheralded loss, achieving a near-perfect teleportation rate (>95%) in the regime of low qubit loss (<10%) on various graph state lattices. Using these results we also present evidence that points towards the existence of loss-tolerant thresholds on such states, which in turn indicates that the loss-tolerant behaviour we have found also applies as the number of qubits tends to infinity. Our results represent a significant advance towards the realistic implementation of teleportation in both large-scale and near-future quantum architectures that are susceptible to qubit loss, such as linear optical quantum computation and quantum communication networks.