Quantum LDPC Codes With Almost Linear Minimum Distance

We give a construction of quantum LDPC codes of dimension <inline-formula> <tex-math notation="LaTeX">\Theta (\log N) </tex-math></inline-formula> and distance <inline-formula> <tex-math notation="LaTeX">\Theta (N/\log N) </tex-math></...

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 68; no. 1; pp. 213 - 229
Main Authors:	Panteleev, Pavel, Kalachev, Gleb
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.01.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Binary system chain complex Chains Codecs Codes CSS code Graph theory hypergraph product code Low density parity check codes Parity check codes Product codes quantum LDPC Quantum mechanics quasi-cyclic (QC) LDPC Sparse matrices
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!