Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
From MaRDI portal
Publication:6402186
DOI10.1137/1.9781611977554.CH45arXiv2206.07571OpenAlexW4316652411MaRDI QIDQ6402186FDOQ6402186
Authors: Anthony Leverrier, Gilles Zémor 
Publication date: 15 June 2022
Abstract: We introduce and analyse an efficient decoder for the quantum Tanner codes of that can correct adversarial errors of linear weight. Previous decoders for quantum low-density parity-check codes could only handle adversarial errors of weight . We also work on the link between quantum Tanner codes and the Lifted Product codes of Panteleev and Kalachev, and show that our decoder can be adapted to the latter. The decoding algorithm alternates between sequential and parallel procedures and converges in linear time.
Full work available at URL: https://doi.org/10.1137/1.9781611977554.ch45
This page was built for publication: Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402186)
