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

Designs Codes and Cryptography

Entanglement-assisted quantum error-correcting codes via quasi-cyclic codes with complementary duals

Hajime Matsui, Kakeru Kaneko

Published May 31, 2025• 2 citations
Publisher

Abstract

Abstract It is known that entanglement-assisted quantum error-correcting codes (EAQECCs), a type of quantum error correction codes, can be easily constructed using linear codes that satisfy the property called linear complementary duals (LCD). For quasi-cyclic (QC) codes, which are a class of linear codes, we have already published the methods for constructing the codes with properties such as self-orthogonality, self-duality and reversibility according to the prime-factor decomposition of $$-1+x^m$$ - 1 + x m , which reduce the amount of calculation by assembling several small generator polynomial matrices into a large generator polynomial matrix. In this paper, we propose a method to construct LCD–QC codes according to the prime-factor decomposition. The main idea of this method is to decompose the generator polynomial matrix of the QC code into several small generator polynomial matrices corresponding to the prime factors and perform LCD determination, which leads to a reduction in the amount of calculation. As an application of our construction method, we create EAQECCs from the constructed LCD–QC codes, compare those minimum weights with the maximum values of the minimum weights of existing EAQECCs and find 15 EAQECCs with larger minimum weights than the existing ones.

DOI
10.1007/s10623-025-01650-8

Related papers

Entanglement assisted quantum error correcting code from Hadamard matrices

Min Liu, Xiaoqing Tan, Daipengwei Bao +1 more

The classical linear codes that construct quantum error correction codes need to meet certain specific conditions. The proposal of entanglement-assisted quantum error correcting codes eliminates the restriction of these conditions, so all classical linear codes can be constructed into entanglement-assisted quantum error correcting codes. The Hadamard matrix is a special type of orthogonal matrix. Hadamard codes, constructed based on the standard form of Hadamard matrices, are a type of linear complementary dual (LCD) codes. By extending the generator and parity-check matrices of Hadamard codes, two types of classical codes whose parameters are [(l+1)(n−1), n−1] and [3n−3, n−1] maintain the LCD property. Utilizing the relationship between their LCD property and the dimensions of the Euclidean hull, this paper constructs two types of EAQECCs based on Hadamard matrices. These EAQECCs can achieve maximal entanglement, resulting in higher code rates and net rates compared to other EAQECCs. Their parameters are [[3n−3, 2n−2, d≥1; n−1]] and [[2n−2, n−1, d≥1; n−1]], respectively.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Sep 19, 2024•0 citations

New entanglement-assisted quantum codes constructed from Hermitian LCD codes

Yuezhen Ren, Ruihu Li, Guanmin Guo

Hermitian linear complementary dual (LCD) codes are a class of linear codes that intersect with their Hermitian dual trivially. Each Hermitian LCD code can give an entanglement-assisted quantum error-correcting code (EAQECC) with maximal entanglement. Methods of constructing Hermitian LCD codes from known codes were developed, and seven new Hermitian LCD codes with parameters $ [119,4,88]_{4} $, $ [123,4,91]_{4} $, $ [124,4,92]_{4} $, $ [136,4,101]_{4} $, $ [140,4,104]_{4} $, $ [188,4,140]_{4} $ and $ [212,4,158]_{4} $ were constructed. Seven families of Hermitian LCD codes and their related EAQECCs were derived from these codes. These new EAQECCs have better parameters than those known in the literature.

AIMS Mathematics•Jan 1, 2023•2 citations

QEC and EAQEC Codes from Hermitian Sums and Hulls of Cyclic Codes over $\mathbb{F}_2 \times (\mathbb{F}_2+v\mathbb{F}_2)$

Rabia Zengin, Mehmet E. Köroğlu

In this work, we determine the generator polynomials for the Hermitian hulls and Hermitian sums of cyclic codes defined over the composite ring $\mathbb{F}_2 \times (\mathbb{F}_2 + v\mathbb{F}_2)$, where $v^2 = v$. Based on these structures, we develop quantum error-correcting (QEC) codes by applying the Hermitian dual version of Quantum Construction~X to the obtained Hermitian hulls and sums. Moreover, by employing matrix product code methods on linear complementary dual (LCD) codes defined over the same ring, we derive families of entanglement-assisted quantum error-correcting (EAQEC) codes.

arXiv:2606.02137•Jun 1, 2026•1 citation

General entanglement-assisted quantum error-correcting codes

Todd A. Brun, Igor Devetak, Min-Hsiu Hsieh

Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-existing entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code, unlike standard QECCs which can only be constructed from dual-containing codes. Operator quantum error-correcting codes (OQECCs) allow certain errors to be corrected (or prevented) passively, reducing the complexity of the correction procedure. We combine these two extensions of standard quantum error correction into a unified entanglement- assisted quantum error correction formalism. This new scheme, which we call entanglement-assisted operator quantum error correction (EAOQEC), is the most general and powerful quantum error-correcting technique known, retaining the advantages of both entanglement-assistance and passive correction. We present the formalism, show the considerable freedom in constructing EAOQECCs from classical codes, and demonstrate the construction with examples.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•27 citations

Construction of Hermitian Self-Orthogonal Codes and Application

Yuezhen Ren, Ruihu Li, Hao Song

We introduce some methods for constructing quaternary Hermitian self-orthogonal (HSO) codes, and construct quaternary [n, 5] HSO for 342≤n≤492. Furthermore, we present methods of constructing Hermitian linear complementary dual (HLCD) codes from known HSO codes, and obtain many HLCD codes with good parameters. As an application, 31 classes of entanglement-assisted quantum error correction codes (EAQECCs) with maximal entanglement can be obtained from these HLCD codes. These new EAQECCs have better parameters than those in the literature.

Mathematics•Jul 5, 2024•3 citations

On Galois hulls of linear codes and new entanglement-assisted quantum error-correcting codes

Yang Li, Shixin Zhu

The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the dimensions of Galois hulls of linear codes is found. Some new necessary and sufficient conditions for linear codes being Galois self-orthogonal codes, Galois self-dual codes, and Galois linear complementary dual codes are characterized. Then, we propose explicit methods to construct Galois self-orthogonal codes of larger length from given Galois self-orthogonal codes. As an application, linear codes of larger length with Galois hulls of arbitrary dimensions are further derived. Focusing on the Hermitian inner product, two new classes of Hermitian self-orthogonal maximum distance separable (MDS) codes are also constructed. Finally, applying all the results to the construction of entanglement-assisted quantum error-correcting codes (EAQECCs), many new $q$-ary or $\sqrt{q}$-ary EAQECCs and MDS EAQECCs with rates greater than or equal to $\frac{1}{2}$ and positive net rates can be obtained. Moreover, the minimum distance of many $\sqrt{q}$-ary MDS EAQECCs of length $n>\sqrt{q}+1$ is greater than or equal to $\lceil \frac{\sqrt{q}}{2} \rceil$.

arXiv:2207.02535•Jul 6, 2022•2 citations
Abstract It is known that entanglement-assisted quantum error-correcting codes (EAQECCs), a type of quantum error correction codes, can be easily constructed using linear codes that satisfy the property called linear complementary duals (LCD). For quasi-cyclic (QC) codes, which are a class of linear codes, we have already published the methods for constructing the codes with properties such as self-orthogonality, self-duality and reversibility according to the prime-factor decomposition of −1+xm-1+x^m−1+xm - 1 + x m , which reduce the amount of calculation by assembling several small generator polynomial matrices into a large generator polynomial matrix. In this paper, we propose a method to construct LCD–QC codes according to the prime-factor decomposition. The main idea of this method is to decompose the generator polynomial matrix of the QC code into several small generator polynomial matrices corresponding to the prime factors and perform LCD determination, which leads to a reduction in the amount of calculation. As an application of our construction method, we create EAQECCs from the constructed LCD–QC codes, compare those minimum weights with the maximum values of the minimum weights of existing EAQECCs and find 15 EAQECCs with larger minimum weights than the existing ones.
The classical linear codes that construct quantum error correction codes need to meet certain specific conditions. The proposal of entanglement-assisted quantum error correcting codes eliminates the restriction of these conditions, so all classical linear codes can be constructed into entanglement-assisted quantum error correcting codes. The Hadamard matrix is a special type of orthogonal matrix. Hadamard codes, constructed based on the standard form of Hadamard matrices, are a type of linear complementary dual (LCD) codes. By extending the generator and parity-check matrices of Hadamard codes, two types of classical codes whose parameters are [(l+1)(n−1), n−1] and [3n−3, n−1] maintain the LCD property. Utilizing the relationship between their LCD property and the dimensions of the Euclidean hull, this paper constructs two types of EAQECCs based on Hadamard matrices. These EAQECCs can achieve maximal entanglement, resulting in higher code rates and net rates compared to other EAQECCs. Their parameters are [[3n−3, 2n−2, d≥1; n−1]] and [[2n−2, n−1, d≥1; n−1]], respectively.
Hermitian linear complementary dual (LCD) codes are a class of linear codes that intersect with their Hermitian dual trivially. Each Hermitian LCD code can give an entanglement-assisted quantum error-correcting code (EAQECC) with maximal entanglement. Methods of constructing Hermitian LCD codes from known codes were developed, and seven new Hermitian LCD codes with parameters $ [119,4,88]_{4} $, $ [123,4,91]_{4} $, $ [124,4,92]_{4} $, $ [136,4,101]_{4} $, $ [140,4,104]_{4} $, $ [188,4,140]_{4} $ and $ [212,4,158]_{4} $ were constructed. Seven families of Hermitian LCD codes and their related EAQECCs were derived from these codes. These new EAQECCs have better parameters than those known in the literature.
QEC and EAQEC Codes from Hermitian Sums and Hulls of Cyclic Codes over F2×(F2+vF2)\mathbb{F}_2 \times (\mathbb{F}_2+v\mathbb{F}_2)F2​×(F2​+vF2​)
In this work, we determine the generator polynomials for the Hermitian hulls and Hermitian sums of cyclic codes defined over the composite ring F2×(F2+vF2)\mathbb{F}_2 \times (\mathbb{F}_2 + v\mathbb{F}_2)F2​×(F2​+vF2​), where v2=vv^2 = vv2=v. Based on these structures, we develop quantum error-correcting (QEC) codes by applying the Hermitian dual version of Quantum Construction~X to the obtained Hermitian hulls and sums. Moreover, by employing matrix product code methods on linear complementary dual (LCD) codes defined over the same ring, we derive families of entanglement-assisted quantum error-correcting (EAQEC) codes.
Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-existing entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code, unlike standard QECCs which can only be constructed from dual-containing codes. Operator quantum error-correcting codes (OQECCs) allow certain errors to be corrected (or prevented) passively, reducing the complexity of the correction procedure. We combine these two extensions of standard quantum error correction into a unified entanglement- assisted quantum error correction formalism. This new scheme, which we call entanglement-assisted operator quantum error correction (EAOQEC), is the most general and powerful quantum error-correcting technique known, retaining the advantages of both entanglement-assistance and passive correction. We present the formalism, show the considerable freedom in constructing EAOQECCs from classical codes, and demonstrate the construction with examples.
We introduce some methods for constructing quaternary Hermitian self-orthogonal (HSO) codes, and construct quaternary [n, 5] HSO for 342≤n≤492. Furthermore, we present methods of constructing Hermitian linear complementary dual (HLCD) codes from known HSO codes, and obtain many HLCD codes with good parameters. As an application, 31 classes of entanglement-assisted quantum error correction codes (EAQECCs) with maximal entanglement can be obtained from these HLCD codes. These new EAQECCs have better parameters than those in the literature.
The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the dimensions of Galois hulls of linear codes is found. Some new necessary and sufficient conditions for linear codes being Galois self-orthogonal codes, Galois self-dual codes, and Galois linear complementary dual codes are characterized. Then, we propose explicit methods to construct Galois self-orthogonal codes of larger length from given Galois self-orthogonal codes. As an application, linear codes of larger length with Galois hulls of arbitrary dimensions are further derived. Focusing on the Hermitian inner product, two new classes of Hermitian self-orthogonal maximum distance separable (MDS) codes are also constructed. Finally, applying all the results to the construction of entanglement-assisted quantum error-correcting codes (EAQECCs), many new qqq-ary or q\sqrt{q}q​-ary EAQECCs and MDS EAQECCs with rates greater than or equal to 12\frac{1}{2}21​ and positive net rates can be obtained. Moreover, the minimum distance of many q\sqrt{q}q​-ary MDS EAQECCs of length n>q+1n>\sqrt{q}+1n>q​+1 is greater than or equal to ⌈q2⌉\lceil \frac{\sqrt{q}}{2} \rceil⌈2q​​⌉.