New entanglement-assisted quantum MDS codes with length $n=\frac{q^2+1}5$
Shixin Zhu, Wan Jiang, Xiaojing Chen

TL;DR
This paper constructs new entanglement-assisted quantum MDS codes of length (q^2+1)/5 from cyclic codes, offering more flexible parameters and larger minimum distances than previous codes of the same length.
Contribution
It introduces a novel method to construct EAQMDS codes with specific length from cyclic codes, expanding the known parameter sets.
Findings
Codes have larger minimum distances.
Codes exhibit flexible parameters.
Construction method is applicable to a new length.
Abstract
The entanglement-assisted stabilizer formalism can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs). In this work, we construct some new entanglement-assisted quantum MDS (EAQMDS) codes with length from cyclic codes. Compared with all the previously known parameters with the same length, all of them have flexible parameters and larger minimum distance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Coding theory and cryptography · Quantum-Dot Cellular Automata
