A cellular automaton decoder for a noise-bias tailored color code

Abstract

Self-correcting quantum memories demonstrate robust properties that can be exploited to improve active quantum error-correction protocols. Here we propose a cellular automaton decoder for a variation of the color code where the bases of the physical qubits are locally rotated, which we call the XYZ color code. The local transformation means our decoder demonstrates key properties of a two-dimensional fractal code if the noise acting on the system is infinitely biased towards dephasing, namely, no string-like logical operators. As such, in the high-bias limit, our local decoder reproduces the behavior of a partially self-correcting memory. At low error rates, our simulations show that the memory time diverges polynomially with system size without intervention from a global decoder, up to some critical system size that grows as the error rate is lowered. Furthermore, although we find that we cannot reproduce partially self-correcting behavior at finite bias, our numerics demonstrate improved memory times at realistic noise biases. Our results therefore motivate the design of tailored cellular automaton decoders that help to reduce the bandwidth demands of global decoding for realistic noise models.

arXiv comment19 pages, 10 figures. v2 fixed error where an incorrect cellular automaton rule was referenced

References in corpus (61)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Superconducting Qubits: Current State of Play
• Fault-tolerant quantum computation with high threshold in two dimensions
• Local stabilizer codes in three dimensions without string logical operators
• Topological Quantum Distillation
• Dynamically protected cat-qubits: a new paradigm for universal quantum computation
• Fracton Topological Order, Generalized Lattice Gauge Theory and Duality
• Quantum Glassiness
• Fractons
• The Kerr-Cat Qubit: Stabilization, Readout, and Gates
• Quantum orders in an exact soluble model
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Repeated Quantum Error Detection in a Surface Code
• Fracton Phases of Matter
• Engineering the quantum states of light in a Kerr-nonlinear resonator by two-photon driving
• Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
• Exotic topological order in fractal spin liquids
• The XZZX Surface Code
• Experimental demonstration of fault-tolerant state preparation with superconducting qubits
• Quantum memories at finite temperature
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Fault-tolerant quantum computation against biased noise
• Glassy quantum dynamics in translation invariant fracton models
• Bias-preserving gates with stabilized cat qubits
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Fault-tolerant quantum error detection
• Repetition Cat Qubits for Fault-Tolerant Quantum Computation
• Quantum memories based on engineered dissipation
• Universal transversal gates with color codes - a simplified approach
• Glassy dynamics and aging in an exactly solvable spin model
• Tailoring surface codes for highly biased noise
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Topological Quantum Glassiness
• Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• Fractal Symmetric Phases of Matter
• On the energy landscape of 3D spin Hamiltonians with topological order
• Glassiness and constrained dynamics of a short-range non-disordered spin model
• Tensor-Network Simulations of the Surface Code under Realistic Noise
• Topological Defect Networks for Fractons of all Types
• Cellular-automaton decoders for topological quantum memories
• Parallelized quantum error correction with fracton topological codes
• Analysing correlated noise on the surface code using adaptive decoding algorithms
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Unconventional Fusion and Braiding of Topological Defects in a Lattice Model
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
• 2-D Compass Codes
• Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
• Linear-time general decoding algorithm for the surface code
• Cellular automaton decoders of topological quantum memories in the fault tolerant setting
• High-threshold topological quantum error correction against biased noise
• Optimal Thresholds for Fracton Codes and Random Spin Models with Subsystem Symmetry
• The XYZ${}^2$ hexagonal stabilizer code
• Hierarchical decoding to reduce hardware requirements for quantum computing
• Information storage capacity of discrete spin systems
• Fractionalization of subsystem symmetries in two dimensions
• Challenges in Scaling-up the Control Interface of a Quantum Computer
• Correcting spanning errors with a fractal code
• A high threshold code for modular hardware with asymmetric noise

Cited by in corpus (11)

• Anyon condensation and the color code
• LDPC-cat codes for low-overhead quantum computing in 2D
• Correcting non-independent and non-identically distributed errors with surface codes
• Data-driven decoding of quantum error correcting codes using graph neural networks
• Decoding quantum color codes with MaxSAT
• The domain wall color code
• Tailoring Dynamical Codes for Biased Noise: The X${}^3$Z${}^3$ Floquet Code
• Magic Mirror on the Wall, How to Benchmark Quantum Error Correction Codes, Overall ?
• Minimising surface-code failures using a color-code decoder
• Generalizing the matching decoder for the Chamon code
• On the interpretability of neural network decoders