{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/loss-tolerant-teleportation-on-large","title":"Loss-tolerant teleportation on large stabilizer states","arxiv_id":"1807.08729","date":"2018-07-23","proceeding":null,"authors":["Sam Morley-Short","Mercedes Gimeno-Segovia","Terry Rudolph","Hugo Cable"],"abstract":"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.","url_abs":"http://arxiv.org/abs/1807.08729v1","url_pdf":"http://arxiv.org/pdf/1807.08729v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"loss-tolerant-teleportation-on-large","repo_url":"https://github.com/sammorley-short/spf","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}