Quantum computing with anyons is fault tolerant
Summarize this article with:
Quantum Physics arXiv:2602.11258 (quant-ph) [Submitted on 11 Feb 2026] Title:Quantum computing with anyons is fault tolerant Authors:Anasuya Lyons, Benjamin J. Brown View a PDF of the paper titled Quantum computing with anyons is fault tolerant, by Anasuya Lyons and 1 other authors View PDF HTML (experimental) Abstract:In seminal work (arXiv:quant-ph/9707021) Alexei Kitaev proposed topological quantum computing (arXiv:cond-mat/0010440, arXiv:quant-ph/9707021, arXiv:quant-ph/0001108, arXiv:0707.1889), whereby logic gates of a quantum computer are conducted by creating, braiding and fusing anyonic particles on a two-dimensional plane. Furthermore, he showed the proposal is inherently robust to local perturbations (arXiv:cond-mat/0010440, arXiv:quant-ph/9707021, arXiv:1001.0344, arXiv:1001.4363) when anyons are created as quasiparticle excitations of a topologically ordered lattice model prepared at zero temperature. Over the decades following this proposal there have been considerable technological developments towards the construction of a fault-tolerant quantum computer. Rather than maintaining some target ground state at zero temperature, a modern approach is to actively correct the errors a target state experiences, where we use noisy quantum circuit elements to identify and subsequently correct for deviations from the ideal state. We present an error-correction scheme that enables us to carry out robust universal quantum computation by braiding anyons. We show that our scheme can be carried out on a suitably large device with an arbitrarily small failure rate assuming circuit elements are below some threshold level of local noise. The error-corrected scheme we have developed therefore enables us to carry out fault-tolerant topological quantum computation using modern quantum hardware that is now under development. Comments: Subjects: Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech); Strongly Correlated Electrons (cond-mat.str-el) Cite as: arXiv:2602.11258 [quant-ph] (or arXiv:2602.11258v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2602.11258 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Anasuya Lyons [view email] [v1] Wed, 11 Feb 2026 19:00:01 UTC (2,136 KB) Full-text links: Access Paper: View a PDF of the paper titled Quantum computing with anyons is fault tolerant, by Anasuya Lyons and 1 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-02 Change to browse by: cond-mat cond-mat.stat-mech cond-mat.str-el References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)