Decoding quantum Tanner codes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Information Theory Année : 2022

Decoding quantum Tanner codes

Résumé

We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a family of asymptotically good quantum lowdensity parity-check codes. In this case, our decoders provably correct arbitrary errors of weight linear in the code length, respectively in linear or logarithmic time. The same decoders are easily adapted to the expander lifted product codes of Panteleev and Kalachev. Along the way, we exploit recently established bounds on the robustness of random tensor codes to give a tighter bound on the minimum distance of quantum Tanner codes.
Fichier principal
Vignette du fichier
2208.05537-8.pdf (351.16 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité

Dates et versions

hal-04277199 , version 1 (09-11-2023)

Licence

Paternité

Identifiants

Citer

Anthony Leverrier, Gilles Zémor. Decoding quantum Tanner codes. IEEE Transactions on Information Theory, 2022, 69 (8), pp.5100-5115. ⟨10.1109/TIT.2023.3267945⟩. ⟨hal-04277199⟩
19 Consultations
20 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More