On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes

Abstract

Many $q$-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal $q^2$-ary linear codes. This result can be generalized to $q^{2m}$-ary linear codes, $m>1$. We give a result for easily obtaining quantum codes from that generalization. As a consequence we provide several new binary stabilizer quantum codes which are records according to \cite{codet} and new $q$-ary ones, with $q\ne 2$, improving others in the literature.

References in corpus (16)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Good Quantum Error-Correcting Codes Exist
• A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
• Reliable Quantum Computers
• Quantum Error Correction and Orthogonal Geometry
• Roads towards fault-tolerant universal quantum computation
• Simple Quantum Error Correcting Codes
• Resilient Quantum Computation: Error Models and Thresholds
• On optimal quantum codes
• Fault-Tolerant Quantum Computation with Higher-Dimensional Systems
• On the Construction of Nonbinary Quantum BCH Codes
• Fault-Tolerant Logical Gate Networks for CSS Codes
• New Quantum Codes from Evaluation and Matrix-Product Codes
• Stabilizer quantum codes from $J$-affine variety codes and a new Steane-like enlargement
• Quantum codes from affine variety codes and their subfield-subcodes
• Classical and Quantum Evaluation Codes at the Trace Roots

Cited by in corpus (3)

• Quantum $(r,\delta )$-locally recoverable codes
• Stabilizer quantum codes defined by trace-depending polynomials
• Steane enlargement of Entanglement-Assisted Quantum Error-Correcting Codes