Single-Shot Decoding of Linear Rate LDPC Quantum Codes With High Performance
From MaRDI portal
Publication:5030286
DOI10.1109/TIT.2021.3122352zbMATH Open1489.94173arXiv2001.03568OpenAlexW3210923590MaRDI QIDQ5030286FDOQ5030286
Authors: Nikolas P. Breuckmann, Vivien Londe 
Publication date: 17 February 2022
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2001.03568
decoding schemesdistance scalinglinear encoding ratelow-density parity check (LDPC) quantum codeslower bound on encoding rate
Cited In (1)
This page was built for publication: Single-Shot Decoding of Linear Rate LDPC Quantum Codes With High Performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030286)
