Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes

Autor:	Leverrier, Anthony, Zémor, Gilles
Rok vydání:	2022
Předmět:	Quantum Physics Computer Science - Computational Complexity Computer Science - Information Theory
Zdroj:	Proceedings of SODA 2023
Druh dokumentu:	Working Paper
Popis:	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 $O(\sqrt{n \log n})$. 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. Comment: 43 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2206.07571 Zobrazit plný text záznamu View this record from Arxiv