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

IEEE Information Theory Workshop (ITW)

Good Entanglement-Assisted Qubit Codes from Matrix Product Codes

Lin Sok, Martianus Frederic Ezerman, San Ling

Published Nov 24, 2024• 2 citations
Publisher

Abstract

We study the Hermitian hulls of matrix product codes and use them to design linear codes with arbitrary hull dimensions. We continue by looking into some propagation rules that preserve the hull dimensions of$\mathbb{F}_{4}$-linear codes. We propose a recursive method to keep the Hermitian hull dimension fixed while increasing the dimensions or the minimum distances of codes built from a given$\mathbb{F}_{4}$-linear code. Using the Hermitian construction route, we derive good entanglement-assisted quantum codes from matrix product codes and recursively iterated codes.

DOI
10.1109/itw61385.2024.10806997

Related papers

Explicit constructions of optimal linear codes with Hermitian hulls and their application to quantum codes

Lin Sok

We prove that any Hermitian self-orthogonal $[n,k,d]_{q^2}$ code gives rise to an $[n,k,d]_{q^2}$ code with $\ell$ dimensional Hermitian hull for $0\le \ell \le k$. We present a new method to construct Hermitian self-orthogonal $[n,k]_{q^2}$ codes with large dimensions $k>\frac{n+q-1}{q+1}$. New families of Hermitian self-orthogonal codes with good parameters are obtained; more precisely those containing almost MDS codes. By applying a puncturing technique to Hermitian self-orthogonal codes, MDS $[n,k]_{q^2}$ linear codes with Hermitian hull having large dimensions $k>\frac{n+q-1}{q+1}$ are also derived. New families of MDS, almost MDS and optimal codes with arbitrary Hermitian hull dimensions are explicitly constructed from algebraic curves. As an application, we provide entanglement-assisted quantum error correcting codes with new parameters.

arXiv:2105.00513•May 2, 2021•0 citations

Entanglement-Assisted Quantum Codes from a Class of Unitary Matrices

Lin Sok, Martianus Frederic Ezerman, San Ling +1 more

We craft a special class of unitary matrices over$\mathbb{F}q^{2}$to generate classical linear codes whose Hermitian hulls have dimensions that we can design. We then use the codes as classical ingredients in the construction of good entanglement-assisted quantum codes. Over finite fields of characteristic 2, we propose two explicit constructions. To highlight their efficacy, we list excellent qubit codes whose parameters are either new or strictly better than comparable best-known codes in the literature.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•3 citations

Generalized Extended Codes with Applications in Entanglement-Assisted Qubit and Qutrit Codes

Yang Li, Martianus Frederic Ezerman, Shitao Li +2 more

We prove that any generalized extended code is monomially equivalent to the Hermitian dual of a code which is closely related to a second kind of extended code of $\C^{\perp_{\rm H}}$. Every $[n+1,k+1]_{q^2}$ linear code $\D$ with $d(\D^{\perp_{\rm H}})>1$ is monomially equivalent to the generalized extended code $\C({\bf u},a)$ of an $[n,k]_{q^2}$ linear code $\C$ for a fixed $a\in\F_{q^2}^{*}$ and some ${\bf u}\in\F_{q^2}^{n}$. We then characterize the Hermitian hull and Hermitian dual distance of $\C({\bf u},a)$ in terms of the position of ${\bf u}$ relative to $\C+\C^{\perp_{\rm H}}$ and the interaction between ${\bf u}$ and the minimum weight codewords of $\C^{\perp_{\rm H}}$, respectively. We obtain explicit criteria to independently control the expected Hermitian hull dimension and Hermitian dual distance of $\C({\bf u},a)$. In particular, several conditions for simultaneously increasing the Hermitian hull dimension and the Hermitian dual distance of $\C({\bf u},a)$ are derived. Applying these results to the Hermitian construction for EAQECCs gives us $267$ new EA qubit codes of lengths $n \leq 40$ and $14$ new EA qutrit codes of lengths $n \leq 25$ compared to the best-known codes in Grassl's code tables and the imporvements recorded in very recent works in the literature. Among the new parameter sets, we confirm improvements for $236$ qubit and $8$ qutrit codes.

cs.ITCross-listedarXiv:2607.02170•Jul 3, 2026•0 citations

Construction of linear codes with various Hermitian hull dimensions and related EAQECCs

Ruowen Liu, Shitao Li, Minjia Shi

The hull of a linear code is the intersection of the code and its dual code, which is effective for determining parameters of entanglement-assisted quantum error-correcting codes (EAQECCs). There are few constructions of linear codes with various Hermitian hull dimensions, aside from Hermitian LCD and self-orthogonal codes. The object of this paper is to introduce a building-up construction for constructing linear $ [n+2, k+1] $ codes with $ \ell $ or $ (\ell+1) $-dimensional Hermitian hull from a given linear $ [n, k] $ code with $ \ell $-dimension Hermitian hull of a smaller length. This construction includes the converse of the famous shortening technique as a special case. Using this method, we construct optimal quaternary linear codes of lengths up to 13 with Hermitian hull dimensions 2-5. As an application, we construct many EAQECCs, which improve the parameters of EAQECCs of Grassl's code table.

Advances in Mathematics of Communications•Mar 29, 2024•4 citations

Entanglement-Assisted and Subsystem Quantum Codes: New Propagation Rules and Constructions

Gaojun Luo, Martianus Frederic Ezerman, San Ling

This paper proposes new propagation rules on quantum codes in the entanglement-assisted and in quantum subsystem scenarios. The rules lead to new families of such quantum codes whose parameters are demonstrably optimal. To obtain the results, we devise tools to puncture and shorten codes in ways that ensure their Hermitian hulls have certain desirable properties. More specifically, we give a general framework to construct $k$-dimensional generalized Reed-Solomon codes whose Hermitian hulls are $(k-1)$-dimensional maximum distance separable codes.

arXiv:2206.09782•Jun 20, 2022•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•0 citations
We study the Hermitian hulls of matrix product codes and use them to design linear codes with arbitrary hull dimensions. We continue by looking into some propagation rules that preserve the hull dimensions ofF4\mathbb{F}_{4}F4​-linear codes. We propose a recursive method to keep the Hermitian hull dimension fixed while increasing the dimensions or the minimum distances of codes built from a givenF4\mathbb{F}_{4}F4​-linear code. Using the Hermitian construction route, we derive good entanglement-assisted quantum codes from matrix product codes and recursively iterated codes.
We prove that any Hermitian self-orthogonal [n,k,d]q2[n,k,d]_{q^2}[n,k,d]q2​ code gives rise to an [n,k,d]q2[n,k,d]_{q^2}[n,k,d]q2​ code with ℓ\ellℓ dimensional Hermitian hull for 0≤ℓ≤k0\le \ell \le k0≤ℓ≤k. We present a new method to construct Hermitian self-orthogonal [n,k]q2[n,k]_{q^2}[n,k]q2​ codes with large dimensions k>n+q−1q+1k>\frac{n+q-1}{q+1}k>q+1n+q−1​. New families of Hermitian self-orthogonal codes with good parameters are obtained; more precisely those containing almost MDS codes. By applying a puncturing technique to Hermitian self-orthogonal codes, MDS [n,k]q2[n,k]_{q^2}[n,k]q2​ linear codes with Hermitian hull having large dimensions k>n+q−1q+1k>\frac{n+q-1}{q+1}k>q+1n+q−1​ are also derived. New families of MDS, almost MDS and optimal codes with arbitrary Hermitian hull dimensions are explicitly constructed from algebraic curves. As an application, we provide entanglement-assisted quantum error correcting codes with new parameters.
We craft a special class of unitary matrices overFq2\mathbb{F}q^{2}Fq2to generate classical linear codes whose Hermitian hulls have dimensions that we can design. We then use the codes as classical ingredients in the construction of good entanglement-assisted quantum codes. Over finite fields of characteristic 2, we propose two explicit constructions. To highlight their efficacy, we list excellent qubit codes whose parameters are either new or strictly better than comparable best-known codes in the literature.
We prove that any generalized extended code is monomially equivalent to the Hermitian dual of a code which is closely related to a second kind of extended code of $\C^{\perp_{\rm H}}$. Every [n+1,k+1]q2[n+1,k+1]_{q^2}[n+1,k+1]q2​ linear code $\D$ with $d(\D^{\perp_{\rm H}})>1$ is monomially equivalent to the generalized extended code $\C({\bf u},a)$ of an [n,k]q2[n,k]_{q^2}[n,k]q2​ linear code $\C$ for a fixed $a\in\F_{q^2}^{*}$ and some ${\bf u}\in\F_{q^2}^{n}$. We then characterize the Hermitian hull and Hermitian dual distance of $\C({\bf u},a)$ in terms of the position of u{\bf u}u relative to $\C+\C^{\perp_{\rm H}}$ and the interaction between u{\bf u}u and the minimum weight codewords of $\C^{\perp_{\rm H}}$, respectively. We obtain explicit criteria to independently control the expected Hermitian hull dimension and Hermitian dual distance of $\C({\bf u},a)$. In particular, several conditions for simultaneously increasing the Hermitian hull dimension and the Hermitian dual distance of $\C({\bf u},a)$ are derived. Applying these results to the Hermitian construction for EAQECCs gives us 267267267 new EA qubit codes of lengths n≤40n \leq 40n≤40 and 141414 new EA qutrit codes of lengths n≤25n \leq 25n≤25 compared to the best-known codes in Grassl's code tables and the imporvements recorded in very recent works in the literature. Among the new parameter sets, we confirm improvements for 236236236 qubit and 888 qutrit codes.
The hull of a linear code is the intersection of the code and its dual code, which is effective for determining parameters of entanglement-assisted quantum error-correcting codes (EAQECCs). There are few constructions of linear codes with various Hermitian hull dimensions, aside from Hermitian LCD and self-orthogonal codes. The object of this paper is to introduce a building-up construction for constructing linear $ [n+2, k+1] $ codes with $ \ell $ or $ (\ell+1) $-dimensional Hermitian hull from a given linear $ [n, k] $ code with $ \ell $-dimension Hermitian hull of a smaller length. This construction includes the converse of the famous shortening technique as a special case. Using this method, we construct optimal quaternary linear codes of lengths up to 13 with Hermitian hull dimensions 2-5. As an application, we construct many EAQECCs, which improve the parameters of EAQECCs of Grassl's code table.
This paper proposes new propagation rules on quantum codes in the entanglement-assisted and in quantum subsystem scenarios. The rules lead to new families of such quantum codes whose parameters are demonstrably optimal. To obtain the results, we devise tools to puncture and shorten codes in ways that ensure their Hermitian hulls have certain desirable properties. More specifically, we give a general framework to construct kkk-dimensional generalized Reed-Solomon codes whose Hermitian hulls are (k−1)(k-1)(k−1)-dimensional maximum distance separable codes.
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​​⌉.