Entanglement assisted quantum $(r,δ)$-locally recoverable codes

AI summary

Overview

Research area: Quantum information theory, specifically quantum error-correcting codes with locality — the intersection of algebraic coding theory (finite fields, Hermitian/Euclidean/symplectic inner products) and quantum stabilizer codes.

Technical level: Advanced. The paper assumes fluency in classical coding theory (punctured and shortened codes, dual codes, BCH codes, algebraic-geometry-type evaluation codes) and in the stabilizer formalism with entanglement assistance.

Scope (one sentence): The paper defines entanglement-assisted quantum $(r,\delta)$-locally recoverable codes, characterizes them through purely classical algebraic conditions, proves a Singleton-like bound for the Hermitian and Euclidean constructions, and builds optimal pure families from bivariate $J$-affine variety codes, BCH codes, and homothetic-BCH codes.

What This Paper Is About

Classical $(r,\delta)$-locally recoverable codes let a storage system repair up to $\delta-1$ simultaneous erasures by reading only $r+\delta-1$ positions, including the erased ones. The quantum analogue of this notion was recently formulated for stabilizer codes, but it inherited the restrictive self-orthogonality (or dual-containment) condition that blocks many classical codes from becoming quantum codes. This paper removes that obstacle by allowing the sender and receiver to pre-share maximally entangled qudit pairs, so that local recovery is assisted by receiver-held qudits that are never erased — thereby extending the reach of quantum local recovery to arbitrary linear codes.

Key Contributions

1. A new code class: EA $(r,\delta)$-QLRCs. Definitions 3.1 and 3.2 introduce entanglement-assisted quantum $(I,K)$-local recoverability and entanglement-assisted quantum $(r,\delta)$-locally recoverable codes, generalizing the standard quantum $(r,\delta)$-LRC definition. Recovery is performed on the set $K \cup {n+1,\dots,n+c}$, i.e., the recovery set plus the $c$ receiver-held halves of the entangled pairs.

2. A choice-independent characterization. Theorem 3.4 proves that an EAQECC $Q'(C)$ is $(I,K)$-locally recoverable if and only if $\sigma_I[\pi_K(C^{\perp_s})] = \sigma_I(C \cap C^{\perp_s})$ — a condition involving only the classical code $C$ and its symplectic dual, not the auxiliary code $C'$ used to build the encoder. This shows the definition does not depend on which $C'$ is chosen.

3. A bridge between classical and quantum local recoverability. Corollaries 3.6 and 3.8 translate Theorem 3.4 to the Hermitian and Euclidean inner products, replacing self-orthogonality by dual-containment, and connect classical $(r,\delta)$-local recoverability of a code to the entanglement-assisted quantum property of the code built from it.

4. A Singleton-like bound for the entanglement-assisted setting (Corollary 3.9). Pure EA $(r,\delta)$-QLRCs attaining this bound are defined as optimal, and Sections 4 and 5 construct optimal pure families from bivariate $J$-affine variety codes, BCH codes, and homothetic-BCH codes.

Main Findings

• Recovery condition reduces to puncturing and shortening. The quantum local-recovery property of the entanglement-assisted code is exactly an equality between a shortened punctured dual code and a shortened intersection $C \cap C^{\perp_s}$. No quantum-specific quantity needs to be computed directly.

• Entanglement assistance bypasses self-orthogonality. Because the auxiliary code $C' \subseteq \mathbb{F}q^{2(n+c)}$ carries the self-orthogonality requirement ($C' \subseteq C'^{\perp_s}$) while $C$ is only required to be the projection $\pi{{1,\dots,n}}(C')$, the classical code $C$ used for the data can be arbitrary. This is the structural reason the framework is more flexible than standard quantum $(r,\delta)$-LRCs.

• The ER receiver's halves are assumed erasure-free. The definitions explicitly assume the $c$ qudits held by the receiver are unaffected by erasures, which is what allows the local recovery operation to act on $K \cup {n+1,\dots,n+c}$ rather than on data coordinates alone.

• A Singleton-like bound governs optimality. For codes from Hermitian or Euclidean dual-containing constructions, the bound of Corollary 3.9 constrains the parameters; codes meeting it with equality are called optimal. The paper states that every code constructed in Sections 4 and 5 attains this bound with equality.

• Optimal pure families exist in three code classes. Section 4 uses bivariate $J$-affine variety codes with the Euclidean inner product. Section 5.1 uses BCH codes via Propositions 5.6, 5.8 and 5.10, yielding two Euclidean families (Theorems 5.11 and 5.12) and one Hermitian family (Theorem 5.15). Section 5.2 uses homothetic-BCH codes via Corollary 5.17 and Propositions 5.19, 5.20 and Theorems 5.21, 5.22, 5.23.

• Comparison with concurrent work. A concurrent framework with availability $t$ appeared in a separate paper; the present Definition 3.2 is a special case of it. The authors argue their Theorem 3.4 implies that concurrent paper's sufficient conditions, and since their codes meet their Singleton-like bound with equality when availability $t=1$, they are at least as good for single availability, while additionally permitting the Hermitian inner product.

• Explicit numerical parameters of the constructed code families are not reported in the available excerpt. The truncation cuts off before Sections 4 and 5, so lengths, dimensions, distances, and entanglement counts for specific codes cannot be cited here.

Methodology in Plain English

The authors work entirely at the level of classical linear codes over finite fields and use known dictionaries that convert such codes into quantum stabilizer codes — one dictionary for the symplectic inner product on $\mathbb{F}q^{2n}$, one for the Hermitian inner product on $\mathbb{F}{q^2}^n$, and one for the Euclidean inner product on $\mathbb{F}_q^n$.

Their strategy is a reduction. An entanglement-assisted code is built from an auxiliary self-orthogonal code $C'$ of length $n+c$ whose projection onto the first $n$ coordinates is the "data" code $C$. Instead of analyzing the quantum recovery channel directly, they apply the existing characterization of ordinary quantum $(I,K)$-local recoverability to the stabilizer code determined by $C'$, and then push the condition down through the projection to obtain an identity involving only $C$ and $C^{\perp_s}$. This is how they obtain both a characterization theorem and, by counting dimensions, a bound on the parameters.

To show the framework is not vacuous, they then mine three well-understood families of evaluation codes — bivariate $J$-affine variety codes, BCH codes, and homothetic-BCH codes (enlargements of BCH codes) — and verify, case by case, that the relevant dual or dual-containing code is a classical $(r,\delta)$-LRC, that the entanglement count from Theorem 2.5 can be computed, that purity holds, and that the Singleton-like bound is met with equality.

Why This Matters

Impact on research. Quantum local recovery has been constrained by the same self-orthogonality bottleneck that entanglement assistance removed for ordinary quantum codes. This paper supplies the missing general framework, a characterization theorem that is checkable with classical algebra, and a bound that gives a clear notion of optimality — plus a demonstration that the bound is achievable in three independent code families. It also clarifies the relationship to concurrent work on locality with availability.

Real-world applications (speculative, as the paper frames them):

• Fault-tolerant quantum memory in distributed quantum computers, where a failing qudit register must be repaired from a small number of neighbors.
• Quantum cloud storage and quantum repeaters, where repairing a lost node without global decoding is essential for latency.
• Quantum networks with pre-shared entanglement, a resource that entanglement-assisted protocols assume is already available.
• Quantum data centers, where node failures are routine and local repair limits bandwidth.

Industry relevance. The motivation is explicitly industrial: the paper cites large-scale cloud and distributed storage as the origin of classical LRCs, notes the substantial corporate investment in quantum hardware, and argues that quantum data storage is becoming a plausible future paradigm in which locality constraints will matter for the same operational reasons they matter classically.

Future Directions

• Availability greater than one. The concurrent framework allows availability $t$; the present definition corresponds to $t=1$. Extending the characterization and the Singleton-like bound to general availability, and determining whether the bound remains tight, is the obvious next step.
• Impure codes. The paper notes that impure quantum codes have recently been shown to beat bounds for pure codes in quantum local recovery. Whether impure EA $(r,\delta)$-QLRCs can exceed the bound of Corollary 3.9 is left open.
• The CSS-only special case. The earlier work on entanglement-assisted locality treated only $\delta=2$ and only CSS codes. Whether the general framework yields improvements for that restricted regime, and how the CSS structure interacts with the new bound, remains to be worked out.
• Other code families. Since the method requires only that a classical dual be a $(r,\delta)$-LRC, one can ask which other families — algebraic-geometry codes, polar codes, or codes over rings — admit optimal pure EA $(r,\delta)$-QLRCs under the Euclidean or Hermitian construction.

Target Audience

Researchers in quantum error correction and algebraic coding theory, particularly those working on quantum locality, entanglement-assisted codes, or evaluation-code constructions. It is also relevant to engineers designing fault-tolerant quantum memory hierarchies who need to know what repair guarantees are provable, and to graduate students with a coding-theory background looking for a worked example of translating a classical property into a quantum one. Beginners will find the preliminaries in Section 2 useful but will need substantial background in finite-field coding theory to follow Sections 3 through 5.

Authors’ abstract

Quantum $(r,δ)$-locally recoverable codes are quantum error-correcting codes capable of correcting $δ-1$ qudit erasures within one subset of qudits of cardinality at most $r+δ-1$. In this paper, we introduce the more general framework of entanglement-assisted quantum $(r,δ)$-locally recoverable codes, assuming that the local recovery operation is assisted by receiver-held qudits that remain unaffected by erasures. We establish necessary and sufficient conditions for these codes to satisfy this property. For codes derived from Hermitian or Euclidean constructions, we establish connections between entanglement-assisted quantum and classical notions of $(r,δ)$-local recoverability, and derive a Singleton-like bound. Furthermore, we construct optimal pure entan\-gle\-ment-assisted quantum $(r,δ)$-locally recoverable codes from several families of classical codes, including bivariate $J$-affine variety codes, BCH codes, and homothetic-BCH codes.