Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2406.10629 · AIMS Mathematics

$ m $-QMDS codes over mixed alphabets via orthogonal arrays

Mengqian Chen, Shanqi Pang, Rong Yan, Yan Mei Zhu

Published Jan 1, 2026• 0 citations
arXivHTMLPDF

Abstract

The construction of quantum error-correcting codes (QECCs) with good parameters is a hot topic in the area of quantum information and quantum computing. Quantum maximum distance separable (MDS) codes are optimal because the minimum distance cannot be improved for given length, dimension, and alphabet sizes. Quantum MDS codes over mixed alphabets are scarcely studied, and even the existence and construction of QECCs over mixed alphabets with a minimum distance of at least three remain an open question. In this paper, we define an $ m $-QMDS code over mixed alphabets, which is a generalization of quantum MDS (QMDS) codes. We establish a relation between such codes and asymmetric orthogonal arrays with orthogonal partitions. This relation is used for the construction of $ m $-QMDS codes with varying local dimension, length, and minimum distance. As applications of this method, numerous infinite families of $ m $-QMDS codes over mixed alphabets can be constructed explicitly. The constructed codes not only have more flexibility in the choice of parameters than other models but also possess better error correction capability and encoding efficiency.

DOI
10.3934/math.20261390

Related papers

Near MDS and near quantum MDS codes via orthogonal arrays

Shanqi Pang, Chaomeng Zhang, Mengqian Chen +1 more

Abstract Near maximum distance separable (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using symmetrical orthogonal arrays (OAs), we construct a lot of NMDS, m-MDS and almost extremal NMDS codes. Quantum error-correcting codes (QECCs) play a central role in quantum information processing and can protect quantum information from various quantum noises. We present a general method for constructing QECCs over mixed alphabets through asymmetrical OAs. Since quantum maximum distance separable (QMDS) codes over mixed alphabets with the dimension equal to one have not been found in all the literature so far, the definition of a near QMDS code over mixed alphabets is proposed. By using asymmetrical OAs, we obtain many such codes.

arXiv:2308.00406•Quantum Science and Technology•Mar 12, 2024•8 citations

Quantum Error-Correcting Codes Based on Orthogonal Arrays

Rong Yan, Shanqi Pang, Mengqian Chen +1 more

In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes ((N,K,d+1))s and orthogonal arrays with orthogonal partitions. Therefore, this is a generalization of the relation between quantum error-correcting codes ((N,1,d+1))s and irredundant orthogonal arrays. This relation is used for the construction of pure quantum error-correcting codes. As applications of this method, numerous infinite families of optimal quantum codes can be constructed explicitly such as ((3,s,2))s for all si≥3, ((4,s2,2))s for all si≥5, ((5,s,3))s for all si≥4, ((6,s2,3))s for all si≥5, ((7,s3,3))s for all si≥7, ((8,s2,4))s for all si≥9, ((9,s3,4))s for all si≥11, ((9,s,5))s for all si≥9, ((10,s2,5))s for all si≥11, ((11,s,6))s for all si≥11, and ((12,s2,6))s for all si≥13, where s=s1⋯sn and s1,…,sn are all prime powers. The advantages of our approach over existing methods lie in the facts that these results are not just existence results, but constructive results, the codes constructed are pure, and each basis state of these codes has far less terms. Moreover, the above method developed can be extended to construction of quantum error-correcting codes over mixed alphabets.

Entropy•Apr 19, 2023•4 citations

Quantum MDS codes over small fields

Markus Grassl, Martin Roetteler

We consider quantum MDS (QMDS) codes for quantum systems of dimension q with lengths up to q2+ 2 and minimum distances up to q + 1. We show how starting from QMDS codes of length q2+ 1 based on cyclic and constacyclic codes, new QMDS codes can be obtained by shortening. We provide numerical evidence for our conjecture that almost all admissible lengths, from a lower bound n0(q, d) on, are achievable by shortening. Some additional codes that fill gaps in the list of achievable lengths are presented as well along with a construction of a family of QMDS codes of length q2+2, where q = 2m, that appears to be new.

arXiv:1502.05267•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•80 citations

Quantum Codes of Maximal Distance and Highly Entangled Subspaces

Felix Huber, Markus Grassl

We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length n of all QMDS codes with local dimension D and distance d ≥ 3 is bounded by n ≤ D 2 + d − 2 . We obtain their weight distribution and present additional bounds that arise from Rains' shadow inequalities. Our main result can be seen as a generalization of bounds that are known for the two special cases of stabilizer QMDS codes and absolutely maximally entangled states, and confirms the quantum MDS conjecture in the special case of distance-three codes. As the existence of QMDS codes is linked to that of highly entangled subspaces (in which every vector has uniform r -body marginals) of maximal dimension, our methods directly carry over to address questions in multipartite entanglement.

arXiv:1907.07733•Quantum•Jun 18, 2020•67 citations

Quantum Error Correction

Ping Dong, Jinsoo Kim

We consider quantum error-correcting codes over alphabets of arbitrary size. We generalize quantum stabilizer codes and develop Calderbank-Shor-Steane construction over quantum systems of arbitrary dimensions using the group structure of alphabets. We also develop a methodology systematically conjoining error-correcting codes into a new class of error-correcting codes. With the help of these methods we give several ways to construct quantum maximum distance separable (MDS) codes and present many families of quantum MDS codes.

•Jul 6, 2005•0 citations

New Families of Asymmetric Quantum MDS Codes via Affine and Projective Partitions

Sami Alabiad, Shayea Aldossari

We construct three new families of asymmetric quantum MDS codes from nested Hermitian self-orthogonal generalized Reed–Solomon and extended generalized Reed–Solomon codes over Fq2. The construction is developed in three settings: affine partitions of Fq2, projective norm partitions of Fq2*, and extended affine configurations obtained by adjoining the point at infinity. In each case, the Hermitian orthogonality conditions are reduced to explicit linear systems over Fq, whose solvability follows from structured moment identities and Vandermonde-type arguments. This yields nested classical MDS codes satisfying the Hermitian dual-containment condition required in the Hermitian construction of asymmetric quantum codes. As a consequence, we obtain three explicit families of asymmetric quantum MDS codes with fully determined lengths, dimensions, and asymmetric distances dz and dx. Our results show that affine and projective partition techniques provide a natural and effective framework for constructing optimal asymmetric quantum codes with flexible parameters.

Mathematics•May 8, 2026•1 citation
The construction of quantum error-correcting codes (QECCs) with good parameters is a hot topic in the area of quantum information and quantum computing. Quantum maximum distance separable (MDS) codes are optimal because the minimum distance cannot be improved for given length, dimension, and alphabet sizes. Quantum MDS codes over mixed alphabets are scarcely studied, and even the existence and construction of QECCs over mixed alphabets with a minimum distance of at least three remain an open question. In this paper, we define an mmm-QMDS code over mixed alphabets, which is a generalization of quantum MDS (QMDS) codes. We establish a relation between such codes and asymmetric orthogonal arrays with orthogonal partitions. This relation is used for the construction of mmm-QMDS codes with varying local dimension, length, and minimum distance. As applications of this method, numerous infinite families of mmm-QMDS codes over mixed alphabets can be constructed explicitly. The constructed codes not only have more flexibility in the choice of parameters than other models but also possess better error correction capability and encoding efficiency.
Abstract Near maximum distance separable (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using symmetrical orthogonal arrays (OAs), we construct a lot of NMDS, m-MDS and almost extremal NMDS codes. Quantum error-correcting codes (QECCs) play a central role in quantum information processing and can protect quantum information from various quantum noises. We present a general method for constructing QECCs over mixed alphabets through asymmetrical OAs. Since quantum maximum distance separable (QMDS) codes over mixed alphabets with the dimension equal to one have not been found in all the literature so far, the definition of a near QMDS code over mixed alphabets is proposed. By using asymmetrical OAs, we obtain many such codes.
In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes ((N,K,d+1))s and orthogonal arrays with orthogonal partitions. Therefore, this is a generalization of the relation between quantum error-correcting codes ((N,1,d+1))s and irredundant orthogonal arrays. This relation is used for the construction of pure quantum error-correcting codes. As applications of this method, numerous infinite families of optimal quantum codes can be constructed explicitly such as ((3,s,2))s for all si≥3, ((4,s2,2))s for all si≥5, ((5,s,3))s for all si≥4, ((6,s2,3))s for all si≥5, ((7,s3,3))s for all si≥7, ((8,s2,4))s for all si≥9, ((9,s3,4))s for all si≥11, ((9,s,5))s for all si≥9, ((10,s2,5))s for all si≥11, ((11,s,6))s for all si≥11, and ((12,s2,6))s for all si≥13, where s=s1⋯sn and s1,…,sn are all prime powers. The advantages of our approach over existing methods lie in the facts that these results are not just existence results, but constructive results, the codes constructed are pure, and each basis state of these codes has far less terms. Moreover, the above method developed can be extended to construction of quantum error-correcting codes over mixed alphabets.
We consider quantum MDS (QMDS) codes for quantum systems of dimension q with lengths up to q2+ 2 and minimum distances up to q + 1. We show how starting from QMDS codes of length q2+ 1 based on cyclic and constacyclic codes, new QMDS codes can be obtained by shortening. We provide numerical evidence for our conjecture that almost all admissible lengths, from a lower bound n0(q, d) on, are achievable by shortening. Some additional codes that fill gaps in the list of achievable lengths are presented as well along with a construction of a family of QMDS codes of length q2+2, where q = 2m, that appears to be new.
We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length n of all QMDS codes with local dimension D and distance d ≥ 3 is bounded by n ≤ D 2 + d − 2 . We obtain their weight distribution and present additional bounds that arise from Rains' shadow inequalities. Our main result can be seen as a generalization of bounds that are known for the two special cases of stabilizer QMDS codes and absolutely maximally entangled states, and confirms the quantum MDS conjecture in the special case of distance-three codes. As the existence of QMDS codes is linked to that of highly entangled subspaces (in which every vector has uniform r -body marginals) of maximal dimension, our methods directly carry over to address questions in multipartite entanglement.
We consider quantum error-correcting codes over alphabets of arbitrary size. We generalize quantum stabilizer codes and develop Calderbank-Shor-Steane construction over quantum systems of arbitrary dimensions using the group structure of alphabets. We also develop a methodology systematically conjoining error-correcting codes into a new class of error-correcting codes. With the help of these methods we give several ways to construct quantum maximum distance separable (MDS) codes and present many families of quantum MDS codes.
We construct three new families of asymmetric quantum MDS codes from nested Hermitian self-orthogonal generalized Reed–Solomon and extended generalized Reed–Solomon codes over Fq2. The construction is developed in three settings: affine partitions of Fq2, projective norm partitions of Fq2*, and extended affine configurations obtained by adjoining the point at infinity. In each case, the Hermitian orthogonality conditions are reduced to explicit linear systems over Fq, whose solvability follows from structured moment identities and Vandermonde-type arguments. This yields nested classical MDS codes satisfying the Hermitian dual-containment condition required in the Hermitian construction of asymmetric quantum codes. As a consequence, we obtain three explicit families of asymmetric quantum MDS codes with fully determined lengths, dimensions, and asymmetric distances dz and dx. Our results show that affine and projective partition techniques provide a natural and effective framework for constructing optimal asymmetric quantum codes with flexible parameters.