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:2307.15488 · Quantum Information Processing

MDS, Hermitian almost MDS, and Gilbert–Varshamov quantum codes from generalized monomial-Cartesian codes

Beatriz Barbero-Lucas, Fernando Hernando, Helena Martín-Cruz, Gary McGuire

Published Mar 1, 2024• 5 citations
arXivHTMLPDF

Abstract

Abstract We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized monomial-Cartesian codes arise from polynomials inmvariables. When $$m=1$$ m=1 our codes are MDS, and when $$m=2$$ m=2 and our lower bound for the minimum distance is 3, the codes are at least Hermitian almost MDS. For an infinite family of parameters, when $$m=2$$ m=2 we prove that our codes beat the Gilbert–Varshamov bound. We also present many examples of our codes that are better than any known code in the literature.

DOI
10.1007/s11128-024-04297-x

Related papers

A Finite Gilbert–Varshamov Bound for Pure Stabilizer Quantum Codes

Kai Feng, Zhi Ma

A finite Gilbert-Varshamov (GV) bound for pure stabilizer (binary and nonbinary) quantum error correcting codes is presented in analogy to the GV bound for classical codes by using several enumerative results in finite unitary geometry. From this quantum GV bound we obtain several new binary quantum codes in a nonconstructive way having better parameters than the known codes.

IEEE Transactions on Information Theory•Nov 30, 2004•113 citations

Two new classes of Hermitian self-orthogonal non-GRS MDS codes and their applications

Gaojun Luo, Xiwang Cao, Martianus Frederic Ezerman +1 more

Hermitian self-orthogonal codes form an essential ingredient in the construction of quantum stabilizer codes. In this paper, we present two new classes of Hermitian self-orthogonal MDS codes from twisted generalized Reed-Solomon codes. The constructed codes are monomially inequivalent to generalized Reed-Solomon codes. Two new classes of Hermitian LCD MDS codes can then be derived. Finally, based on the constructed Hermitian self-orthogonal MDS codes, we present two classes of quantum MDS codes with new parameters.

Advances in Mathematics of Communications•Jan 1, 2022•6 citations

New entanglement-assisted quantum MDS codes

Binbin Pang, Shixin Zhu, Liqi Wang

Entanglement-assisted quantum error-correcting codes (EAQECCs) can be obtained from arbitrary classical linear codes based on the entanglement-assisted stabilizer formalism, which greatly promoted the development of quantum coding theory. In this paper, we construct several families of [Formula: see text]-ary entanglement-assisted quantum maximum-distance-separable (EAQMDS) codes of lengths [Formula: see text] with flexible parameters as to the minimum distance [Formula: see text] and the number [Formula: see text] of maximally entangled states. Most of the obtained EAQMDS codes have larger minimum distances than the codes available in the literature.

International Journal of Quantum Information•Apr 1, 2021•6 citations

On Linear Codes Whose Hermitian Hulls are MDS

Gaojun Luo, Lin Sok, Martianus Frederic Ezerman +1 more

Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have been utilized as ingredients to construct entanglement-assisted quantum error correcting codes. This family of quantum codes is often seen as a generalization of quantum stabilizer codes. Theoretically, compared with the Euclidean setup, the Hermitian case is much harder to deal with. Hermitian hulls of MDS linear codes with low dimensions have been explored, mostly from generalized Reed-Solomon codes. Characterizing Hermitian hulls which themselves are MDS appears to be more involved and has not been extensively studied. This paper introduces some tools to study linear codes whose Hermitian hulls are MDS. Using the tools, we then propose explicit constructions of such codes. We consider Hermitian hulls of both Reed-Solomon and non Reed-Solomon types of linear MDS codes. We demonstrate that, given the same Hermitian hull dimensions, the codes from our constructions have dimensions which are larger than those in the literature.

arXiv:2404.04993•IEEE Transactions on Information Theory•Apr 10, 2024•15 citations

New Quantum Codes using Monomial Matrix over Hermitian Dual-Containing Matrix Product Codes

Shivender Goswami

Quantum error correction (QEC) is beneficial for ensuring reliable quantum computation and communication by addressing the susceptibility of quantum states to errors from decoherence and noise. This study explores the use of Quantum Matrix Product Codes (MPCs) with an emphasis on monomial matrices and Hermitian duals to achieve efficient and robust error correction. We provide a detailed mathematical formulation of MPCs utilizing monomial matrices, emphasizing the importance of Hermitian duals in maintaining code integrity and ensuring effective error correction. The paper proposes a new criterion for utilizing the rank of the generator matrix associated with linear codes established from Hermitian dual-containing (HDC) of the MPCs. Then, using this criterion, a new set of quantum maximum-distance-separable (MDS) codes has been constructed with better code parameters and error-correction potential. For comparison purpose, different codes have been observed alongside with the obtained codes to ascertain the uniqueness and error correction capabilities.

Communications on Applied Nonlinear Analysis•Feb 21, 2025•0 citations

Some New Constructions of Quantum MDS Codes

Weijun Fang, Fang‐Wei Fu

It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of$q$-ary quantum MDS codes by using generalized Reed–Solomon (GRS) codes and Hermitian construction. The minimum distances of our quantum MDS codes can be larger than$\frac {q}{2}+1$. Three of these six classes of quantum MDS codes have longer lengths than the ones constructed in[1]and[2], hence some of their results can be easily derived from ours via the propagation rule. Moreover, some known quantum MDS codes of specific lengths can be seen as special cases of ours and the minimum distances of some known quantum MDS codes are also improved as well.

arXiv:1804.08213•IEEE Transactions on Information Theory•Sep 3, 2019•59 citations
Abstract We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized monomial-Cartesian codes arise from polynomials inmvariables. When m=1m=1m=1 m=1 our codes are MDS, and when m=2m=2m=2 m=2 and our lower bound for the minimum distance is 3, the codes are at least Hermitian almost MDS. For an infinite family of parameters, when m=2m=2m=2 m=2 we prove that our codes beat the Gilbert–Varshamov bound. We also present many examples of our codes that are better than any known code in the literature.
Hermitian self-orthogonal codes form an essential ingredient in the construction of quantum stabilizer codes. In this paper, we present two new classes of Hermitian self-orthogonal MDS codes from twisted generalized Reed-Solomon codes. The constructed codes are monomially inequivalent to generalized Reed-Solomon codes. Two new classes of Hermitian LCD MDS codes can then be derived. Finally, based on the constructed Hermitian self-orthogonal MDS codes, we present two classes of quantum MDS codes with new parameters.
Entanglement-assisted quantum error-correcting codes (EAQECCs) can be obtained from arbitrary classical linear codes based on the entanglement-assisted stabilizer formalism, which greatly promoted the development of quantum coding theory. In this paper, we construct several families of [Formula: see text]-ary entanglement-assisted quantum maximum-distance-separable (EAQMDS) codes of lengths [Formula: see text] with flexible parameters as to the minimum distance [Formula: see text] and the number [Formula: see text] of maximally entangled states. Most of the obtained EAQMDS codes have larger minimum distances than the codes available in the literature.
Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have been utilized as ingredients to construct entanglement-assisted quantum error correcting codes. This family of quantum codes is often seen as a generalization of quantum stabilizer codes. Theoretically, compared with the Euclidean setup, the Hermitian case is much harder to deal with. Hermitian hulls of MDS linear codes with low dimensions have been explored, mostly from generalized Reed-Solomon codes. Characterizing Hermitian hulls which themselves are MDS appears to be more involved and has not been extensively studied. This paper introduces some tools to study linear codes whose Hermitian hulls are MDS. Using the tools, we then propose explicit constructions of such codes. We consider Hermitian hulls of both Reed-Solomon and non Reed-Solomon types of linear MDS codes. We demonstrate that, given the same Hermitian hull dimensions, the codes from our constructions have dimensions which are larger than those in the literature.
Quantum error correction (QEC) is beneficial for ensuring reliable quantum computation and communication by addressing the susceptibility of quantum states to errors from decoherence and noise. This study explores the use of Quantum Matrix Product Codes (MPCs) with an emphasis on monomial matrices and Hermitian duals to achieve efficient and robust error correction. We provide a detailed mathematical formulation of MPCs utilizing monomial matrices, emphasizing the importance of Hermitian duals in maintaining code integrity and ensuring effective error correction. The paper proposes a new criterion for utilizing the rank of the generator matrix associated with linear codes established from Hermitian dual-containing (HDC) of the MPCs. Then, using this criterion, a new set of quantum maximum-distance-separable (MDS) codes has been constructed with better code parameters and error-correction potential. For comparison purpose, different codes have been observed alongside with the obtained codes to ascertain the uniqueness and error correction capabilities.
It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes ofqqq-ary quantum MDS codes by using generalized Reed–Solomon (GRS) codes and Hermitian construction. The minimum distances of our quantum MDS codes can be larger thanq2+1\frac {q}{2}+12q​+1. Three of these six classes of quantum MDS codes have longer lengths than the ones constructed in[1]and[2], hence some of their results can be easily derived from ours via the propagation rule. Moreover, some known quantum MDS codes of specific lengths can be seen as special cases of ours and the minimum distances of some known quantum MDS codes are also improved as well.