Entanglement-assisted quantum error-correcting codes and asymmetric entanglement-assisted quantum error-correcting codes of length 5 <i> p <sup>t</sup> </i> over ๐”ฝ <sub> <i>p</i> <sup> <i>m</i> </sup> </sub>

Classical cyclic and constacyclic codes play a fundamental role in coding theory thanks to their rich algebraic structures and efficient encoding/decoding algorithms. These codes are especially important in the construction of quantum error-correcting codes, since their inherent algebraic properties facilitate the derivation of self-orthogonality or dual-containing conditions that are crucial for ensuring quantum error correction capability. In this paper, we construct entanglement-assisted quantum error-correcting codes (EAQEC codes) of length 5p t over ๐”ฝ p m . We compare our EAQEC codes with all known EAQEC codes to see that our EAQEC codes are new in the sense that their parameters are different from all the previous constructions. Moreover, our EAQEC codes have shorter lengths than the known codes, yet exhibit significantly larger quantum distances. This is highly meaningful in the context of quantum error correction, as it enables the construction of codes with small lengths while maintaining large quantum distances. We also construct asymmetric entanglement-assisted quantum error-correcting (AEAQEC) codes of length 5p t over ๐”ฝ p m . We evaluate our AEAQEC codes against all existing ones and find that they are both new and better.

Authors

Publication Details

Journal
International Journal of Modern Physics C
Published
2026-02-27
DOI
https://doi.org/10.1142/s0129183126430023
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Entanglement-assisted quantum error-correcting codes and asymmetric entanglement-assisted quantum error-correcting codes of length 5 p t over ๐”ฝ p m

Van-Nui Nguyen, Hiep L. Thi, Bac T. Nguyen, Hai Q. Dinh
International Journal of Modern Physics C
Quantum Computing Algorithms and Architecture
article

Entanglement-assisted quantum error-correcting codes and asymmetric entanglement-assisted quantum error-correcting codes of length 5 p t over ๐”ฝ p m

Van-Nui Nguyen, Hiep L. Thi, Bac T. Nguyen, Hai Q. Dinh
article en

Abstract

Classical cyclic and constacyclic codes play a fundamental role in coding theory thanks to their rich algebraic structures and efficient encoding/decoding algorithms. These codes are especially important in the construction of quantum error-correcting codes, since their inherent algebraic properties facilitate the derivation of self-orthogonality or dual-containing conditions that are crucial for ensuring quantum error correction capability. In this paper, we construct entanglement-assisted quantum error-correcting codes (EAQEC codes) of length 5p t over ๐”ฝ p m . We compare our EAQEC codes with all known EAQEC codes to see that our EAQEC codes are new in the sense that their parameters are different from all the previous constructions. Moreover, our EAQEC codes have shorter lengths than the known codes, yet exhibit significantly larger quantum distances. This is highly meaningful in the context of quantum error correction, as it enables the construction of codes with small lengths while maintaining large quantum distances. We also construct asymmetric entanglement-assisted quantum error-correcting (AEAQEC) codes of length 5p t over ๐”ฝ p m . We evaluate our AEAQEC codes against all existing ones and find that they are both new and better.

International Journal of Modern Physics C
Openalex Percentile: Top 44%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.