Some new QEC MDS codes with large minimum distance
Lanqiang Li, Fuyin Tian, Ziwen Cao, Li Liu
TL;DR
This paper introduces new quantum error-correcting codes that improve reliability in quantum computing and communication.
Contribution
The paper presents two new classes of QEC MDS codes with unique parameters and larger minimum distance.
Findings
New QEC MDS codes were constructed using generalized Reed–Solomon codes and the Hermitian method.
The proposed codes have distinct parameters and larger minimum distance compared to existing codes of the same length.
Abstract
The advancement of Quantum Error-Correcting (QEC) Maximum Distance Separable (MDS) codes holds substantial importance in practical applications, substantially augmenting the reliability and efficiency of quantum communication and computing. This paper introduces two new classes of QEC MDS codes, which are devised through the utilization of generalized Reed–Solomon (GRS) codes and the Hermitian construction approach. The novelty of our QEC MDS codes lies in their parameters being distinct from all previously reported codes. Moreover, most of our codes possess a considerably greater minimum distance in comparison to existing codes of the same length.
Genes, proteins, chemicals, diseases, species, mutations and cell lines named across the full text — each resolved to its canonical identifier and authoritative record.
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