Pith. sign in

REVIEW 5 minor 1 cited by

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

T0 review · 0 major / 5 minor · reviewed 2026-07-30 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Entanglement assistance removes dual-containing barriers and yields the first explicit optimal quantum locally recoverable codes.

desk verdict Solid first definition and constructions of EAQLRCs: dual-containing-free CSS route, Singleton-like bound with purity criterion, and two explicit optimal families with nontrivial locality. read the letter →

arxiv 2607.27091 v1 pith:KNGFMRRX submitted 2026-07-29 cs.IT math.IT

Yang Li , San Ling , Zhenliang Lu , Gaojun Luo , Shixin Zhu This is my paper · ORCID
classification cs.ITmath.IT MSC 94B0594B3581P45
keywords locallyrecoverablecodeentanglement-assistedquantumCSSconstructionℓ-intersectionpairblockparity-checkmatrixSingleton-likebounderasurecorrection
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Standard quantum locally recoverable codes force classical ingredients to be dual-containing or self-orthogonal, so many well-designed classical LRCs cannot be used. This paper defines entanglement-assisted quantum LRCs (EAQLRCs), in which pre-shared noiseless entanglement halves let the quantum code be built from two classical codes without that constraint. It gives sufficient support conditions on extended stabilizers for locality r, a CSS-like construction, an upper bound on locality, and a Singleton-like bound, plus exact conditions under which pure codes meet the bound. A general framework then turns pairs of classical LRCs into optimal pure EAQLRCs; applying it to MDS intersection pairs and block parity-check matrices produces two infinite families with flexible parameters and nontrivial localities—the first explicit EAQLRC families claimed in the literature.

What carries the argument

The CSS-like EA construction (Theorem 2) together with the three-step framework of Subsection 5.1: start from parity-check matrices of optimal classical LRCs that already satisfy paired dual supports, rescale one matrix by a nonsingular diagonal D to tune the entanglement count c = rank(HX D HZ⊤) while preserving supports and locality, then prove purity so the resulting pure EAQLRC meets the Singleton-like bound.

What would settle it

For the concrete parameters of Theorems 6 and 7 (or the worked Examples 1–2), compute the actual minimum recovery-set sizes of the resulting EA-CSS code and check whether 2δ equals n+c−κ−2⌈κ/r⌉+4 with that true r; any strict improvement in locality or failure of purity would break the optimality claim.

Watch

Extended reading notes

Core claim

Entanglement-assisted stabilizer codes admit locality r whenever, for each transmitted position, two extended stabilizers exist whose joint support outside that position has size at most r and whose local Pauli actions distinguish X and Z errors; from this the authors obtain a CSS-like EAQLRC construction from any two classical codes whose duals satisfy a paired-support condition, without dual-containing. Pure codes meeting the derived Singleton-like bound 2δ ≤ n+c−κ−2⌈κ/r⌉+4 are completely characterized, and two explicit infinite families attain that bound with nontrivial locality.

Load-bearing premise

Locality is only guaranteed by sufficient support conditions on stabilizers or dual codewords; the true minimum locality of a constructed code could be smaller than the r used to claim optimality.

Editorial extensions

If this is right

  • Any pair of optimal classical LRCs whose duals share small joint supports can be turned into an optimal pure EAQLRC without forcing dual-containing.
  • The diagonal rescaling D gives a systematic way to vary entanglement consumption c and logical dimension while keeping length, distance, and locality fixed.
  • ℓ-intersection MDS pairs yield optimal pure Jn, n+c−2d+2, d; cKq EAQLRCs of locality n−d+1 for a wide admissible range of c.
  • Block parity-check matrices yield optimal pure Ju(r+1), ur−2d+4+s, d; u+sKq EAQLRCs of locality r for 0≤s≤d−2 under the stated arithmetic conditions.
  • These constructions supply the first concrete benchmark families against which future EAQLRC bounds and constructions can be compared.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the locality certificate is only sufficient, a follow-up necessary-and-sufficient stabilizer criterion could shrink reported localities and tighten the Singleton-like bound for the same codes.
  • The same diagonal-tuning idea may lift other classical LRC families (Tamo–Barg, good polynomials, design-supported codes) into EAQLRCs once paired-support dual checks are arranged.
  • If impure EAQLRCs can be shown to beat the pure Singleton-like equality cases, the paper’s optimality framework would need an impure counterpart.
  • The entanglement-assisted setting suggests a natural next question: hierarchical or (r,δ)-locality for EAQLRCs, paralleling recent ordinary qLRC extensions.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. The paper introduces entanglement-assisted quantum locally recoverable codes (EAQLRCs), defining locality for EAQECCs so that a single transmitted-qudit erasure is recovered from at most r other transmitted qudits plus Bob’s noiseless entangled halves. It gives sufficient support conditions on extended stabilizers for an EASC to have locality r (Theorem 1), a CSS-like construction from two classical codes without dual-containing (Theorem 2 / Corollary 1), an upper bound on locality (Theorem 3), and a Singleton-like bound 2δ ≤ n+c−κ−2⌈κ/r⌉+4 for CSS-like EAQLRCs (Theorem 4), with necessary and sufficient conditions for pure codes to meet equality (Theorem 5). A three-step framework using a nonsingular diagonal matrix D to tune entanglement while preserving paired dual supports then yields two explicit infinite families of optimal pure CSS-like EAQLRCs: one from ℓ-intersection MDS pairs (Theorem 6) and one from block parity-check matrices with diagonal twists (Theorem 7), both with flexible parameters and nontrivial localities, claimed as the first explicit EAQLRC families.

Significance. The work cleanly removes the dual-containing bottleneck that has limited qLRC constructions from classical LRCs, and supplies the first explicit optimal pure EAQLRC families with nontrivial locality. The technical core is standard and carefully executed: Pauli commutation for local recovery, EA-CSS parameters via rank(H_X H_Z^T), locality upper bounds by column-basis counting, and Singleton-like optimality reduced to classical LRC Singleton plus pure-code ceiling conditions. The diagonal-D framework is a useful constructive device for adjusting c without breaking paired supports. If the claims hold—as the derivations indicate—they open a systematic route from the large literature on optimal cLRCs to quantum codes with local recovery under entanglement assistance, and they set concrete benchmarks for subsequent EAQLRC work.

minor comments (5)
  1. [§3–§5, Theorems 6–7] After Theorem 3 the paper correctly notes that Theorems 2–1 give only sufficient conditions, so the constructive r is an upper bound on true minimum locality, and optimality is relative to that r. A short explicit sentence in the abstract or the statement of Theorems 6–7 (e.g., “locality at most r”) would prevent readers from over-reading “locality r” as a proven minimum.
  2. [§5 / Conclusion] A compact parameter table comparing the new EAQLRC families (n, κ, δ, c, r) against the best known pure CSS/Hermitian qLRCs of similar length and distance would make the gain from entanglement assistance more visible; the text currently relies on narrative comparison.
  3. [Examples 1–2] In Example 1 the matrices are small enough that dim(C_X ∩ C'_Z)=1 and the Thm 3 bound equal to 4 can be stated as a one-line verification; likewise for Example 2. Adding these one-line checks in the examples would help readers confirm nontriviality without recomputing.
  4. [§2–§4] Notation: lab(G) and supp_Q(G) are introduced in §2 and used heavily in Theorem 1; a brief reminder at the start of §3.2 would ease reading. Also, the phrase “CSS-like EAQLRC” is used for both pure and impure codes from Theorem 2—consistent, but worth one clarifying sentence when the Singleton bound is stated for both.
  5. [Throughout / Theorem 7] Minor typographical/consistency items: AMS classification line is fine; ensure “EAQLRC” vs “EA-CSS code Q(C_X,C_Z)” is used consistently when purity is discussed; in Theorem 7 the condition r>2d−4≥2 is slightly dense—splitting “r≥3 and d≥3 with r>2d−4” may help.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: bounds are derived from classical LRC/EA-CSS formulas and optimality is constructive equality, not a fit or self-definitional loop.

full rationale

The paper introduces EAQLRCs, proves a sufficient locality criterion (Thm 1–2), derives a locality upper bound (Thm 3) and Singleton-like bound (Thm 4) from the classical LRC Singleton bound plus EA-CSS dimension/distance formulas, characterizes pure equality cases (Thm 5), and builds two explicit families (Thms 6–7) that meet those conditions via known MDS ℓ-intersection pairs and block parity-check cLRCs. Optimality means equality in a proved inequality under stated pure-code hypotheses; purity is forced by δ ≥ d from the construction against 2δ ≤ 2d from the bound. Background citations (EA-CSS, classical LRC bounds, MDS intersections, block matrices) supply independent lemmas, not the target EAQLRC families. There is no parameter fitting, no prediction-equals-input reduction, and no load-bearing uniqueness/ansatz imported from the authors’ own prior work that forces the central claim. The constructive locality is only a sufficient r (as the paper itself notes), which is a correctness/tightness caveat, not circularity.

Assumptions & free parameters 2 free parameters · 6 assumptions · 2 invented entities

Load-bearing content is standard quantum stabilizer / EA-CSS theory plus classical LRC Singleton, plus the modeling choice that Bob’s entangled halves are noiseless. Constructions inherit existence theorems for MDS ℓ-intersection pairs and block GRS LRCs from cited work. No fitted physical constants; free choices are discrete design parameters (n,d,c,r,s,u,q) inside proved ranges.

free parameters (2)
  • Entanglement count c and diagonal twist index s
    Discrete design parameters chosen inside proved intervals (e.g. max{0,2d−n−1}≤c≤d−1; 0≤s≤d−2) to hit target EAQLRC parameters; not fitted to external data.
  • Nonsingular diagonal matrix D (or D_s)
    Hand-chosen diagonal rescaling in the construction framework (Subsec 5.1, Eq 19) to adjust rank(H_X D H_Z^T)=c while preserving supports; existence is shown constructively for the families, not optimized against empirical loss.
assumptions (6)
  • domain assumption Bob’s c entangled qudits remain noiseless; only Alice’s n transmitted qudits suffer erasures (Def 1, Def 4–6).
    Standard EAQECC model (Brun et al.); locality counts only transmitted accesses but recovery may use B[c].
  • domain assumption EA-CSS parameters κ, δ, c from two classical codes via rank(H_X H_Z^T) and min distance formulas (Lemmas 3–4).
    Taken from Galindo et al. entanglement-assisted CSS theory; used throughout Thms 2–7.
  • standard math Classical LRC Singleton d ≤ n−k−⌈k/r⌉+2 (Lemma 2 / Gopalan et al.).
    Invoked to prove the quantum Singleton-like bound (Thm 4) and optimality criteria (Thm 5).
  • domain assumption Existence of MDS ℓ-intersection pairs under stated (q,n,k1,k2,ℓ) restrictions (Lemma 6 / Huang–Fang–Fu).
    Black-box input to Thm 6 family; paper does not reprove existence.
  • domain assumption Block GRS parity-check matrices yield optimal classical LRCs under the listed a_i/v_i conditions (Lemma 7 / Luo et al.).
    Black-box input to Thm 7; purity and EA rank computed on top.
  • standard math Finite-field Pauli commutation and F_q-linear extended stabilizer labels for EA-CSS codes (Eqs 2–6).
    Standard nonbinary stabilizer formalism; used to build the local recovery channel in Thm 1.
invented entities (2)
  • EAQLRC (entanglement-assisted quantum locally recoverable code) independent evidence
    purpose: Name and formalize locality for EAQECCs via recovery sets on transmitted qudits with access to Bob’s register (Defs 5–6).
    Definitional extension of qLRC + EAQECC; not a physical particle or force. Independent handle is the mathematical recovery condition (10).
  • Constructive framework with diagonal D adjusting c while preserving paired supports independent evidence
    purpose: Turn pairs of optimal cLRCs into pure EAQLRCs meeting Thm 5 equality (Subsec 5.1).
    Methodological device; validated by explicit rank calculations in Thms 6–7 and Examples 1–2.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions." pith.science (2026). https://pith.science/paper/KNGFMRRX

@misc{pith2026260727091,
  author       = {Pith},
  title        = {Pith review of: Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KNGFMRRX}},
  note         = {Machine review of arXiv:2607.27091}
}
abstract

Quantum locally recoverable codes (qLRCs) allow a single qudit erasure to be corrected by accessing only a small number of other qudits. Standard CSS and Hermitian constructions, however, impose dual-containing or self-orthogonal constraints on the underlying classical codes, thereby restricting the well-structured classical LRCs (cLRCs) that can be used to construct qLRCs. To relax these constraints, we introduce entanglement-assisted quantum locally recoverable codes (EAQLRCs) by assuming that halves of the pre-shared maximally entangled pairs are noiseless. We characterize sufficient support conditions on extended stabilizers under which entanglement-assisted stabilizer codes have locality $r$ and derive a CSS-like construction from two classical codes without imposing the ordinary dual-containing condition. We further establish an upper bound on locality and a Singleton-like bound for arbitrary CSS-like EAQLRCs, and characterize the pure codes attaining equality in the latter bound. These results yield a general framework for constructing optimal pure EAQLRCs from pairs of cLRCs. Applying this framework to $\ell$-intersection pairs of MDS codes and block parity-check matrices, we obtain two families of optimal pure CSS-like EAQLRCs with flexible parameters and nontrivial localities. To the best of our knowledge, these represent the first explicit families of EAQLRCs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability

    cs.IT 2026-08 conditional novelty 6.0 of 10

    Entanglement-assisted quantum locally recoverable codes can be constructed from arbitrary classical LRC pairs, and this paper proves bounds, optimality conditions, and explicit constructions for them.

Reference graph

Works this paper leans on

38 extracted references · 4 linked inside Pith · cited by 1 Pith paper

  1. [1]

    Anderson, E

    S.E. Anderson, E. Camps-Moreno, H.H. L´ opez, G.L. Matthews, D. Ruano, I. Soprunov, Relative hulls and quantum codes,IEEE Trans. Inf. Theory70 (2024) 3190–3201. 20

    2024

  2. [2]

    T.A. Brun, I. Devetak, M.-H. Hsieh, Correcting quantum errors with entanglement,Science 314 (2006) 436–439

    2006

  3. [3]

    K. Bu, W. Gu, X. Li, Quantum locally recoverable code with intersecting recovery sets, arXiv:2501.10354 (2025)

    arXiv 2025

  4. [4]

    Cadambe, A

    V.R. Cadambe, A. Mazumdar, Bounds on the size of locally recoverable codes,IEEE Trans. Inf. Theory61 (2015) 5787–5794

    2015

  5. [5]

    M. Cao, K. Zhou, An open problem on NSC quasi-unitary matrices and its application to quantum codes,IEEE Trans. Inf. Theory72 (2026) 3885–3898

    2026

  6. [6]

    M. Cao, K. Zhou, Optimal quantum ( r, δ)-locally repairable codes from matrix product codes, IEEE Trans. Inf. Theory(2026), early access, https://doi.org/10.1109/TIT.2026.3691784

    arXiv 2026

  7. [7]

    M. Cao, K. Zhou, Quantum codes and optimal pure quantum ( r, δ)-LRCs via the MP construction, arXiv:2606.14253 (2026)

    arXiv 2026

  8. [8]

    B. Chen, J. Huang, A construction of optimal ( r, δ)-locally recoverable codes,IEEE Access7 (2019) 180349–180353

    2019

Show all 38 references
  1. [9]

    Delfosse, G

    N. Delfosse, G. Z´ emor, Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel,Phys. Rev. Res.2 (2020) 033042

    2020

  2. [10]

    Galindo, F

    C. Galindo, F. Hernando, H. Mart ´ ın-Cruz, R. Matsumoto, Impure codes exceeding the pure bounds for quantum local recovery,Quantum Inf. Process.25 (2026) 241

    2026

  3. [11]

    Galindo, F

    C. Galindo, F. Hernando, H. Mart ´ ın-Cruz, R. Matsumoto, Quantum (r, δ)-locally recoverable codes,Finite Fields Appl.111 (2026) 102785

    2026

  4. [12]

    Galindo, F

    C. Galindo, F. Hernando, R. Matsumoto, Quantum ( r, δ)-locally recoverable BCH and homothetic BCH codes, arXiv:2601.22567 (2026)

    2026 arXiv

  5. [13]

    Galindo, F

    C. Galindo, F. Hernando, R. Matsumoto, D. Ruano, Entanglement-assisted quantum error- correcting codes over arbitrary finite fields,Quantum Inf. Process.18 (2019) 116

    2019

  6. [14]

    Galindo, F

    C. Galindo, F. Hernando, C. Munuera, D. Ruano, Optimal quantum locally recoverable codes from matrix product construction, arXiv:2310.15703 (2025)

    2025 arXiv

  7. [15]

    Golowich, V

    L. Golowich, V. Guruswami, Quantum locally recoverable codes, in:Proc. 2025 Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), SIAM, 2025, pp. 5512–5522

    2025

  8. [16]

    Gopalan, C

    P. Gopalan, C. Huang, H. Simitci, S. Yekhanin, On the locality of codeword symbols,IEEE Trans. Inf. Theory58 (2012) 6925–6934

    2012

  9. [17]

    Grassl, T

    M. Grassl, T. Beth, T. Pellizzari, Codes for the quantum erasure channel,Phys. Rev. A56 (1997) 33–38

    1997

  10. [18]

    Guruswami, R

    V. Guruswami, R. Kshirsagar, P. Trivedi, Quantum hierarchical locally recoverable codes, arXiv:2606.06736 (2026)

    2026 arXiv

  11. [19]

    Hsieh, I

    M.-H. Hsieh, I. Devetak, T.A. Brun, General entanglement-assisted quantum error-correcting codes,Phys. Rev. A76 (2007) 062313

    2007

  12. [20]

    Huang, W

    Z. Huang, W. Fang, F.-W. Fu, Linear ℓ-intersection pairs of MDS codes and their applications to AEAQECCs,Cryptogr. Commun.14 (2022) 1189–1206

    2022

  13. [21]

    Jin, Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes,IEEE Trans

    L. Jin, Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes,IEEE Trans. Inf. Theory65 (2019) 4658–4663

    2019

  14. [22]

    Ketkar, A

    A. Ketkar, A. Klappenecker, S. Kumar, P.K. Sarvepalli, Nonbinary stabilizer codes over finite fields,IEEE Trans. Inf. Theory52 (2006) 4892–4914

    2006

  15. [23]

    Knill, R

    E. Knill, R. Laflamme, Theory of quantum error-correcting codes,Phys. Rev. A55 (1997) 900–911

    1997

  16. [24]

    J. Li, L. Jin, C. Xing, Quantum locally recoverable codes with asymmetric locality,IEEE Trans. Inf. Theory(2026), early access, https://doi.org/10.1109/TIT.2026.3703812

    2026

  17. [25]

    Y. Li, S. Li, H. Lao, G. Luo, S. Ling, On optimal quantum LRCs from the Her- mitian construction and t-designs,IEEE Trans. Inf. Theory(2026), early access, https://doi.org/10.1109/TIT.2026.3697209

    2026

  18. [26]

    Y. Li, S. Li, G. Luo, S. Ling, Improved bounds and optimal constructions of pure quantum locally recoverable codes, arXiv:2512.07256 (2025)

    2025

  19. [27]

    Lidar, T.A

    D.A. Lidar, T.A. Brun (Eds.),Quantum Error Correction, Cambridge University Press, Cambridge, 2013

    2013

  20. [28]

    G. Luo, B. Chen, M.F. Ezerman, S. Ling, Bounds and constructions of quantum locally 21 recoverable codes from quantum CSS codes,IEEE Trans. Inf. Theory71 (2025) 1794–1802

    2025

  21. [29]

    Luo, M.F

    G. Luo, M.F. Ezerman, M. Grassl, S. Ling, Constructing quantum error-correcting codes that require a variable amount of entanglement,Quantum Inf. Process.23 (2024) 4

    2024

  22. [30]

    Matsumoto, Reducing measurements in quantum erasure correction by quantum local recovery, arXiv:2510.22890 (2025)

    R. Matsumoto, Reducing measurements in quantum erasure correction by quantum local recovery, arXiv:2510.22890 (2025)

    2025

  23. [31]

    Papailiopoulos, A.G

    D.S. Papailiopoulos, A.G. Dimakis, Locally repairable codes,IEEE Trans. Inf. Theory60 (2014) 5843–5855

    2014

  24. [32]

    Prakash, G.M

    N. Prakash, G.M. Kamath, V. Lalitha, P.V. Kumar, Optimal linear codes with a local- error-correction property, in:Proc. IEEE Int. Symp. Inf. Theory (ISIT), IEEE, 2012, pp. 2776–2780

    2012

  25. [33]

    Rawat, D.S

    A.S. Rawat, D.S. Papailiopoulos, A.G. Dimakis, S. Vishwanath, Locality and availability in distributed storage,IEEE Trans. Inf. Theory62 (2016) 4481–4493

    2016

  26. [34]

    Sharma, V

    S. Sharma, V. Ramkumar, I. Tamo, Quantum locally recoverable codes via good polynomials, IEEE J. Sel. Areas Inf. Theory6 (2025) 100–110

    2025

  27. [35]

    I. Tamo, A. Barg, A family of optimal locally recoverable codes,IEEE Trans. Inf. Theory60 (2014) 4661–4676

    2014

  28. [36]

    D. Xie, S. Zhu, Z. Sun, Two families of optimal quantum locally recoverable codes,Int. J. Theor. Phys.64 (2025) 86

    2025

  29. [37]

    C. Xing, C. Yuan, Construction of optimal ( r, δ)-locally recoverable codes and connection with graph theory,IEEE Trans. Inf. Theory68 (2022) 4320–4328

    2022

  30. [38]

    K. Zhou, M. Cao, Optimal quantum ( r, δ)-locally repairable codes via classical ones,J. Combin. Theory Ser. A223 (2026) 106212. 22

    2026

Pith tools

Reviewed July 30, 2026 · model on record in the stance chip above.