REVIEW 3 major objections 2 minor 2 cited by
Optimal Quantum $(r,\delta)$-Locally Repairable Codes From Matrix-Product Codes
T0 review · 3 major / 2 minor · reviewed 2026-08-06 · deepseek-v4-flash
Pith's one-line read Matrix-product codes with nested or non-nested constituents can be certified as optimal quantum locally repairable codes by one condition, yielding five infinite families.
desk verdict A promising characterization result for quantum LRCs from matrix-product codes; the abstract alone can't verify the necessary-and-sufficient claim or the nonemptiness of the five families. 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 central object is the matrix-product code, a code formed by taking fixed linear combinations, prescribed by a matrix, of several constituent codes, so that length, dimension, distance, and locality are inherited from the constituents plus the matrix. The load-bearing mechanism is the paper's necessary-and-sufficient optimality criterion for (r,δ)-locality, together with the nested and non-nested distinction for constituent codes and the Hermitian or Euclidean dual-containment used to pass from classical MP codes to quantum codes.
What would settle it
Take the smallest parameter set of the first reported family and compute the constructed matrix-product code: the Hermitian or Euclidean dual must contain the code, and the minimum distance must reach the (r,δ)-Singleton bound; failure of either check on that smallest instance refutes the family claim.
Extended reading notes
Core claim
The paper's central claim is that matrix-product codes provide a complete framework for optimal (r,δ)-locality: an MP code is an optimal (r,δ)-LRC exactly when a specified condition on its constituent codes and defining matrix holds. In the nested case, where the constituent codes form a chain, this condition becomes a full characterization; in the non-nested case the paper still obtains optimal codes. Lifting via Hermitian and Euclidean dual-containment converts these classical MP codes into quantum (r,δ)-LRCs, and the paper exhibits five infinite families of such optimal quantum codes with flexible parameters.
Load-bearing premise
The load-bearing premise is that Hermitian and Euclidean dual-containing matrix-product codes with the required constituent parameters exist over the needed finite fields; if such components are sparse, some of the five infinite families would not really be infinite.
Editorial extensions
If this is right
- Designers can check whether a proposed matrix-product code is an optimal (r,δ)-LRC by inspecting its constituent codes, rather than by exhaustive search.
- Nested constituent codes yield a clean characterization of optimality, giving a structured pipeline for constructing quantum LRCs.
- The non-nested case is also covered, so the construction does not depend on a restrictive nesting condition.
- The five infinite families supply optimal quantum (r,δ)-LRCs with flexible parameters, which is the practical payoff for quantum storage and repair.
Reading between the lines
- The paper does not state this, but the same necessary-and-sufficient criterion could be turned into a search algorithm: enumerate component codes whose parameters satisfy the condition and automatically compile them into optimal quantum LRCs, allowing future work to move beyond the five families.
- If the criterion is as tight as claimed, it also supplies a converse for the known Singleton-type bound on (r,δ)-locality, meaning every MP code meeting that bound is captured by the condition; a direct proof of that converse would make the result a classification statement for MP-based optimal LRCs.
- A natural testable extension is to replace Hermitian and Euclidean dual-containment with symplectic or quaternary self-orthogonality, which could yield quantum LRCs with different alphabet constraints while keeping the same optimality check.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims to establish a necessary and sufficient condition for a matrix-product (MP) code to be an optimal (r,δ)-locally repairable code (LRC), a characterization of optimal quantum (r,δ)-LRCs from MP codes with nested and non-nested constituent codes, and five infinite families of optimal quantum (r,δ)-LRCs obtained from Hermitian and Euclidean dual-containing MP codes. The abstract provides no proofs, theorem statements, parameter ranges, or existence constructions, and the full text was not available for review. The present assessment is therefore limited to the claims as stated in the abstract.
Significance. If the characterization and the five infinite families are correct, the paper would provide a general and useful criterion for constructing optimal quantum locally repairable codes directly from MP-code ingredients, potentially simplifying and extending earlier construction methods. The claimed necessary-and-sufficient condition is particularly significant because it would allow designers to certify optimality without checking each family case by case. However, because the abstract contains no formal statements, proofs, or parameter tables, the significance cannot be confirmed at this stage. The abstract also gives no indication of machine-checked proofs or reproducible code, so the evidentiary value rests entirely on the ordinary mathematical proof structure, which is not visible here.
major comments (3)
- [Abstract] The central claim of a necessary and sufficient condition for an MP code to be an optimal (r,δ)-LRC is stated without any indication of the proof strategy or the precise hypotheses. Since every subsequent result in the paper depends on this condition, the full text must provide a formal theorem with an explicit statement of the field size, code parameters, the definition of (r,δ)-optimality, and a complete proof. In an abstract-only review this load-bearing point cannot be verified.
- [Abstract] The five infinite families are asserted to come from Hermitian and Euclidean dual-containing MP codes, but the abstract gives no parameter ranges or existence lemmas for the constituent codes. In particular, Hermitian dual-containing MP codes normally require each constituent to be Hermitian self-orthogonal, which constrains dimensions relative to lengths. Without explicit existence constructions or parameter tables, a reader cannot test whether the five families are nonempty in the regimes where the optimality bound is tight.
- [Abstract] A necessary and sufficient optimality condition for (r,δ)-LRCs must handle edge cases such as r not dividing k, δ=2 versus δ>2, and the precise relationship between the MP-code constituents and the (r,δ)-locality structure. The abstract mentions nested and non-nested constituent codes but does not state how these regimes are treated, so the internal consistency and coverage of the characterization cannot be assessed from the information given.
minor comments (2)
- [Abstract] The abstract uses 'optimal quantum (r,δ)-LRCs' and 'MP codes' without definitions; if the journal's readership includes non-specialists, a sentence defining these classes and the relevant optimality bound would improve accessibility.
- [Abstract] The phrase 'flexible parameters' is vague; the abstract would be strengthened by presenting at least one concrete parameter set or by quantifying the range of achievable parameters in the five families.
Circularity Check
No circularity detectable from the abstract; the construction depends on prior dual-containing code existence and the CSS mapping, not on the target result itself.
full rationale
This is an abstract-only review, so the derivation chain cannot be walked in full. However, nothing in the abstract exhibits any of the enumerated circularity patterns. The central claim is a necessary and sufficient condition for a matrix-product code to be an optimal (r,delta)-LRC, followed by a CSS-type mapping to quantum codes via Hermitian or Euclidean dual-containing MP codes. The abstract does not define the optimality condition in terms of the quantum codes it claims to construct, nor does it fit any parameter to the reported five infinite families and then relabel that fit as a prediction. No self-citation is visible in the abstract, and no uniqueness theorem or ansatz is imported from prior work. The load-bearing existence premise—that Hermitian and Euclidean dual-containing MP codes with the needed constituent parameters exist—is an assumption about the availability of ingredient codes, not a circular reuse of the paper's own target result. Whether those ingredient codes exist for nonempty parameter ranges is a correctness or completeness concern, not a circularity concern. Consistent with the default expectation, the honest finding is no significant circularity.
Assumptions & free parameters
assumptions (2)
- domain assumption Hermitian and Euclidean dual-containing MP codes with required parameters exist over the relevant finite fields.
- domain assumption The CSS construction maps classical MP-based LRCs to quantum LRCs preserving the (r,δ) locality and optimality properties.
Cite this review
Pith. "Pith review of Optimal Quantum $(r,\delta)$-Locally Repairable Codes From Matrix-Product Codes." pith.science (2026). https://pith.science/paper/2M6JNGC2
@misc{pith2026250803597,
author = {Pith},
title = {Pith review of: Optimal Quantum $(r,\delta)$-Locally Repairable Codes From Matrix-Product Codes},
year = {2026},
howpublished = {\url{https://pith.science/paper/2M6JNGC2}},
note = {Machine review of arXiv:2508.03597}
}
abstract
This paper studies optimal quantum $(r,\delta)$-LRCs from matrix-product (MP) codes. We establish a necessary and sufficient condition for an MP code to be an optimal $(r,\delta)$-LRC. Based on this, we present a characterization for optimal quantum $(r,\delta)$-LRCs from MP codes with nested constituent codes, and also study optimal quantum $(r,\delta)$-LRCs constructed from MP codes with non-nested constituent codes. Through Hermitian dual-containing and Euclidean dual-containing MP codes, we present five infinite families of optimal quantum $(r,\delta)$-LRCs with flexible parameters.
Forward citations
Cited by 2 Pith papers
-
CSS Quantum LRCs with Intersecting Recovery Sets: Constructions and Bounds
CSS quantum locally recoverable codes with intersecting recovery sets are characterized by classical codes with common recovery sets, and explicit binary families with high rates are constructed.
-
Bounds for Pure Disjoint $(r,\delta)$-Quantum Locally Recoverable Codes
New Singleton-like and linear-programming dimension bounds are proven for disjoint quantum locally recoverable codes under a blockwise purity condition.
Reviewed August 6, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.