Quantum LDPC Codes with Almost Linear Minimum Distance

Pavel Panteleev, Gleb Kalachev

We give a construction of quantum LDPC codes of dimension $\Theta (\log N)$ and distance $\Theta (N/\log N)$ as the code length $N\to \infty$. Using a product of chain complexes this constructi…