Quantum LDPC Codes With Almost Linear Minimum Distance

DOI10.1109/TIT.2021.3119384MaRDI QIDQ5030280zbMATH OpenOpenAlexFDO

Authors Pavel A. Panteleev, G. V. Kalachev

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

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

Abstract: We give a construction of quantum LDPC codes of dimension $Theta(logN)$ and distance $Theta(N/logN)$ as the code length $Noinfty$. Using a product of chain complexes this construction also provides a family of quantum LDPC codes of distance $Omega(N^{1-alpha/2}/logN)$ and dimension $Omega(N^{a}lphalogN)$, where $0lealpha<1$. We also introduce and study a new operation called lifted product, which naturally generalizes the product operations for quantum codes and chain complexes. Moreover, as a simple byproduct of our results on quantum codes, we obtain a new result on classical codes. We show that for any fixed $R<1$ there exists an asymptotically good family of classical quasi-cyclic LDPC codes of rate at least $R$ with, in some sense, optimal circulant size $Omega(N/logN)$ as the code length $Noinfty$.

Cited in

(19)

• A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory
• Quantum codes of minimum distance two
• Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
• Distance Verification for Classical and Quantum LDPC Codes
• 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
• Error-correcting codes for fermionic quantum simulation
• Girth analysis of quantum quasi-cyclic LDPC codes
• Systolic almost-rigidity modulo 2
• Neural network-based decoding for bias-tailored quantum codes over quantum channels with asymmetric noise
• Dihedral quantum codes
• Coboundary and cosystolic expansion without dependence on dimension or degree
• When can an expander code correct (n) errors in O(n) time?
• The school of V. B. Kudryavtsev at the chair of mathematical theory of intelligent systems: traditions and development
• Quantum error correction in Kitaev's quantum double model for abelian groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030280)