Entanglement-assisted Quantum MDS Codes from generalized Reed-Solomon Codes
Renjie Jin, Yiran Cao, Jinquan Luo
TL;DR
This paper introduces new entanglement-assisted quantum MDS codes derived from generalized Reed-Solomon codes, offering novel lengths and improved minimum distances over existing codes.
Contribution
The paper presents new classes of EAQMDS codes with unique lengths and enhanced minimum distances, expanding the known code constructions from generalized Reed-Solomon codes.
Findings
Several EAQMDS codes with unprecedented lengths
Codes with larger minimum distances than previous results
New constructions over finite fields of odd characteristic
Abstract
In this paper, we produce some new classes of entanglement-assisted quantum MDS codes(EAQMDS codes for short) via generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many EAQMDS codes with new lengths which have never been reported. Moreover, some of them have larger minimum distance than known results.
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