New Quantum Codes from CSS Codes

Abstract

We present a new propagation rule for CSS codes. Starting with a CSS code $[[n,k,d]{]}_q$, we construct a CSS code with parameters $[[n-2,k,d-1]{]}_q$. In general, one would only obtain a code with parameters $[[n-2,k,d-2]{]}_q$. The construction applies to asymmetric quantum codes from the CSS construction as well.

arXiv comment10 pages, 3 tables; v2: added reference to work related by La Guardia, examples for qutrit codes, corrected typos

References in corpus (7)

• Good Quantum Error-Correcting Codes Exist
• A Theory of Fault-Tolerant Quantum Computation
• Simple Quantum Error Correcting Codes
• Asymmetric quantum error correcting codes
• NP-hardness of decoding quantum error-correction codes
• Algebraic Quantum Codes: Linking Quantum Mechanics and Discrete Mathematics
• New quantum codes from self-dual codes over F_4

Cited by in corpus (4)

• Structure of CSS and CSS-T Quantum Codes
• An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance
• Puncturing Quantum Stabilizer Codes
• Steane enlargement of Entanglement-Assisted Quantum Error-Correcting Codes