Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions

Impact Assessment

Core Contribution. This paper introduces entanglement-assisted quantum locally recoverable codes (EAQLRCs), unifying two previously separate lines of work: entanglement-assisted quantum error correction (EAQECCs, Brun et al. 2006) and quantum locally recoverable codes (qLRCs, Golowich–Guruswami 2025). The central insight is that pre-shared, noiseless entanglement removes the dual-containing/self-orthogonality constraint that CSS-like and Hermitian-like qLRC constructions impose on the underlying classical codes. Because optimal classical LRCs rarely satisfy dual-containment, existing qLRC constructions cannot exploit the best classical designs; EAQLRCs sidestep this. The paper delivers a complete theoretical package: (i) a formal locality definition for EAQECCs accounting for Bob's reliable register, (ii) a sufficient support-condition characterization for entanglement-assisted stabilizer codes to have locality *r* (Thm 1), (iii) a CSS-like construction from two arbitrary classical codes (Thm 2), (iv) a locality upper bound (Thm 3) and a Singleton-like bound (Thm 4) with a tight optimality characterization for pure codes (Thm 5), and (v) two explicit optimal families from ℓ-intersection MDS pairs and block parity-check matrices. These are claimed as the first explicit EAQLRC families.

Methodological Rigor. The theoretical development is careful and internally consistent. Definitions build logically (quantum channel model of erasure, recovery sets, extended stabilizer supports), and the proof of Theorem 1—constructing a local recovery channel by distinguishing Pauli errors via commutation relations with extended stabilizers—is technically sound and well-executed, including the nondegeneracy argument for the trace form. The bounds derivations follow standard puncturing/Singleton arguments adapted from prior qLRC work (refs [28],[29]). The optimality criterion (Thm 5) is derived as a clean equality-condition analysis. The two constructions are supported by fully worked examples (Examples 1, 2) that a reader can verify by hand, and the parameter exclusions are stated precisely. The techniques, however, are largely assemblies of established tools (EA-CSS construction [13], ℓ-intersection MDS pairs [20], block parity-check GRS constructions [28]); the mathematical machinery is competent rather than novel.

Potential Impact. The impact is real but confined to a small, though currently active, subfield. qLRCs themselves are a nascent topic (the seminal paper is from SODA 2025), and this paper opens a natural adjacent direction that others will likely mine—much as the original EAQECC paper spawned a large literature. The framework (Steps 1–3, using a diagonal matrix D to tune entanglement consumption *c* while preserving support conditions) is genuinely reusable and will plausibly generate follow-up constructions from other classical LRC families (BCH, Tamo–Barg, matrix-product), mirroring the trajectory already visible in the qLRC citations. Practical/translational impact is minimal: large-scale quantum storage does not yet exist, and the "noiseless Bob register" assumption is an idealization. This is a foundational-theory contribution, not a deployable technology.

Timeliness & Relevance. Highly timely. The paper directly targets a recognized bottleneck—the dual-containing constraint that excludes optimal classical LRCs—identified in the very recent qLRC literature. The extensive and up-to-date reference list (many 2025–2026 preprints) signals a fast-moving area where being first to define EAQLRCs carries citation value.

Strengths. (1) Clear identification of a genuine limitation in existing qLRC constructions and a principled fix. (2) A complete theory—definition, characterization, two bounds, tight optimality criterion, general framework, and explicit optimal families—rather than a fragment. (3) Well-organized exposition with precise parameter conditions and verifiable examples. (4) First-mover status on a new code class.

Limitations. (1) Conceptual novelty is moderate: combining entanglement assistance with locality is a natural, somewhat expected extension once both ingredients exist, and every major technique is borrowed. (2) Results are unsurprising—the bounds and constructions parallel their non-entanglement analogues closely. (3) Scope is limited to CSS-like constructions; no Hermitian-like or more general stabilizer treatment, and the locality conditions are only sufficient (as the authors note, actual minimum locality could be smaller). (4) The idealized noiseless-entanglement model limits physical relevance. (5) No treatment of impure optimal codes beyond the bound statement, and the framework's reliance on finding suitable diagonal matrices D is somewhat ad hoc.

Additional Observations. The work is reproducible in the mathematical sense—all constructions are explicit and examples are checkable—but requires no computational resources. It is squarely within the classical/quantum coding-theory community; its interdisciplinary reach is narrow. It neither refutes nor replicates prior contested claims; it extends the frontier. As a foundational building block for a young subfield, its main value lies in defining a new object and providing the first templates others will extend.

Overall, this is a solid, well-crafted theoretical paper that will be cited and built upon within the qLRC/EAQECC community, but its influence is unlikely to extend far beyond that subfield, and its methods are incremental combinations of known tools.