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

Quantum Information Processing

Quantum codes from cyclic codes over the mixed alphabet structure

Mohammad Ashraf, Naim Khan, Ghulam Mohammad

Published May 1, 2022• 17 citations
Publisher
DOI
10.1007/s11128-022-03491-z

Related papers

Quantum codes from skew cyclic codes over mixed alphabets

Om Prakash, Shikha Patel, Habibul Islam

arXiv:2305.10404•Computational and Applied Mathematics•Aug 1, 2025•7 citations

Constacyclic codes over mixed alphabets and their applications in constructing new quantum codes

Hai Quang Dinh, Sachin Pathak, Tushar Bag +2 more

Quantum Information Processing•Apr 1, 2021•10 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

Quantum Codes Derived from Cyclic Codes

Giuliano G. La Guardia

arXiv:1705.00239•International Journal of Theoretical Physics•Apr 29, 2017•33 citations

Elementary Constructions of Best Known Quantum Codes

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

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.

arXiv:2410.12167•Oct 16, 2024•0 citations

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

Mengqian Chen, Shanqi Pang, Rong Yan +1 more

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.

arXiv:2406.10629•AIMS Mathematics•Jan 1, 2026•0 citations
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.
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.
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.