Cellular-automaton decoders with provable thresholds for topological codes

Abstract

We propose a new cellular automaton (CA), the Sweep Rule, which generalizes Toom's rule to any locally Euclidean lattice. We use the Sweep Rule to design a local decoder for the toric code in $d\ge 3$ dimensions, the Sweep Decoder, and rigorously establish a lower bound on its performance. We also numerically estimate the Sweep Decoder threshold for the three-dimensional toric code on the cubic and body-centered cubic lattices for phenomenological phase-flip noise. Our results lead to new CA decoders with provable error-correction thresholds for other topological quantum codes including the color code.

arXiv comment4+8 pages, 5 figures

References in corpus (27)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Quantum Error Correction for Quantum Memories
• A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
• Reliable Quantum Computers
• Local stabilizer codes in three dimensions without string logical operators
• Topological Quantum Distillation
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
• Fast Decoders for Topological Quantum Codes
• Quantum memories at finite temperature
• Towards practical classical processing for the surface code
• Quantum memories based on engineered dissipation
• Single-shot fault-tolerant quantum error correction
• Unfolding the color code
• Fault-tolerant error correction with the gauge color code
• Decoding color codes by projection onto surface codes
• Efficient Decoders for Qudit Topological Codes
• Advantages of versatile neural-network decoding for topological codes
• NP-hardness of decoding quantum error-correction codes
• Cellular-automaton decoders for topological quantum memories
• Analysing correlated noise on the surface code using adaptive decoding algorithms
• Three-dimensional color code thresholds via statistical-mechanical mapping
• Proof of finite surface code threshold for matching
• Scalable Neural Network Decoders for Higher Dimensional Quantum Codes
• Fault-Tolerant Quantum Error Correction for non-Abelian Anyons

Cited by in corpus (48)

• Quantum error correction for the toric code using deep reinforcement learning
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Single-shot error correction of three-dimensional homological product codes
• Parallelized quantum error correction with fracton topological codes
• Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
• Decoding algorithms for surface codes
• Improved single-shot decoding of higher dimensional hypergraph product codes
• Symmetry-protected self-correcting quantum memories
• Absolutely Stable Spatiotemporal Order in Noisy Quantum Systems
• Reinforcement learning for optimal error correction of toric codes
• A local pre-decoder to reduce the bandwidth and latency of quantum error correction
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
• Beyond single-shot fault-tolerant quantum error correction
• Deep Q-learning decoder for depolarizing noise on the toric code
• Techniques for combining fast local decoders with global decoders under circuit-level noise
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• General tensor network decoding of 2D Pauli codes
• Generating Fault-Tolerant Cluster States from Crystal Structures
• A four-dimensional toric code with non-Clifford transversal gates
• Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
• Tailoring three-dimensional topological codes for biased noise
• Achieving fault tolerance on capped color codes with few ancillas
• Topological error correcting processes from fixed-point path integrals
• Data-driven decoding of quantum error correcting codes using graph neural networks
• Quantum error correction with fractal topological codes
• Correcting spanning errors with a fractal code
• Quantum cellular automata for quantum error correction and density classification
• Error-rate-agnostic decoding of topological stabilizer codes
• Phase diagram of the three-dimensional subsystem toric code
• Finite-temperature quantum topological order in three dimensions
• Protecting information via probabilistic cellular automata
• Local Probabilistic Decoding of a Quantum Code
• Single-Shot Decoding of Linear Rate LDPC Quantum Codes with High Performance
• Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases
• Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise
• Rescaling decoder for 2D topological quantum color codes on 4.8.8 lattices
• Bounds on Autonomous Quantum Error Correction
• Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
• On the energy barrier of hypergraph product codes
• Single-shot quantum error correction with the three-dimensional subsystem toric code
• Layer codes as partially self-correcting quantum memories
• Exploring the Landscape of Non-Equilibrium Memories with Neural Cellular Automata
• Stabilization of symmetry-protected long-range entanglement in stochastic quantum circuits
• Towards self-correcting quantum codes for neutral atom arrays
• Overflow-Safe Polylog-Time Parallel Minimum-Weight Perfect Matching Decoder: Toward Experimental Demonstration
• Snowflake: A Distributed Streaming Decoder
• Genuine Bistability in Open Quantum Many-Body Systems
• Dissipative quantum North-East-Center model: steady-state phase diagram, universality and nonergodic dynamics