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

Advances in Mathematics of Communications

$ t_1 $ -partitioned Euclidean orthogonal MP codes and their application to asymmetric quantum codes

Ye Cai Guo, Peng Hu, Xiusheng Liu

Published Aug 18, 2025• 0 citations
Publisher

Abstract

In this paper, we first give the definition of $ t_1 $-partitioned Euclidean orthogonal matrix-product (MP) codes over finite fields. We then provide a criterion for $ t_1 $-partitioned Euclidean orthogonal MP codes over finite fields to be Euclidean dual-containing. Further, we exhibit a new construction method for asymmetric quantum codes by using this criterion. This construction is applied to obtain six new infinite families of asymmetric quantum codes. In addition, we compare our asymmetric quantum codes with previously known asymmetric quantum codes or quantum codes available in the literature. As can be seen, our obtained asymmetric quantum codes have better parameters than the asymmetric quantum codes or quantum codes available in the literature.

DOI
10.3934/amc.2025039

Related papers

Optimal Asymmetric Quantum Codes from the Euclidean Sums of Linear Codes

Peng Xu, Xiusheng Liu

In this paper, we first give the definition of the Euclidean sums of linear codes, and prove that the Euclidean sums of linear codes are Euclidean dual-containing. Then we construct two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of the Reed-Solomon codes, and two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of linear codes generated by Vandermonde matrices over finite fields. Moreover, these optimal asymmetric quantum error-correcting codes constructed in this paper are different from the ones in the literature.

Wuhan University Journal of Natural Sciences•Feb 1, 2024•2 citations

Quantum codes and optimal pure quantum $(r,δ)$-LRCs via the MP construction

Meng Cao, Kun Zhou

In this paper, we employ MP codes whose defining matrices are $τ$-optimal defining ($τ$-OD) matrices to construct new quantum codes and quantum $(r,δ)$-LRCs. Specifically, we report the following results: We establish a unified $τ$-monomial decomposition theorem for invertible self-adjoint matrices over finite fields of arbitrary characteristic, which generalizes the result in "Quantum codes using the $τ$-OD MP construction" where the characteristic was required to be odd. Based on this theorem, we prove the existence of $τ$-OD matrices over $\mathbb{F}_{q^2}$ for any characteristic and demonstrate that there exist several new infinite families of $τ$-OD matrices over $\mathbb{F}_{q^2}$ of characteristic $2$. As an application of MP codes involving $τ$-OD matrices, we construct several infinite families of quantum codes with flexible parameters. Within this framework, we present $222$ record-breaking quantum codes that surpass the best-known records maintained in Grassl's database. We propose two effective schemes for constructing optimal pure quantum $(r,δ)$-LRCs via MP codes. Accordingly, we construct four new infinite families of optimal pure quantum $(r,δ)$-LRCs with flexible parameters. Notably, we report an interesting phenomenon by exhibiting $30$ optimal pure quantum $(r,δ)$-LRCs derived from our framework; that is, there exist quantum codes that are not only optimal pure quantum $(r,δ)$-LRCs but also, according to Grassl's database, best-known, optimal, or record-breaking quantum codes. To the best of our knowledge, the new discovery that quantum codes are simultaneously optimal pure quantum $(r,δ)$-LRCs and record-breaking quantum codes has not been previously reported in the literature.

quant-pharXiv:2606.14253•Jun 15, 2026•6 citations

Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal and quasi-unitary matrices

Cao, Meng

Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in [10-12]; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and $q$-ary quantum codes derived from these matrix-product codes.

arXiv:2012.15691•Dec 31, 2020•3 citations

New Quantum Codes From Matrix-Product Codes

Hao Song, Luo Bin Guo, Liang Dong Lv +1 more

In this paper, the construction of matrix-product codes with Euclidean dual-containing are studied. The critical issue is to determine the parameters of the matrix-product code and its dual code. Therefore, the necessary conditions for which the matrix-product code is Euclidean dual-containing are given. Consequently, new non-binary quantum codes are derived from those matrix-product codes by q-ary Steane’s construction, and some examples are given for q =4,5.

Procedia Computer Science•Jan 1, 2019•2 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

Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal matrices and quasi-unitary matrices.

Meng Cao

Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length. Specifically, it follows from CSS construction (resp. Hermitian construction) that a matrix-product code over $\mathbb{F}_{q}$ (resp. $\mathbb{F}_{q^{2}}$) which is Euclidean dual-containing (resp. Hermitian dual-containing) can produce a $q$-ary quantum code. In order to obtain such matrix-product codes, a common way is to construct quasi-orthogonal matrices (resp. quasi-unitary matrices) as the defining matrices of matrix-product codes over $\mathbb{F}_{q}$ (resp. $\mathbb{F}_{q^{2}}$). The usage of NSC quasi-orthogonal matrices or NSC quasi-unitary matrices in this process enables the minimum distance lower bound of the corresponding quantum codes to reach its optimum. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in \cite{Cao2020Constructioncaowang,Cao2020New,Cao2020Constructionof}; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and $q$-ary quantum codes derived from these newly constructed matrix-product codes.

•Dec 31, 2020•1 citation
In this paper, we first give the definition of t1t_1t1​-partitioned Euclidean orthogonal matrix-product (MP) codes over finite fields. We then provide a criterion for t1t_1t1​-partitioned Euclidean orthogonal MP codes over finite fields to be Euclidean dual-containing. Further, we exhibit a new construction method for asymmetric quantum codes by using this criterion. This construction is applied to obtain six new infinite families of asymmetric quantum codes. In addition, we compare our asymmetric quantum codes with previously known asymmetric quantum codes or quantum codes available in the literature. As can be seen, our obtained asymmetric quantum codes have better parameters than the asymmetric quantum codes or quantum codes available in the literature.
In this paper, we first give the definition of the Euclidean sums of linear codes, and prove that the Euclidean sums of linear codes are Euclidean dual-containing. Then we construct two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of the Reed-Solomon codes, and two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of linear codes generated by Vandermonde matrices over finite fields. Moreover, these optimal asymmetric quantum error-correcting codes constructed in this paper are different from the ones in the literature.
Quantum codes and optimal pure quantum (r,δ)(r,δ)(r,δ)-LRCs via the MP construction
In this paper, we employ MP codes whose defining matrices are τττ-optimal defining (τττ-OD) matrices to construct new quantum codes and quantum (r,δ)(r,δ)(r,δ)-LRCs. Specifically, we report the following results: We establish a unified τττ-monomial decomposition theorem for invertible self-adjoint matrices over finite fields of arbitrary characteristic, which generalizes the result in "Quantum codes using the τττ-OD MP construction" where the characteristic was required to be odd. Based on this theorem, we prove the existence of τττ-OD matrices over Fq2\mathbb{F}_{q^2}Fq2​ for any characteristic and demonstrate that there exist several new infinite families of τττ-OD matrices over Fq2\mathbb{F}_{q^2}Fq2​ of characteristic 222. As an application of MP codes involving τττ-OD matrices, we construct several infinite families of quantum codes with flexible parameters. Within this framework, we present 222222222 record-breaking quantum codes that surpass the best-known records maintained in Grassl's database. We propose two effective schemes for constructing optimal pure quantum (r,δ)(r,δ)(r,δ)-LRCs via MP codes. Accordingly, we construct four new infinite families of optimal pure quantum (r,δ)(r,δ)(r,δ)-LRCs with flexible parameters. Notably, we report an interesting phenomenon by exhibiting 303030 optimal pure quantum (r,δ)(r,δ)(r,δ)-LRCs derived from our framework; that is, there exist quantum codes that are not only optimal pure quantum (r,δ)(r,δ)(r,δ)-LRCs but also, according to Grassl's database, best-known, optimal, or record-breaking quantum codes. To the best of our knowledge, the new discovery that quantum codes are simultaneously optimal pure quantum (r,δ)(r,δ)(r,δ)-LRCs and record-breaking quantum codes has not been previously reported in the literature.
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good qqq-ary quantum codes of large length. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in [10-12]; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and qqq-ary quantum codes derived from these matrix-product 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.
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good qqq-ary quantum codes of large length. Specifically, it follows from CSS construction (resp. Hermitian construction) that a matrix-product code over Fq\mathbb{F}_{q}Fq​ (resp. Fq2\mathbb{F}_{q^{2}}Fq2​) which is Euclidean dual-containing (resp. Hermitian dual-containing) can produce a qqq-ary quantum code. In order to obtain such matrix-product codes, a common way is to construct quasi-orthogonal matrices (resp. quasi-unitary matrices) as the defining matrices of matrix-product codes over Fq\mathbb{F}_{q}Fq​ (resp. Fq2\mathbb{F}_{q^{2}}Fq2​). The usage of NSC quasi-orthogonal matrices or NSC quasi-unitary matrices in this process enables the minimum distance lower bound of the corresponding quantum codes to reach its optimum. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in \cite{Cao2020Constructioncaowang,Cao2020New,Cao2020Constructionof}; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and qqq-ary quantum codes derived from these newly constructed matrix-product codes.