Quantum LDPC Codes With Almost Linear Minimum Distance

DOI10.1109/TIT.2021.3119384zbMath1489.94162arXiv2012.04068OpenAlexW3206809046MaRDI QIDQ5030280

G. V. Kalachev, Pavel A. Panteleev

Publication date: 17 February 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.04068

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Cyclic codes (94B15) Quantum coding (general) (81P70)

Related Items (7)

A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory ⋮ Single-shot decoding of good quantum LDPC codes ⋮ Theory behind quantum error correcting codes: an overview ⋮ Homological quantum rotor codes: logical qubits from torsion ⋮ Local and global expansion in random geometric graphs ⋮ Good quantum LDPC codes with linear time decoders ⋮ NLTS Hamiltonians from good quantum codes

This page was built for publication: Quantum LDPC Codes With Almost Linear Minimum Distance