A note on the minimum distance of quantum LDPC codes
arXiv:1404.6441 · doi:10.1007/978-3-662-44465-8_21
Abstract
We provide a new lower bound on the minimum distance of a family of quantum LDPC codes based on Cayley graphs proposed by MacKay, Mitchison and Shokrollahi. Our bound is exponential, improving on the quadratic bound of Couvreur, Delfosse and Zémor. This result is obtained by examining a family of subsets of the hypercube which locally satisfy some parity conditions.