New constructions of CSS codes obtained by moving to higher alphabets

Abstract

We generalize a construction of non-binary quantum LDPC codes over $\F_{2^m}$ due to \cite{KHIS11a} and apply it in particular to toric codes. We obtain in this way not only codes with better rates than toric codes but also improve dramatically the performance of standard iterative decoding. Moreover, the new codes obtained in this fashion inherit the distance properties of the underlying toric codes and have therefore a minimum distance which grows as the square root of the length of the code for fixed $m$.

9 pages, 9 figures, full version of a paper submitted to the IEEE Symposium on Information Theory

References in corpus (10)

• Fault-tolerant quantum computation by anyons
• Good Quantum Error-Correcting Codes Exist
• Sparse Graph Codes for Quantum Error-Correction
• Quantum codes on a lattice with boundary
• Fast Decoders for Topological Quantum Codes
• Asymmetric quantum error correcting codes
• Entanglement-Assisted Quantum Quasi-Cyclic Low-Density Parity-Check Codes
• Asymmetric Quantum LDPC Codes
• A Proposed Quantum Low Density Parity Check Code
• Constructions and performance of classes of quantum LDPC codes

Cited by in corpus (3)

• Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes
• Linked-Cluster Technique for Finding the Distance of a Quantum LDPC Code
• Distance verification for classical and quantum LDPC codes