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

Elementary Constructions of Best Known Quantum Codes

Nuh Aydın, Nguyen, Trang T. T., Tran, Long B.

Published Oct 16, 2024• 0 citations
arXivHTMLPDF

Abstract

Recently, many good quantum codes over various finite fields $F_q$ have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly from cyclic codes or their generalizations over $F_q$. Unless explicit benefits are demonstrated for the indirect approach, we believe that direct and more elementary methods should be preferred.

DOI
10.48550/arxiv.2410.12167

Related papers

Elementary Constructions of Best Known Quantum Codes

Tran, Long, Nguyen, Trang, Nuh Aydın

Building large-scale quantum computers is a very active area of research. A critical part of this effort is the ability to control quantum errors. Recently, many good quantum error correcting codes (QECC) over various finite fields Fq have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly from classical codes, including cyclic, constacyclic, quasicyclic (QC), quasi-twisted (QT), and polycyclic codes using the CSS construction, Hermitian construction, and Lisonek-Singh methods. We believe direct and more elementary methods should be preferred.

•Jul 1, 2024•0 citations

On Optimal and Quantum Code Construction from Cyclic Codes over FqPQ with Applications

Shakir Ali, Amal S. Alali, Pushpendra Sharma +3 more

The key objective of this paper is to study the cyclic codes over mixed alphabets on the structure of FqPQ, where P=Fq[v]⟨v3−α22v⟩ and Q=Fq[u,v]⟨u2−α12,v3−α22v⟩ are nonchain finite rings and αi is in Fq/{0} for i∈{1,2}, where q=pm with m≥1 is a positive integer and p is an odd prime. Moreover, with the applications, we obtain better and new quantum error-correcting (QEC) codes. For another application over the ring P, we obtain several optimal codes with the help of the Gray image of cyclic codes.

Entropy•Aug 2, 2023•4 citations

New Quantum Codes and (θ, δ, β)-Cyclic Codes

Ashutosh Singh, Priyanka Sharma, Om Prakash

For a prime p and a positive integer e, let$\mathbb {F}_{p^{e}}$be the finite field of order$p^{e}$and$\mathfrak {R}_{\ell } $be a non-chain ring given by$\mathfrak {R}_{\ell } :=\mathbb {F}_{p^{e}}[v]/\langle v^{\ell } -1\rangle,~\ell \gt 1$. This study presents the$(\theta _{1},\delta _{1},\beta _{1})$-cyclic codes over$\mathfrak {R}_{\ell } $and$(\theta _{i},\delta _{i},\beta _{i})$-cyclic codes over$\mathbb {F}_{p^{e}}\mathfrak {R}_{\ell } $for$i=0,1$. Further, we study the application of these codes in the construction of quantum codes. Towards this, we define a Gray map to find images of the elements of$\mathfrak {R}_{\ell } $and$\mathbb {F}_{p^{e}}\mathfrak {R}_{\ell } $over the copies of$\mathbb {F}_{p^{e}}$, and then establish the dual-containing conditions for these codes. Finally, using the CSS construction and a propagation rule, we find many non-binary quantum and classical codes with better parameters.

IEEE Access•Jan 1, 2024•4 citations

$ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $ -cyclic codes over $ \mathbb{F}_q^l $ and their application to construct quantum codes

Akanksha Tiwari, Anuj Kumar Bhagat, Ritumoni Sarma

In this article, for a finite field $ \mathbb{F}_q $ and a natural number $ l, $ let $ \mathcal{R} $ denote the product ring $ \mathbb{F}_q^l. $ Firstly, for an automorphism $ \Theta $ of $ \mathcal{R}, $ a $ \Theta $-derivation $ \Delta_\Theta $ of $ \mathcal{R} $ and for a unit $ \mathit{\boldsymbol{a}} $ in $ \mathcal{R}, $ we study $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ In this direction, we give an algebraic characterization of a $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic code over $ \mathcal{R} $, determine its generator polynomial, and find its decomposition over $ \mathbb{F}_q. $ Secondly, we give a necessary and sufficient condition for a $ (\Theta, 0, \mathit{\boldsymbol{a}}) $-cyclic code to be Euclidean dual-containing code over $ \mathcal{R}. $ Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over $ \mathbb{F}_q $ as Gray images of $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.

arXiv:2501.01708•Advances in Mathematics of Communications•Jan 1, 2026•1 citation

QUANTUM CODES FROM CYCLIC CODES OVER F4+ vF4

Mehmet Özen, FAIK CEM ERTUNC, Halit İnce

In this work, a method is given to construct quantum codes from cyclic codes over F4 + vF4 which will be denoted as R throughout the paper, where v2 = v and a Gray map is defined between R and where F4 is the field with 4 elements. Some optimal quantum code parameters and others will be presented at the end of the paper.

Journal of applied mathematics & informatics•Sep 30, 2016•1 citation

On quantum codes obtained from cyclic codes over 𝔽2 + u𝔽2 + u2𝔽2

Abhay Kumar Singh, Sukhamoy Pattanayak, Pratyush Kumar +1 more

In the paper, we consider a finite non-chain commutative ring [Formula: see text], where [Formula: see text]. We mainly study the construction of quantum codes from cyclic codes over [Formula: see text]. For this, we obtained self-orthogonal codes over [Formula: see text] as gray images of linear and cyclic codes over [Formula: see text], then these codes over [Formula: see text] correspond to a cyclic code over [Formula: see text] of odd length [Formula: see text] used to determine the parameters of the quantum codes.

arXiv:1601.02328•Asian-European Journal of Mathematics•Feb 17, 2017•16 citations
Recently, many good quantum codes over various finite fields FqF_qFq​ have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly from cyclic codes or their generalizations over FqF_qFq​. Unless explicit benefits are demonstrated for the indirect approach, we believe that direct and more elementary methods should be preferred.
Building large-scale quantum computers is a very active area of research. A critical part of this effort is the ability to control quantum errors. Recently, many good quantum error correcting codes (QECC) over various finite fields Fq have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly from classical codes, including cyclic, constacyclic, quasicyclic (QC), quasi-twisted (QT), and polycyclic codes using the CSS construction, Hermitian construction, and Lisonek-Singh methods. We believe direct and more elementary methods should be preferred.
The key objective of this paper is to study the cyclic codes over mixed alphabets on the structure of FqPQ, where P=Fq[v]⟨v3−α22v⟩ and Q=Fq[u,v]⟨u2−α12,v3−α22v⟩ are nonchain finite rings and αi is in Fq/{0} for i∈{1,2}, where q=pm with m≥1 is a positive integer and p is an odd prime. Moreover, with the applications, we obtain better and new quantum error-correcting (QEC) codes. For another application over the ring P, we obtain several optimal codes with the help of the Gray image of cyclic codes.
For a prime p and a positive integer e, letFpe\mathbb {F}_{p^{e}}Fpe​be the finite field of orderpep^{e}peand$\mathfrak {R}_{\ell } beanon−chainringgivenbybe a non-chain ring given bybeanon−chainringgivenby\mathfrak {R}_{\ell } :=\mathbb {F}_{p^{e}}[v]/\langle v^{\ell } -1\rangle,~\ell \gt 1.Thisstudypresentsthe. This study presents the.Thisstudypresentsthe(\theta _{1},\delta _{1},\beta _{1})−cycliccodesover-cyclic codes over−cycliccodesover\mathfrak {R}_{\ell } andandand(\theta _{i},\delta _{i},\beta _{i})−cycliccodesover-cyclic codes over−cycliccodesover\mathbb {F}_{p^{e}}\mathfrak {R}_{\ell } forforfori=0,1.Further,westudytheapplicationofthesecodesintheconstructionofquantumcodes.Towardsthis,wedefineaGraymaptofindimagesoftheelementsof. Further, we study the application of these codes in the construction of quantum codes. Towards this, we define a Gray map to find images of the elements of.Further,westudytheapplicationofthesecodesintheconstructionofquantumcodes.Towardsthis,wedefineaGraymaptofindimagesoftheelementsof\mathfrak {R}_{\ell } andandand\mathbb {F}_{p^{e}}\mathfrak {R}_{\ell } overthecopiesofover the copies ofoverthecopiesof\mathbb {F}_{p^{e}}$, and then establish the dual-containing conditions for these codes. Finally, using the CSS construction and a propagation rule, we find many non-binary quantum and classical codes with better parameters.
In this article, for a finite field $ \mathbb{F}_q $ and a natural number $ l, $ let $ \mathcal{R} $ denote the product ring $ \mathbb{F}_q^l. $ Firstly, for an automorphism $ \Theta $ of $ \mathcal{R}, $ a $ \Theta $-derivation $ \Delta_\Theta $ of $ \mathcal{R} $ and for a unit $ \mathit{\boldsymbol{a}} $ in $ \mathcal{R}, $ we study $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ In this direction, we give an algebraic characterization of a $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic code over $ \mathcal{R} $, determine its generator polynomial, and find its decomposition over $ \mathbb{F}_q. $ Secondly, we give a necessary and sufficient condition for a $ (\Theta, 0, \mathit{\boldsymbol{a}}) $-cyclic code to be Euclidean dual-containing code over $ \mathcal{R}. $ Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over $ \mathbb{F}_q $ as Gray images of $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.
In the paper, we consider a finite non-chain commutative ring [Formula: see text], where [Formula: see text]. We mainly study the construction of quantum codes from cyclic codes over [Formula: see text]. For this, we obtained self-orthogonal codes over [Formula: see text] as gray images of linear and cyclic codes over [Formula: see text], then these codes over [Formula: see text] correspond to a cyclic code over [Formula: see text] of odd length [Formula: see text] used to determine the parameters of the quantum codes.