MDS, Hermitian Almost MDS, and Gilbert-Varshamov Quantum Codes from Generalized Monomial-Cartesian Codes

Abstract

We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized monomial-Cartesian codes arise from polynomials in $m$ variables. When $m=1$ our codes are MDS, and when $m=2$ and our lower bound for the minimum distance is $3$ the codes are at least Hermitian Almost MDS. For an infinite family of parameters when $m=2$ we prove that our codes beat the Gilbert-Varshamov bound. We also present many examples of our codes that are better than any known code in the literature.

References in corpus (15)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Multiple Particle Interference and Quantum Error Correction
• A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
• Quantum Error Correction and Orthogonal Geometry
• Simple Quantum Error Correcting Codes
• On optimal quantum codes
• Asymptotically Good Quantum Codes
• On the Construction of Nonbinary Quantum BCH Codes
• New Quantum Codes from Evaluation and Matrix-Product Codes
• How Much Entanglement Does a Quantum Code Need?
• On the distance of stabilizer quantum codes from $J$-affine variety codes
• Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
• Improved constructions of nested code pairs
• Stabilizer quantum codes defined by trace-depending polynomials
• Optimal $(r,\delta )$-LRCs from monomial-Cartesian codes and their subfield-subcodes

Cited by in corpus (1)

• New Quantum MDS Codes with Flexible Parameters from Hermitian Self-Orthogonal GRS Codes