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:2512.16482

New Quantum Stabilizer Codes from generalized Monomial-Cartesian Codes constructed using two different generalized Reed-Solomon codes

Campion, Oisin, Hernando, Fernando, McGuire, Gary

Published Dec 18, 2025• 0 citations
arXivHTMLPDF

Abstract

In this work, we define Generalized Monomial Cartesian Codes (GMCC), which constitute a natural extension of generalized Reed-Solomon codes. We describe how two different generalized Reed-Solomon codes can be combined to construct one GMCC. We further establish sufficient conditions ensuring that the GMCC are Hermitian self-orthogonal, thus leading to new constructions of quantum codes.

DOI
10.48550/arxiv.2512.16482

Related papers

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•4 citations

Quantum Codes from Generalized Reed-Solomon Codes and Matrix-Product Codes

Tao Zhang, Gennian Ge

One of the central tasks in quantum error-correction is to construct quantum codes that have good parameters. In this paper, we construct three new classes of quantum MDS codes from classical Hermitian self-orthogonal generalized Reed-Solomon codes. We also present some classes of quantum codes from matrix-product codes. It turns out that many of our quantum codes are new in the sense that the parameters of quantum codes cannot be obtained from all previous constructions.

arXiv:1508.00978•Aug 5, 2015•7 citations

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

Beatriz Barbero-Lucas, Fernando Hernando, Helena Martín-Cruz +1 more

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.

arXiv:2307.15488•Quantum Information Processing•Mar 1, 2024•2 citations

Two new classes of quantum MDS codes from generalized Reed-Solomon codes

Weiwei Wang, Jiantao Li

In this paper, we mainly use classical Hermitian self-orthogonal generalized Reed-Solomon codes to construct two new classes of quantum MDS codes. Most of our quantum MDS codes have minimum distance larger than q/2+1. Compared with previously known constructions, these quantum MDS codes in our constructions have large minimum distance and their parameters are not covered by the previous codes.

arXiv:2001.03445•Jan 6, 2020•0 citations

Self-Orthogonal Twisted Generalized Reed-Solomon Codes and Their Application to Quantum Error-Correcting Codes

Yanxin Chen, Yanli Wang, Tongjiang Yan

In this paper, two classes of twisted generalized Reed-Solomon (TGRS) codes with multi-twists are studied. Firstly, some sufficient and necessary conditions for these codes to be self-orthogonal and self-dual are established. Then several explicit constructions of self-orthogonal and self-dual codes are presented, from which quantum stabilizer codes are further derived. Finally, some corresponding examples are given, especially that some of these codes are MDS, AMDS or NMDS and that some of the resulting quantum stabilizer codes are optimal, achieving the quantum Singleton bound.

arXiv:2605.23460•May 22, 2026•0 citations

Some new quantum MDS codes derived from generalized Reed-Solomon codes

Xueying Shi, Qin Yue

Quantum maximum-distance-separable (MDS) codes are very important in coding theory. In this paper, we construct three classes of new quantum MDS codes with large minimum distance by classical Hermitian self-orthogonal generalized Reed-Solomon codes. Furthermore, these quantum MDS codes have more flexible lengths and larger minimum distance than those of some known quantum MDS codes.

Advances in Mathematics of Communications•Jan 1, 2022•5 citations
In this work, we define Generalized Monomial Cartesian Codes (GMCC), which constitute a natural extension of generalized Reed-Solomon codes. We describe how two different generalized Reed-Solomon codes can be combined to construct one GMCC. We further establish sufficient conditions ensuring that the GMCC are Hermitian self-orthogonal, thus leading to new constructions of quantum codes.
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.
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.
In this paper, two classes of twisted generalized Reed-Solomon (TGRS) codes with multi-twists are studied. Firstly, some sufficient and necessary conditions for these codes to be self-orthogonal and self-dual are established. Then several explicit constructions of self-orthogonal and self-dual codes are presented, from which quantum stabilizer codes are further derived. Finally, some corresponding examples are given, especially that some of these codes are MDS, AMDS or NMDS and that some of the resulting quantum stabilizer codes are optimal, achieving the quantum Singleton bound.