Quantum error-correcting codes from projective Reed-Muller codes and their hull variation problem

Abstract

Long quantum codes using projective Reed-Muller codes are constructed. Projective Reed-Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum codes by using the CSS construction and the Hermitian construction, respectively. We provide entanglement-assisted quantum error-correcting codes from projective Reed-Muller codes with flexible amounts of entanglement by considering equivalent codes. Moreover, we also construct quantum codes from subfield subcodes of projective Reed-Muller codes.

References in corpus (13)

• Good Quantum Error-Correcting Codes Exist
• Multiple Particle Interference and Quantum Error Correction
• Correcting Quantum Errors with Entanglement
• Asymmetric quantum error correcting codes
• Entanglement-assisted quantum error-correcting codes over arbitrary finite fields
• How Much Entanglement Does a Quantum Code Need?
• Asymmetric entanglement-assisted quantum error-correcting codes and BCH codes
• On the Minimum Distance, Minimum Weight Codewords, and the Dimension of Projective Reed-Muller Codes
• Improved Gilbert-Varshamov Bound for Entanglement-Assisted Asymmetric Quantum Error Correction by Symplectic Orthogonality
• Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes
• A recursive construction for projective Reed-Muller codes
• Hulls of projective Reed-Muller codes over the projective plane
• Subfield subcodes of projective Reed-Muller codes