REVIEW 3 major objections 4 minor 24 references
Bounds for Pure Disjoint $(r,\delta)$-Quantum Locally Recoverable Codes
T0 review · 3 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash
Pith's one-line read This paper proves a Singleton-like dimension bound for pure disjoint $(r,\delta)$-quantum locally recoverable codes using blockwise weight enumerators, without a stabilizer structure.
desk verdict Genuinely new blockwise enumerator formalism, but the headline Singleton bound rests on a purity definition that is much stronger than the standard one and is not shown to be satisfied by any known pure qLRC family. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing tools are the blockwise Shor–Laflamme enumerators $A^{SL}_i(M_1,M_2)$ and $B^{SL}_i(M_1,M_2)$ and the blockwise unitary enumerators $A^U_i$, $B^U_i$, which sum operator products over tensor-product basis operators with block weight profile $i$. The local Knill–Laflamme condition (Theorem 1) reduces within-block correctability to the local code support $Q_\ell$, so that the set of correctable block profiles is exactly $T_{d,\delta} = \{i : \sum_{\ell: i_\ell \ge \delta} i_\ell \le d-1\}$. MacWilliams-type identities and the duality $B^U_i = A^U_{N-i}$ convert correctability into an equation for the unitary enumerators; purity then annihilates all intermediate terms in the Krawtchouk expansion, leaving only the $A^{SL}_0 = K^2$ contribution and yielding the dimension bound. The same enumerators feed a linear-programming bound (Theorems 5 and 6) using nonnegative Krawtchouk expansions of auxiliary polynomials.
What would settle it
Search for a pure disjoint $(r,\delta)$-qLRC with parameters violating the bound (5), or compute the blockwise SL enumerators of a known pure stabilizer qLRC: finding any nonzero $A^{SL}_i$ with $i \in T_{d,\delta}\setminus\{0\}$ would demonstrate that the purity premise is not inherited from standard purity, so the theorem's strengthened bound would not cover that code.
Extended reading notes
Core claim
The central claim is that purity, defined blockwise as $A^{SL}_i = 0$ for every nonzero correctable block profile $i \in T_{d,\delta}$, lets the blockwise weight enumerators collapse exactly on the set $T_{d,\delta}$ of locally-then-globally correctable erasure patterns. Using the identity $A^U_j = K A^U_{N-j}$ for a carefully chosen pattern $j$ with total weight $m=(d-1)+\lfloor (n-(d-1))/N\rfloor(\delta-1)$, the paper forces $K \le q^{n-2m}$, which is the bound above. A key comparison: for $\delta=2$ this recovers the pure stabilizer $(r,2)$-qLRC bound without stabilizer assumptions, and for all $\delta$ it sits below the general disjoint bound while matching the dual-containing classical $(r,\delta)$-LRC dimension bound in quantum form. The paper's own framing is that these are the first bounds for disjoint $(r,\delta)$-qLRCs derived from the new blockwise enumerator framework rather than from an underlying classical code.
Load-bearing premise
The paper assumes that no nonzero correctable error pattern contributes to the blockwise Shor–Laflamme enumerator; that is a much stronger purity condition than the usual one, and no existing family of pure codes is shown to meet it.
Editorial extensions
If this is right
- Any pure disjoint $(r,\delta)$-qLRC with $n$ qudits and distance $d$ has dimension at most $q^{n-2(d-1)-2\lfloor(n-(d-1))/N\rfloor(\delta-1)}$.
- For $\delta=2$, the new bound reproduces the pure stabilizer $(r,2)$-qLRC bound while dropping the stabilizer assumption, so any such non-stabilizer code inherits the same ceiling.
- The linear-programming bound of Theorem 6 is at least as tight as the pure Singleton bound and strictly stronger than the relaxed versions of previously known bounds in both regimes $\partial \ge \delta$ and $\partial < \delta$.
- The construction of the LP polynomial shows that the admissible block profiles form a natural domain for Krawtchouk-based LP arguments, analogous to classical LRC bounds.
Reading between the lines
- If Definition 4's purity condition is genuinely satisfied by code families beyond stabilizer codes, the enumerator identity provides a direct route to optimality proofs; but the paper does not exhibit such families, so the practical coverage of the bound remains open.
- The same blockwise enumerators could be adapted to overlapping recovery sets by replacing the partition with a cover, where the correctable set $T_{d,\delta}$ would become a union over recovery sets rather than a simple sum over blocks.
- One testable extension is to compute the blockwise SL spectra of small pure stabilizer qLRCs: any nonzero $A^{SL}_i$ for $i \in T_{d,\delta}\setminus\{0\}$ would show the paper's purity is genuinely stronger than standard purity, and the bound would not apply to those codes.
- The LP method may generalize to impure codes by subtracting shadow-type terms, mirroring how shadow enumerators tighten classical quantum LP bounds.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper develops a blockwise weight-enumerator framework for disjoint (r,δ)-quantum locally recoverable codes (qLRCs) without assuming a stabilizer structure. It introduces local Knill--Laflamme conditions, blockwise Shor--Laflamme and unitary weight enumerators, and uses them to prove a Singleton-like dimension bound (Theorem 4) and a linear-programming bound (Theorem 6) under a 'purity' condition (Definition 4). The authors claim that the Singleton-like bound strengthens the known bound (7) for disjoint (r,δ)-qLRCs and that the LP bound is tighter than previously relaxed bounds. The main issue is that Definition 4 is not the standard purity condition used in the cited literature, and the paper does not show that any known pure qLRC family satisfies it; consequently, the advertised strengthening is not established for the intended class of codes.
Significance. If the blockwise enumerator identities were fully proved and the purity condition were satisfied by natural code families, the framework would offer a genuinely non-stabilizer route to qLRC bounds and the LP adaptation in Theorem 6 would be a useful contribution. However, as it stands, the central results apply to a newly defined 'pure' subclass whose nonemptiness is not demonstrated, and several load-bearing proofs are omitted. The paper does not provide machine-checked proofs, reproducible code, or explicit examples, so the practical significance of the bounds is currently unclear.
major comments (3)
- [Section V, Definition 4 and Theorem 4] The purity condition A_i^SL=0 for all i in T_{d,δ}\{0} is substantially stronger than the standard purity condition A_i=0 for total weight i<d. Because T_{d,δ} contains every profile with all block weights at most δ−1 (the sum over blocks with weight at least δ is empty), Definition 4 forces A_i^SL=0 also for profiles whose total weight is at least d. The proof of Theorem 4 relies on exactly this stronger condition when it discards all nonzero k≤j. The paper neither proves that the known pure stabilizer qLRC families from [4] or [6] satisfy Definition 4 nor supplies any construction of a code that does. Therefore the claimed strengthening of bound (7) for the class of codes previously called pure is not established; Theorem 4 applies only to a possibly empty newly defined subclass.
- [Section IV-A, Theorem 2(3), and Section VI, Theorems 5 and 6] The blockwise MacWilliams identity is load-bearing for Corollary 1, Theorem 4, and Theorem 5, but its proof is omitted with only the sentence that it follows by adapting arguments in [18]. Similarly, Theorem 5's proof is a one-sentence appeal to the LP method of [16], and Theorem 6 is presented as a proof sketch with the nonnegativity of the Krawtchouk coefficients f_i≥0 stated as 'standard' without details. These gaps prevent the reader from verifying two of the paper's main results, and they should be filled with complete proofs or precise reductions to stated references.
- [Section V, comparison with known bounds] The assertions that Theorem 4 'agrees with' the pure stabilizer bound (8) for δ=2 and that it recovers the stabilizer (r,2)-qLRC bound are not justified, because the purity notion used in (8) is weaker than Definition 4. Even for δ=2, a standard pure stabilizer code can have A_i^SL>0 for a profile with one error in each of several blocks and total weight at least d, while Definition 4 forces such a profile to have zero enumerator. The comparison must be either proved for the standard pure class or explicitly restricted to the new blockwise-pure class.
minor comments (4)
- [References] Reference [16] spells the second author 'Litsyu'; the standard spelling is 'Litsyn'.
- [Section II, Remark after Definition 2] The remark assumes equal block sizes |J_ℓ|=N and N|n, but Definition 2 only guarantees |R_i|≤N; the reduction to identical block sizes should be stated as a separate assumption, with a discussion of how the bounds change for unequal blocks.
- [Theorem 2(2)] The notation E^(ℓ)_V is used in the proof without definition; define E_V = ⊗_{ℓ∈V} E^(ℓ) before the displayed equation.
- [Definition 4] The term 'pure' conflicts with the established meaning of a pure quantum code; the authors should use 'blockwise pure' or another unambiguous term throughout, or explicitly justify why the established term should be extended.
Circularity Check
No significant circularity: the proof is assumption-driven and relies on external standard results, not on self-citation or fitted inputs.
full rationale
The derivation chain is not circular. Theorem 4 assumes Definition 4, which sets A_i^SL = 0 for all i in T_{d,delta} \ {0}; this is an explicit standing assumption, not a consequence of the target bound. The bound is derived from this assumption via Theorem 3, whose equality characterization is imported from Rains' external work, and via the standard Knill-Laflamme theorem. No parameter is fitted to data, and no quantity is predicted from an input that already contains it. Theorem 2(3) is deferred to [18] by an omitted proof, but that is an incompleteness in the manuscript, not a self-referential loop. The comparison bounds (7) and (8) come from external papers by Golowich-Guruswami, Galindo et al., and Li et al.; none of these are the present authors' own results. The Boche-affiliated references [21]-[23] appear only in the contextual conclusion about 6G quantum communication and carry no load-bearing mathematical content. The skeptical concern that Definition 4's purity condition may be too strong and that no known pure qLRC family is shown to satisfy it is a correctness or applicability objection, not circularity: a possibly vacuous assumption is still not an assumption equivalent to the theorem's conclusion. Therefore the paper receives a score of 0.
Assumptions & free parameters
assumptions (6)
- standard math Knill-Laflamme conditions characterize correctability
- standard math Rains equality K B_U = A_U characterizes erasure correctability
- standard math Krawtchouk polynomials form an orthogonal basis
- domain assumption Recovery on a block implies the composed channel acts as identity on the local code support Q_l
- ad hoc to paper Blockwise purity as defined in Definition 4
- domain assumption Equal recovery block size N and N divides n
Cite this review
Pith. "Pith review of Bounds for Pure Disjoint $(r,\delta)$-Quantum Locally Recoverable Codes." pith.science (2026). https://pith.science/paper/64RDPLJL
@misc{pith2026260810922,
author = {Pith},
title = {Pith review of: Bounds for Pure Disjoint $(r,\delta)$-Quantum Locally Recoverable Codes},
year = {2026},
howpublished = {\url{https://pith.science/paper/64RDPLJL}},
note = {Machine review of arXiv:2608.10922}
}
abstract
We study pure disjoint $(r,\delta)$-quantum locally recoverable codes (qLRCs) without assuming a stabilizer structure. We formulate local Knill--Laflamme conditions for recovery from up to $\delta-1$ erasures within a recovery block, and introduce blockwise Shor--Laflamme and unitary weight enumerators that capture how error weight is distributed across recovery sets. We establish several properties of these enumerators and use them to derive a Singleton-like bound that strengthens the known bound for disjoint $(r,\delta)$-qLRCs under a purity assumption, as well as a linear-programming upper bound on the code dimension. These results provide a non-stabilizer, weight-enumerator-based approach to the study of pure disjoint $(r,\delta)$-qLRCs.
Reference graph
Works this paper leans on
-
[4]
Quantum (r,δ)-locally recoverable codes,
C. Galindo, F. Hernando, H. Mart ´ın-Cruz, and R. Matsumoto, “Quantum (r,δ)-locally recoverable codes,”Finite Fields and Their Applications, vol. 111, p. 102785, 2026
2026
-
[6]
Improved bounds and optimal constructions of pure quantum locally recoverable codes,
Y . Li, S. Li, G. Luo, and S. Ling, “Improved bounds and optimal constructions of pure quantum locally recoverable codes,”arXiv preprint arXiv:2512.07256, 2025
arXiv 2025
-
[18]
Linear programming bounds for entanglement-assisted quantum error-correcting codes by split weight enumerators,
C.-Y . Lai and A. Ashikhmin, “Linear programming bounds for entanglement-assisted quantum error-correcting codes by split weight enumerators,”IEEE Transactions on Information Theory, vol. 64, no. 1, pp. 622–639, 2017
2017
-
[16]
Upper bounds on the size of quantum codes,
A. Ashikhmin and S. Litsyu, “Upper bounds on the size of quantum codes,”IEEE Transactions on Information Theory, vol. 45, no. 4, pp. 1206–1215, 1999
work page 1999
-
[1]
Quantum locally recoverable codes,
L. Golowich and V . Guruswami, “Quantum locally recoverable codes,” arXiv preprint arXiv:2311.08653, 2023
arXiv 2023
-
[2]
Quantum locally recoverable codes via good polynomials,
S. Sharma, V . Ramkumar, and I. Tamo, “Quantum locally recoverable codes via good polynomials,”IEEE Journal on Selected Areas in Information Theory, 2025
2025
-
[3]
Bounds and constructions of quantum locally recoverable codes from quantum CSS codes,
G. Luo, B. Chen, M. F. Ezerman, and S. Ling, “Bounds and constructions of quantum locally recoverable codes from quantum CSS codes,”IEEE Transactions on Information Theory, 2025
work page 2025
-
[5]
Two families of optimal quantum locally recoverable codes,
D. Xie, S. Zhu, and Z. Sun, “Two families of optimal quantum locally recoverable codes,”International Journal of Theoretical Physics, vol. 64, no. 4, pp. 1–17, 2025
2025
Show all 24 references
-
[7]
Optimal quantum(r, δ)-locally repairable codes from matrix-product codes,
M. Cao and K. Zhou, “Optimal quantum(r, δ)-locally repairable codes from matrix-product codes,”arXiv preprint arXiv:2508.03597, 2025
2025 arXiv
-
[8]
Quantum error correction via codes over GF(4),
A. Calderbank, E. Rains, P. Shor, and N. Sloane, “Quantum error correction via codes over GF(4),”IEEE Transactions on Information Theory, vol. 44, no. 4, pp. 1369–1387, 1998
1998
-
[9]
On the locality of codeword symbols,
P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, “On the locality of codeword symbols,”IEEE Transactions on Information theory, vol. 58, no. 11, pp. 6925–6934, 2012
2012
-
[10]
On optimal quantum LRCs from the Hermitian construction andt-designs,
Y . Li, S. Li, H. Lao, G. Luo, and S. Ling, “On optimal quantum LRCs from the Hermitian construction andt-designs,”arXiv preprint arXiv:2508.13553, 2025
2025 arXiv
-
[11]
An algebraic approach to the association schemes of coding theory,
P. Delsarte, “An algebraic approach to the association schemes of coding theory,”Philips Res. Rep. Suppl., vol. 10, pp. 1–97, 1973
1973
-
[12]
Quantum analog of the MacWilliams identities for classical coding theory,
P. Shor and R. Laflamme, “Quantum analog of the MacWilliams identities for classical coding theory,”Physical review letters, vol. 78, no. 8, p. 1600, 1997
1997
-
[13]
Quantum weight enumerators,
E. Rains, “Quantum weight enumerators,”IEEE Transactions on Infor- mation Theory, vol. 44, no. 4, pp. 1388–1394, 1998
1998
-
[14]
Nonbinary quantum codes,
E. Rains, “Nonbinary quantum codes,”IEEE Transactions on Informa- tion Theory, vol. 45, no. 6, pp. 1827–1832, 1999
1999
-
[15]
Quantum shadow enumerators,
E. M. Rains, “Quantum shadow enumerators,”IEEE transactions on information theory, vol. 45, no. 7, pp. 2361–2366, 1999
1999
-
[17]
Nonbinary stabilizer codes over finite fields,
A. Ketkar, A. Klappenecker, S. Kumar, and P. K. Sarvepalli, “Nonbinary stabilizer codes over finite fields,”IEEE transactions on information theory, vol. 52, no. 11, pp. 4892–4914, 2006
2006
-
[19]
Macwilliams identities and coordinate partitions,
J. Simonis, “Macwilliams identities and coordinate partitions,”Linear Algebra and its Applications, vol. 216, pp. 81–91, 1995
1995
-
[20]
Combinatorial alphabet-dependent bounds for locally recoverable codes,
A. Agarwal, A. Barg, S. Hu, A. Mazumdar, and I. Tamo, “Combinatorial alphabet-dependent bounds for locally recoverable codes,”IEEE Trans- actions on Information Theory, vol. 64, no. 5, pp. 3481–3492, 2018
2018
-
[21]
6G perspective of mobile network operators, manufacturers, and verticals,
P. Schwenteck, G. T. Nguyen, H. Boche, W. Kellerer, and F. H. Fitzek, “6G perspective of mobile network operators, manufacturers, and verticals,”IEEE Networking Letters, vol. 5, no. 3, pp. 169–172, 2023
2023
-
[22]
Quantum tech- nology concepts for 6G networks,
Z. Amiri, R. Bassoli, H. Boche, S. A. Charania, J. W. Czarske, S. Das, C. Deppe, S. Dev, F. H. Fitzek, M. I. Habibie, J. Hawellek, M. He, K. Jamshidi, D. L. Calsi, S. S. Nande, K. Nilesh, J. N ¨otzel, D. Plettemeier, A. Shetewy, C. Upadhyay, and Q. Zhang, “Quantum tech- nology...
2026
-
[23]
Quantum technology applications for 6G networks,
Z. Amiri, R. Bassoli, H. Boche, S. A. Charania, J. W. Czarske, S. Das, C. Deppe, D. L. Calsi, S. Maheshwari, S. S. Nande, K. Nilesh, J. N ¨otzel, and Q. Zhang, “Quantum technology applications for 6G networks,” in6G-life(F. H. Fitzek, H. Boche, W. Kellerer, and P. Seeling, eds...
2026
-
[24]
LRCs: Duality, LP bounds, and field size,
A. Gruica, B. Jany, and A. Ravagnani, “LRCs: Duality, LP bounds, and field size,”arXiv preprint arXiv:2309.03676, 2023
2023 arXiv
Reviewed August 12, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.