{"id":"64e843f1-6fc0-467a-8cde-f2ecd1d37677","arxiv_id":"2508.03597","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"The authors characterize optimal quantum (r,δ)-locally repairable codes obtainable from matrix-product codes and give five infinite families via dual-containing constructions.","lead":"This paper gives conditions under which matrix-product codes yield optimal quantum locally repairable codes, and constructs five infinite families of such codes. If correct, it provides new building blocks for fault-tolerant quantum storage with efficient repair.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Central characterization is unverifiable from the abstract alone; the load-bearing risk is whether the necessary-and-sufficient condition and the required dual-containing MP codes actually exist for the five infinite families.","rationale":"The reader's weakest assumption is that dual-containing MP codes with the needed constituent parameters exist; this is indeed a central unverified premise and matches the part of my concern about the five infinite families potentially being empty. I partially agree because I also flag the unverifiable necessary-and-sufficient condition and its edge-case handling, which the abstract does not specify. Since the full text is absent, there is no internal inconsistency to identify; the appropriate disposition remains the reader's UNVERDICTED verdict, not a final acceptance or rejection. My concrete test is a re-derivation plus a small exhaustive check of one constructed family, which would settle whether the characterization and the existence claims hold. If the test fails, the verdict should move toward CONDITIONAL or REJECT; if it passes, the paper should be returned for full technical review.","tokens_in":600,"tokens_out":3934,"duration_ms":49876,"concrete_test":"Obtain the full text and independently re-derive the necessary-and-sufficient condition from the definition of a matrix-product code and the Singleton-type bound for (r,δ)-LRCs. Then instantiate the first infinite family for a concrete field, e.g., q=4: list the constituent code parameters, the generator matrix A, and verify by exhaustive computation that the resulting MP code attains the claimed locality, distance, and optimality. Repeat for a boundary case where r does not divide k and for δ>r+1 to confirm the condition applies outside the easiest parameter regime.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's strongest claim is a necessary-and-sufficient criterion for optimal (r,δ)-LRCs from matrix-product codes, plus five infinite families of optimal quantum codes. With only the abstract, no proof can be checked, but the most load-bearing premise is that the required Hermitian and Euclidean dual-containing MP codes over the stated fields exist with parameters matching the condition. For Hermitian dual-containing MP codes, each constituent code must be Hermitian self-orthogonal, which forces its dimension to be at most half its length; the abstract provides no parameter ranges, so a reader cannot test whether the claimed families are nonempty in the regimes where the optimality bound would demand larger dimensions. Additionally, a 'necessary and sufficient' optimality condition for (r,δ)-LRCs must handle edge cases such as r not dividing k, δ=2 versus δ>2, and non-nested constituent codes; the abstract states none of these regimes, so even the internal consistency of the characterization cannot be assessed from the information given. These are not accusations of error; they are the specific points that prevent the core claim from being verified at this stage.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":794,"tokens_out":2262,"duration_ms":26453,"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":[{"comment":"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.","section":"Abstract"},{"comment":"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.","section":"Abstract"},{"comment":"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.","section":"Abstract"}],"minor_comments":[{"comment":"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.","section":"Abstract"},{"comment":"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.","section":"Abstract"}],"recommendation":"uncertain","confidential_remarks":"This is an abstract-only review, so I could not verify any of the proofs or the existence of the claimed families. The load-bearing issues are the formal statement and proof of the necessary-and-sufficient condition, and the explicit existence of Hermitian and Euclidean dual-containing MP codes with parameters that satisfy that condition. If the full text supplies complete proofs and nonempty constructions, the paper may well be a solid contribution; however, a decision should be made only after a full-text review."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a standard but useful contribution to the quantum LRC construction program. The main new piece is a necessary and sufficient condition for an MP code to be an optimal (r,δ)-LRC, which is more than the usual sufficient conditions. That alone is worth referee time. The five infinite families are a nice bonus, assuming the underlying dual-containing MP codes exist with the promised parameters.\n\nI could only see the abstract, so I cannot check the proofs. The condition's handling of edge cases (r not dividing k, δ=2 vs δ>2, nested vs non-nested constituents) is not stated, and the existence of Hermitian/Euclidean dual-containing MP codes over the required fields is asserted rather than shown. Those are exactly the points a referee should probe. I'm not saying the paper is wrong; I'm saying the abstract doesn't give enough to verify.\n\nWhat the paper does well: it situates itself in a known framework and promises a characterization rather than just another family of ad hoc constructions. That's a step up. The abstract is clear, and the claims are specific enough to be falsifiable.\n\nThe soft spots: (1) the necessary and sufficient condition needs a careful statement of the parameter regimes; if it fails in edge cases, the main theorem is overstated. (2) The five families depend on constituent codes with self-orthogonality conditions that force dimension ≤ length/2; if the optimality bound demands larger dimensions, some families may be empty. (3) No comparison with prior families is given, so we can't judge whether the parameters are genuinely new.\n\nNone of this is fatal. It's a paper I'd send to a referee who works on MP codes or quantum LRCs. The referee should ask for the full proof of the characterization and a table of parameters showing the families are nonempty and new.","headline":"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.","tokens_in":1209,"tokens_out":1938,"would_cite":false,"duration_ms":22891,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["94B05","94B27","81P70"],"pacs":[],"model":"deepseek-v4-flash","headline":"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.","keywords":["quantum error correction","locally repairable codes","matrix-product codes","dual-containing codes","Hermitian dual","Euclidean dual","optimal codes","distributed storage"],"falsifier":"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.","tokens_in":1128,"feed_emoji":"⚛️","tokens_out":6673,"duration_ms":122637,"temperature":0.7,"pith_summary":"The paper establishes a necessary and sufficient condition for a matrix-product code to be an optimal (r,δ)-locally repairable code, and it applies that condition to build quantum LRCs. Optimal here means the code attains the best possible trade-off between code size and repair locality, as measured by the (r,δ)-Singleton-type bound. The condition is stated in terms of the constituent codes and their nesting, so a designer can certify optimality from the ingredients instead of by brute force. The paper reports five infinite families of optimal quantum (r,δ)-LRCs obtained from Hermitian dual-containing and Euclidean dual-containing matrix-product codes, with flexible lengths, dimensions, and localities.","feed_headline":"Five new families of optimal quantum locally repairable codes","feed_subtitle":"A single condition on the building blocks certifies optimal repair locality and yields five new families.","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[],"fun_headline_variants":["Five optimal quantum LRC families from matrix-product codes","MP codes give five optimal quantum LRC families","Five infinite optimal quantum LRC families via MP codes","Optimal quantum LRCs from matrix-product codes: five families","Matrix-product codes: optimal quantum LRCs in five families"],"cache_read_input_tokens":3584,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Five optimal quantum LRC families from matrix-product codes","MP codes give five optimal quantum LRC families","Five infinite optimal quantum LRC families via MP codes","Optimal quantum LRCs from matrix-product codes: five families","Matrix-product codes: optimal quantum LRCs in five families"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000666,"raw_usage":{"total_tokens":2952,"prompt_tokens":771,"completion_tokens":2181,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":387,"completion_tokens_details":{"reasoning_tokens":2101}},"tokens_in":387,"tokens_out":2181,"duration_ms":18665,"temperature":1.0,"reasoning_tokens":2101,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T04:18:48.506542+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[],"review_version":1}