Papers › Loss-tolerant teleportation on large stabilizer states
Loss-tolerant teleportation on large stabilizer states
Sam Morley-Short, Mercedes Gimeno-Segovia, Terry Rudolph, Hugo Cable
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present a general method for finding loss-tolerant teleportation on large, entangled stabilizer states using only single-qubit measurements, known as \emph{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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections