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

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

Yang Li, Martianus Frederic Ezerman, Shitao Li, San Ling, Zhonghua Sun

cs.ITquant-phSubmitted Jul 2, 2026• Announced Jul 3, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

Related papers

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•5 citations

Hermitian Hulls of Cyclic Codes and Exact Dual Distances of Extended Linear Codes

Liangdong Lu, Ruipan Yang, Yang Liu +2 more

Let $\mathcal{C}$ be an $[n,k,d]$ linear code over $\F_{q^2}$ with parity-check matrix $H$. The rank $r=\Rank(HH^{\dagger})$ measures how far the Hermitian dual $\mathcal{C}^{\perp_h}$ is from being Hermitian self-orthogonal, and it is the least number of coordinates that must be adjoined to $\mathcal{C}^{\perp_h}$ to make it Hermitian self-orthogonal; equivalently, the Hermitian hull $\mathcal{C}\cap\mathcal{C}^{\perp_h}$ has dimension $(n-k)-r$. In this paper, we develop a structure theory of the Hermitian hull of a cyclic code and apply it to the construction of quantum stabilizer codes. For a cyclic code with defining set $T\subseteq\mathbb{Z}_n$, we show that $r$ is additive over the orbits of the involution $τ(ν)=-qν$ on the $q^2$-cyclotomic cosets and satisfies a parity constraint. A parameter dictionary exhibits $r$ as a gauge trading one-for-one against the code length, and a complementation duality shows that the complement of $T$ realises the logical-qubit count of the quantum code. The extreme values of $r$ are settled by closed subset-sum criteria, and the $τ$-invariant defining sets are shown to be the unique locus on which the Hermitian dual is again cyclic. On the distance side, we determine the Hermitian dual distance of an $r$-fold extension of an arbitrary linear code exactly, and we prove that the admissible extension vectors lie in the image of $HH^{\dagger}$, which reduces the search space from $q^{2(n-k)}$ to $q^{2r}$. Applied to cyclic, quasi-cyclic and BCH codes, the construction improves $23$ best-known parameters in Grassl's code tables, one of them provably optimal.

cs.ITCross-listedarXiv:2607.12242•Jul 15, 2026•0 citations

Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs

Weijun Fang, Fang-Wei Fu, Lanqiang Li +1 more

In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the dimensions of their Euclidean hulls or Hermitian hulls. It turns out that the dimensions of Euclidean hulls or Hermitian hulls of the codes in our constructions can take all or almost all possible values. As a consequence, we can apply our results to entanglement-assisted quantum error-correcting codes (EAQECCs) and obtain several new families of MDS EAQECCs with flexible parameters. The required number of maximally entangled states of these MDS EAQECCs can take all or almost all possible values. Moreover, several new classes of q-ary MDS EAQECCs of length n > q+1 are also obtained.

arXiv:1812.09019•IEEE Transactions on Information Theory•Oct 30, 2019•114 citations

On the Hermitian Hulls of One-Point Algebraic Geometry Codes and Their Application to EAQECCs

Lin Sok, San Ling

Algebraic geometry (AG) codes are an important class of linear codes for building standard quantum error-correcting codes (QECCs) when the Hermitian approach is applied to the former codes. Determining the Hermitian dual of an AG code remains an open problem in classical coding theory. Because of the lack of formulae for the Hermitian dual of an AG code, its Euclidean dual is used to derive its Hermitian dual, and this reduces the dimension and minimum distance of the classical code when the self-orthogonal condition is required, resulting in QECCs with small quantum distances. This lack also gives a challenge to constructing other types of quantum codes, such as entanglement-assisted quantum error-correcting codes (EAQECCs). In this article, we study the Hermitian hulls of one-point AG codes of a specific type, where we focus on the dimensions of the hulls. We provide several lower bounds on the hull dimensions of the one-point AG code and give explicit constructions. From AG codes with lower-bounded Hermitian hull dimensions, we derive a number of families of entanglement-assisted quantum codes from one-point AG codes, using the Hermitian approach and some propagation rules.

IEEE Transactions on Information Theory•Jan 1, 2026•0 citations

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•1 citation

MDS Codes With Galois Hulls of Arbitrary Dimensions and the Related Entanglement-Assisted Quantum Error Correction

Meng Cao

Let$q=p^{e}$be a prime power and$\ell $be an integer with$0\leq \ell \leq e-1$. The$\ell $-Galois hull of classical linear codes is a generalization of the Euclidean hull and Hermitian hull. We provide a necessary and sufficient condition under which a codeword of a GRS code or an extended GRS code belongs to its$\ell $-Galois dual code, generalizing both the Euclidean case and Hermitian case in the literature. By using four different tools: 1) the norm mapping from$\mathbb {F}_{q}^{\ast }$to$\mathbb {F}_{p^{\ell }}^{\ast }$; 2) the direct product of two cyclic subgroups; 3) the coset decomposition of a cyclic group; 4) an additive subgroup of$\mathbb {F}_{q}$and its cosets, we construct eleven families of$q$-ary MDS codes with$\ell $-Galois hulls of arbitrary dimensions, and give the related eleven families of$[[n,k,d;c]]_{q}$entanglement-assisted quantum error-correcting codes (EAQECCs) with relatively large minimum distance in the sense that$2d=n-k+2+c$. We show that developing the theory on$\ell $-Galois hulls of$q$-ary MDS codes in this paper enables us to obtain new$q$-ary EAQECCs with different kinds of length sets via different$\ell $, where$2\ell \mid e$.

IEEE Transactions on Information Theory•Oct 6, 2021•51 citations
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⊥H\C^{\perp_{\rm H}}\C⊥H​. Every [n+1,k+1]q2[n+1,k+1]_{q^2}[n+1,k+1]q2​ linear code \D\D\D with d(\D⊥H)>1d(\D^{\perp_{\rm H}})>1d(\D⊥H​)>1 is monomially equivalent to the generalized extended code \C(u,a)\C({\bf u},a)\C(u,a) of an [n,k]q2[n,k]_{q^2}[n,k]q2​ linear code \C\C\C for a fixed a∈\Fq2∗a\in\F_{q^2}^{*}a∈\Fq2∗​ and some u∈\Fq2n{\bf u}\in\F_{q^2}^{n}u∈\Fq2n​. We then characterize the Hermitian hull and Hermitian dual distance of \C(u,a)\C({\bf u},a)\C(u,a) in terms of the position of u{\bf u}u relative to \C+\C⊥H\C+\C^{\perp_{\rm H}}\C+\C⊥H​ and the interaction between u{\bf u}u and the minimum weight codewords of \C⊥H\C^{\perp_{\rm H}}\C⊥H​, respectively. We obtain explicit criteria to independently control the expected Hermitian hull dimension and Hermitian dual distance of \C(u,a)\C({\bf u},a)\C(u,a). In particular, several conditions for simultaneously increasing the Hermitian hull dimension and the Hermitian dual distance of \C(u,a)\C({\bf u},a)\C(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.
Let C\mathcal{C}C be an [n,k,d][n,k,d][n,k,d] linear code over $\F_{q^2}$ with parity-check matrix HHH. The rank $r=\Rank(HH^{\dagger})$ measures how far the Hermitian dual C⊥h\mathcal{C}^{\perp_h}C⊥h​ is from being Hermitian self-orthogonal, and it is the least number of coordinates that must be adjoined to C⊥h\mathcal{C}^{\perp_h}C⊥h​ to make it Hermitian self-orthogonal; equivalently, the Hermitian hull C∩C⊥h\mathcal{C}\cap\mathcal{C}^{\perp_h}C∩C⊥h​ has dimension (n−k)−r(n-k)-r(n−k)−r. In this paper, we develop a structure theory of the Hermitian hull of a cyclic code and apply it to the construction of quantum stabilizer codes. For a cyclic code with defining set T⊆ZnT\subseteq\mathbb{Z}_nT⊆Zn​, we show that rrr is additive over the orbits of the involution τ(ν)=−qντ(ν)=-qντ(ν)=−qν on the q2q^2q2-cyclotomic cosets and satisfies a parity constraint. A parameter dictionary exhibits rrr as a gauge trading one-for-one against the code length, and a complementation duality shows that the complement of TTT realises the logical-qubit count of the quantum code. The extreme values of rrr are settled by closed subset-sum criteria, and the τττ-invariant defining sets are shown to be the unique locus on which the Hermitian dual is again cyclic. On the distance side, we determine the Hermitian dual distance of an rrr-fold extension of an arbitrary linear code exactly, and we prove that the admissible extension vectors lie in the image of HH†HH^{\dagger}HH†, which reduces the search space from q2(n−k)q^{2(n-k)}q2(n−k) to q2rq^{2r}q2r. Applied to cyclic, quasi-cyclic and BCH codes, the construction improves 232323 best-known parameters in Grassl's code tables, one of them provably optimal.
In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the dimensions of their Euclidean hulls or Hermitian hulls. It turns out that the dimensions of Euclidean hulls or Hermitian hulls of the codes in our constructions can take all or almost all possible values. As a consequence, we can apply our results to entanglement-assisted quantum error-correcting codes (EAQECCs) and obtain several new families of MDS EAQECCs with flexible parameters. The required number of maximally entangled states of these MDS EAQECCs can take all or almost all possible values. Moreover, several new classes of q-ary MDS EAQECCs of length n > q+1 are also obtained.
Algebraic geometry (AG) codes are an important class of linear codes for building standard quantum error-correcting codes (QECCs) when the Hermitian approach is applied to the former codes. Determining the Hermitian dual of an AG code remains an open problem in classical coding theory. Because of the lack of formulae for the Hermitian dual of an AG code, its Euclidean dual is used to derive its Hermitian dual, and this reduces the dimension and minimum distance of the classical code when the self-orthogonal condition is required, resulting in QECCs with small quantum distances. This lack also gives a challenge to constructing other types of quantum codes, such as entanglement-assisted quantum error-correcting codes (EAQECCs). In this article, we study the Hermitian hulls of one-point AG codes of a specific type, where we focus on the dimensions of the hulls. We provide several lower bounds on the hull dimensions of the one-point AG code and give explicit constructions. From AG codes with lower-bounded Hermitian hull dimensions, we derive a number of families of entanglement-assisted quantum codes from one-point AG codes, using the Hermitian approach and some propagation rules.
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.
Letq=peq=p^{e}q=pebe a prime power and$\ell $be an integer with0≤ℓ≤e−10\leq \ell \leq e-10≤ℓ≤e−1. The$\ell −GaloishullofclassicallinearcodesisageneralizationoftheEuclideanhullandHermitianhull.WeprovideanecessaryandsufficientconditionunderwhichacodewordofaGRScodeoranextendedGRScodebelongstoits-Galois hull of classical linear codes is a generalization of the Euclidean hull and Hermitian hull. We provide a necessary and sufficient condition under which a codeword of a GRS code or an extended GRS code belongs to its−GaloishullofclassicallinearcodesisageneralizationoftheEuclideanhullandHermitianhull.WeprovideanecessaryandsufficientconditionunderwhichacodewordofaGRScodeoranextendedGRScodebelongstoits\ell −Galoisdualcode,generalizingboththeEuclideancaseandHermitiancaseintheliterature.Byusingfourdifferenttools:1)thenormmappingfrom-Galois dual code, generalizing both the Euclidean case and Hermitian case in the literature. By using four different tools: 1) the norm mapping from−Galoisdualcode,generalizingboththeEuclideancaseandHermitiancaseintheliterature.Byusingfourdifferenttools:1)thenormmappingfrom\mathbb {F}_{q}^{\ast }tototo\mathbb {F}_{p^{\ell }}^{\ast };2)thedirectproductoftwocyclicsubgroups;3)thecosetdecompositionofacyclicgroup;4)anadditivesubgroupof; 2) the direct product of two cyclic subgroups; 3) the coset decomposition of a cyclic group; 4) an additive subgroup of;2)thedirectproductoftwocyclicsubgroups;3)thecosetdecompositionofacyclicgroup;4)anadditivesubgroupof\mathbb {F}_{q}anditscosets,weconstructelevenfamiliesofand its cosets, we construct eleven families ofanditscosets,weconstructelevenfamiliesofq−aryMDScodeswith-ary MDS codes with−aryMDScodeswith\ell −Galoishullsofarbitrarydimensions,andgivetherelatedelevenfamiliesof-Galois hulls of arbitrary dimensions, and give the related eleven families of−Galoishullsofarbitrarydimensions,andgivetherelatedelevenfamiliesof[[n,k,d;c]]_{q}$entanglement-assisted quantum error-correcting codes (EAQECCs) with relatively large minimum distance in the sense that2d=n−k+2+c2d=n-k+2+c2d=n−k+2+c. We show that developing the theory on$\ell −Galoishullsof-Galois hulls of−Galoishullsofq−aryMDScodesinthispaperenablesustoobtainnew-ary MDS codes in this paper enables us to obtain new−aryMDScodesinthispaperenablesustoobtainnewq−aryEAQECCswithdifferentkindsoflengthsetsviadifferent-ary EAQECCs with different kinds of length sets via different−aryEAQECCswithdifferentkindsoflengthsetsviadifferent\ell $, where2ℓ∣e2\ell \mid e2ℓ∣e.