Back to News
quantum-computing

Local decoder for the toric code with a high pseudo-threshold

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
A new local decoder for Kitaev’s toric code, the 2D signal-rule, replaces centralized error correction with a distributed architecture using simple, local update rules to interpret stabilizer defects as interacting via binary signals. Numerical evidence shows exponential suppression of logical errors below a critical error rate, even with data and measurement noise between iterations, under a phenomenological noise model. The decoder achieves near-optimal scaling for practical system sizes, halving the threshold gap (log scale) with state-of-the-art decoders, which previously suffered suboptimal performance and scaling limitations. This breakthrough enables realistic two-dimensional local quantum memory, addressing hardware constraints in centralized processing by leveraging fully distributed, real-time error correction. The work bridges quantum physics, statistical mechanics, and cellular automata, offering a hardware-efficient path toward scalable fault-tolerant quantum computing.
Local decoder for the toric code with a high pseudo-threshold

Summarize this article with:

Quantum Physics arXiv:2603.02328 (quant-ph) [Submitted on 2 Mar 2026] Title:Local decoder for the toric code with a high pseudo-threshold Authors:Louis Paletta View a PDF of the paper titled Local decoder for the toric code with a high pseudo-threshold, by Louis Paletta View PDF HTML (experimental) Abstract:Local decoders provide a promising approach to real-time quantum error-correction by replacing centralized classical processing, with significant hardware constraints, by a fully distributed architecture based on a simple, local update rule. We propose a new local decoder for Kitaev's toric code: the 2D signal-rule, that interprets odd parity stabilizer measurements as defects, attracted to each other via the exchange of binary signals. We present numerical evidence of exponential logical error suppression with system size below some critical error rate, under a phenomenological noise model, with data and measurement errors between each iteration. Compared to previously known local decoders, which exhibit suboptimal thresholds and scaling, our construction halves (in log scale) the threshold gap with state-of-the-art decoders, and achieves optimal scaling for experimentally relevant system sizes, enabling the practical realization of a two-dimensional local quantum memory. Subjects: Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech); Cellular Automata and Lattice Gases (nlin.CG) Cite as: arXiv:2603.02328 [quant-ph] (or arXiv:2603.02328v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.02328 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Louis Paletta [view email] [v1] Mon, 2 Mar 2026 19:00:24 UTC (787 KB) Full-text links: Access Paper: View a PDF of the paper titled Local decoder for the toric code with a high pseudo-threshold, by Louis PalettaView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 Change to browse by: cond-mat cond-mat.stat-mech nlin nlin.CG 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?)

Read Original

Tags

quantum-networking
quantum-error-correction

Source Information

Source: arXiv Quantum Physics