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 [14]. Our bound is exponential, improving on the quadratic bound of Couvreur, Delfosse and Zémor [3]. This result is obtained by examining a family of subsets of the hypercube which locally satisfy some parity conditions. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Delfosse, N., Li, Z., & Thomassé, S. (2014). A note on the minimum distance of quantum LDPC codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8635 LNCS, pp. 239–250). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
