Conservation laws and quantum error correction: towards a generalised matching decoder
arXiv:2207.06428 · doi:10.1109/MBITS.2023.3246025
Abstract
Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the leading efforts to demonstrate scalable quantum computing. Central to our discussion is the minimum-weight perfect-matching decoder. The decoder works by exploiting underlying structure that arises due to materialised symmetries among surface-code stabilizer elements. By concentrating on these symmetries, we begin to address the question of how a minimum-weight perfect-matching decoder might be generalised for other families of codes. We approach this question first by investigating examples of matching decoders for other codes. These include decoding algorithms that have been specialised to correct for noise models that demonstrate a particular structure or bias with respect to certain codes. In addition to this, we propose a systematic way of constructing a minimum-weight perfect-matching decoder for codes with certain characteristic properties. The properties we make use of are common among topological codes. We discuss the broader applicability of the proposal, and we suggest some questions we can address that may show us how to design a generalised matching decoder for arbitrary stabilizer codes.
arXiv commentPerspective article; 11 pages, 7 figures, comments welcome; v2 - manuscript revised in response to referee reports. 1 new figure
References in corpus (33)
- Fault-tolerant quantum computation by anyons
- Anyons in an exactly solved model and beyond
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- String-net condensation: A physical mechanism for topological phases
- Local stabilizer codes in three dimensions without string logical operators
- Topological Quantum Distillation
- Fracton Topological Order, Generalized Lattice Gauge Theory and Duality
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Quantum Low-Density Parity-Check Codes
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- The XZZX Surface Code
- Fast Decoders for Topological Quantum Codes
- Degenerate Quantum LDPC Codes With Good Finite Length Performance
- Almost-linear time decoding algorithm for topological codes
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Decoding Across the Quantum LDPC Code Landscape
- Correcting coherent errors with surface codes
- Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
- Statistical mechanical models for quantum codes with correlated noise
- Error Correction and Degeneracy in Surface Codes Suffering Loss
- Tensor-Network Simulations of the Surface Code under Realistic Noise
- Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
- An efficient Markov chain Monte Carlo algorithm for the surface code
- Parallelized quantum error correction with fracton topological codes
- Analysing correlated noise on the surface code using adaptive decoding algorithms
- Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- Decoding non-Abelian topological quantum memories
- Thermalization, Error-Correction, and Memory Lifetime for Ising Anyon Systems
- A decoder for the triangular color code by matching on a Möbius strip
- The XYZ hexagonal stabilizer code
- Correcting spanning errors with a fractal code
- Comparison of 2D topological codes and their decoding performances
Cited by in corpus (12)
- Sparse Blossom: correcting a million errors per core second with minimum-weight matching
- Anyon condensation and the color code
- Perturbative stability and error correction thresholds of quantum codes
- Designing fault-tolerant circuits using detector error models
- XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
- Quantum codes for asymmetric channels: ZZZY surface codes
- The domain wall color code
- Single-shot and measurement-based quantum error correction via fault complexes
- On the Efficacy of Surface Codes in Compensating for Radiation Events in Superconducting Devices
- Minimising surface-code failures using a color-code decoder
- Generalizing the matching decoder for the Chamon code
- Mitigating Temporal Fragility in the XY Surface Code