Single-Shot Decoding of Linear Rate LDPC Quantum Codes with High Performance
arXiv:2001.03568 · doi:10.1109/TIT.2021.3122352
Abstract
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear encoding rate, polynomial scaling distance and efficient decoding schemes. The code family is based on tessellations of closed, four-dimensional, hyperbolic manifolds, as first suggested by Guth and Lubotzky. The main contribution of this work is the construction of suitable manifolds via finite presentations of Coxeter groups, their linear representations over Galois fields and topological coverings. We establish a lower bound on the encoding rate~k/n of~13/72 = 0.180... and we show that the bound is tight for the examples that we construct. Numerical simulations give evidence that parallelizable decoding schemes of low computational complexity suffice to obtain high performance. These decoding schemes can deal with syndrome noise, so that parity check measurements do not have to be repeated to decode. Our data is consistent with a threshold of around 4% in the phenomenological noise model with syndrome noise in the single-shot regime.
arXiv comment15 pages, 6 figures
References in corpus (19)
- Topological quantum memory
- Quantum Error Correction for Quantum Memories
- Quantum codes on a lattice with boundary
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Quantum Low-Density Parity-Check Codes
- Fast Decoders for Topological Quantum Codes
- Degenerate Quantum LDPC Codes With Good Finite Length Performance
- Single-shot fault-tolerant quantum error correction
- Constructions and Noise Threshold of Hyperbolic Surface Codes
- Statistical mechanical models for quantum codes with correlated noise
- Homological Error Correction: Classical and Quantum Codes
- Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
- Cellular-automaton decoders with provable thresholds for topological codes
- Quantum error-correcting codes and 4-dimensional arithmetic hyperbolic manifolds
- Tradeoffs for reliable quantum information storage in surface codes and color codes
- Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
- Numerical study of hypergraph product codes
- Golden codes: quantum LDPC codes built from regular tessellations of hyperbolic 4-manifolds
- Weight Reduction for Quantum Codes