Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
arXiv:2004.07247 · doi:10.1038/s41598-021-81138-2
Abstract
We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, however, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We also numerically benchmark the performance of the decoder in the setting with measurement errors using various noise models. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model. Our work constitutes a step towards finding simple and high-performance decoding strategies for a wide range of quantum low-density parity-check codes.
arXiv comment16 pages, 10 figures, v2: published version
References in corpus (48)
- Fault-tolerant quantum computation by anyons
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Topological quantum memory
- Quantum Error Correction for Quantum Memories
- Reliable Quantum Computers
- Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- Roads towards fault-tolerant universal quantum computation
- Entanglement Distillation between Solid-State Quantum Network Nodes
- A fault-tolerant one-way quantum computer
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Fast Decoders for Topological Quantum Codes
- Quantum memories at finite temperature
- Almost-linear time decoding algorithm for topological codes
- From three-photon GHZ states to ballistic universal quantum computation
- Topological Computation without Braiding
- Quantum memories based on engineered dissipation
- Single-shot fault-tolerant quantum error correction
- Classification of topologically protected gates for local stabilizer codes
- Unfolding the color code
- Universal transversal gates with color codes - a simplified approach
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Fault-tolerant logical gates in quantum error-correcting codes
- A theory of single-shot error correction for adversarial noise
- Phase Structure of the Random-Plaquette Z_2 Gauge Model: Accuracy Threshold for a Toric Quantum Memory
- Advantages of versatile neural-network decoding for topological codes
- Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
- A fault-tolerant non-Clifford gate for the surface code in two dimensions
- Cellular-automaton decoders with provable thresholds for topological codes
- Cellular-automaton decoders for topological quantum memories
- Three-dimensional color code thresholds via statistical-mechanical mapping
- Scalable Neural Network Decoders for Higher Dimensional Quantum Codes
- The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
- Higher-dimensional quantum hypergraph-product codes
- Locality-Preserving Logical Operators in Topological Stabiliser Codes
- Magnetic-glassy multicritical behavior of the three-dimensional +- J Ising model
- Cellular automaton decoders of topological quantum memories in the fault tolerant setting
- Fault-Tolerant Quantum Error Correction for non-Abelian Anyons
- 2D quantum computation with 3D topological codes
- Renormalization group decoder for a four-dimensional toric code
- An Introduction to Topological Quantum Codes
- Collective excitations of a trapped Fermi gas at finite temperature
- A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing
- Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
- Measurement based fault tolerance beyond foliation
Cited by in corpus (29)
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- Decoding algorithms for surface codes
- Improved single-shot decoding of higher dimensional hypergraph product codes
- Absolutely Stable Spatiotemporal Order in Noisy Quantum Systems
- A local pre-decoder to reduce the bandwidth and latency of quantum error correction
- Techniques for combining fast local decoders with global decoders under circuit-level noise
- Efficient color code decoders in dimensions from toric code decoders
- General tensor network decoding of 2D Pauli codes
- Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
- A four-dimensional toric code with non-Clifford transversal gates
- Tailoring three-dimensional topological codes for biased noise
- Tensor Network Decoding Beyond 2D
- Achieving fault tolerance on capped color codes with few ancillas
- Quantum error correction with fractal topological codes
- Stable Symmetry-Protected Topological Phases in Systems with Heralded Noise
- Quantum cellular automata for quantum error correction and density classification
- Local Probabilistic Decoding of a Quantum Code
- Phase diagram of the three-dimensional subsystem toric code
- Protecting information via probabilistic cellular automata
- Single-shot and measurement-based quantum error correction via fault complexes
- 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
- Equivariant Machine Learning Decoder for 3D Toric Codes
- Genuine Bistability in Open Quantum Many-Body Systems
- Overflow-Safe Polylog-Time Parallel Minimum-Weight Perfect Matching Decoder: Toward Experimental Demonstration
- Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers
- Dissipative quantum North-East-Center model: steady-state phase diagram, universality and nonergodic dynamics