Stabilizer quantum codes defined by trace-depending polynomials
arXiv:2208.06187 · doi:10.1016/j.ffa.2022.102138
Abstract
Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace. In this paper, we propose to evaluate polynomials at the roots of trace-depending polynomials (given by a constant plus the trace of a polynomial) and show that this procedure gives rise to stabilizer quantum error-correcting codes with a wider range of lengths than in other papers involving roots of the trace and with excellent parameters. Namely, we are able to provide new binary records and non-binary codes improving the ones available in the literature.
References in corpus (12)
- 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
- Resilient Quantum Computation: Error Models and Thresholds
- On the Construction of Nonbinary Quantum BCH Codes
- Fault-Tolerant Logical Gate Networks for CSS Codes
- Stabilizer quantum codes from -affine variety codes and a new Steane-like enlargement
- On the distance of stabilizer quantum codes from -affine variety codes
- Constructing quantum error-correcting codes for p^m-state systems from classical error-correcting codes
- Classical and Quantum Evaluation Codes at the Trace Roots
- On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes