{"id":"832e44d4-541c-4f0f-884f-99d6406e1fd1","arxiv_id":"2607.08911","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.5,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Exact correctability of fusion-space codes is equivalent to fibrewise Knill–Laflamme conditions on syndrome-admissible footprint algebras, with a conditional Peierls threshold for growing families and explicit Ising examples of diagnostic versus syndrome measurements.","lead":"The paper builds a field-theoretic language for quantum error correction in which error histories leave measurable total-charge footprints in fusion spaces of unitary fusion categories. Exact recovery becomes a fibrewise Knill–Laflamme condition once a syndrome-admissible measurement algebra is chosen, and a conditional Peierls threshold is proved for growing families under local hypotheses.","discovery_kind":"unification","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified beyond the paper’s own conditional framing of the Peierls hypotheses.","rationale":"The paper’s strongest formal claims are Theorem 3.12 (fibrewise KL under syndrome-admissibility) and the conditional Peierls bound Theorem 8.6. The former is standard once the measurement algebra is syndrome-admissible; the latter is an explicit counting argument whose hypotheses are listed and scoped. The reader’s weakest-assumption call on (P2) matches the paper’s own caveats and does not undermine the theorems as stated. Speculative geometric sections are labelled as directions. A CONDITIONAL verdict with high confidence is therefore appropriate and needs no adjustment. The concrete test above is a finite, fully checkable verification that the fibrewise language already works cleanly on the paper’s own worked example.","tokens_in":48432,"tokens_out":521,"duration_ms":6939,"concrete_test":"For the six-σ code of Section 7.2, enlarge the error family to all weight-≤2 Majorana bilinears that anticommute with Z3 and recompute the fibrewise Gram matrices of Theorem 3.12; confirm that every same-footprint pair either compresses to a scalar or is flagged as a logical residual (as T†E′ already is). If any pair yields a non-scalar non-logical compression, the fibrewise criterion would need refinement even in the finite case.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The reader correctly isolates (P2) local neutralizability as the softest architectural hypothesis in Theorem 8.6. The paper itself states that (P2) is intentionally broader than the contractible-vacuum scalarity of Proposition 3.15 and “must be verified separately for each architecture” (Section 8.2, Remark 8.7). Theorem 3.12 is an ordinary Knill–Laflamme restatement after syndrome resolution and is not at risk. The Ising six-σ example (Proposition 7.2) verifies exact recovery for a finite syndrome-admissible algebra, while Proposition 7.3 exhibits a nontrivial fibre, so the organizational claims are internally supported. No hidden inconsistency or unacknowledged gap in the formal statements was found; the threshold remains conditional exactly as advertised.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The manuscript develops a field-theoretic organization of quantum error correction for fusion-space codes in unitary fusion categories. Admissible clusters determine total-charge sectors and orthogonal footprint projectors; the central distinction is between diagnostic footprint algebras and syndrome-admissible commuting algebras that can be measured without revealing logical information. For the latter, exact correctability is equivalent to fibrewise Knill–Laflamme conditions (Theorem 3.12), with a contractible-vacuum sufficient criterion for scalar action (Proposition 3.15, Corollary 3.17). Explicit Ising calculations separate complementary diagnostics on four σ-punctures from a genuine syndrome-admissible six-σ code with exact recovery and a nontrivial same-footprint fibre (Propositions 7.2–7.3). Conformal-block likelihood data and geometry-dependent four-point weights are formulated. For growing families a conditional Peierls-type threshold theorem is proved under bounded connected-region growth, local stochastic noise, local neutralizability of small residuals, and componentwise decoder balance (Theorem 8.6). Later sections sketch representation-theoretic and algebro-geometric extensions.","tokens_in":48621,"tokens_out":1132,"duration_ms":13750,"significance":"If the organizational claims hold, the paper supplies a portable intermediate language that unifies stabilizer syndromes, anyonic fusion measurements, and defect-network decoding under a single footprint datum, with an explicit criterion separating diagnostics from syndrome-admissible measurements. The fibrewise Knill–Laflamme theorem and the measure-then-recover factorization are carefully scoped and openly equivalent to ordinary Knill–Laflamme after sector resolution. The six-σ Ising example is fully explicit (Majorana bilinears, projectors, recovery) and demonstrates both exact recovery and a nontrivial footprint fibre. The Peierls threshold is correctly conditional and recovers the surface-code counting mechanism as a special case. These are genuine strengths of clarity and organization rather than new unconditional thresholds or non-Clifford scalable constructions. The work is a useful conceptual contribution for categorical and topological QEC, provided the conditional scope of the threshold and the speculative character of Sections 9–10 remain clearly marked.","major_comments":[{"comment":"Theorem 8.6 and Definition 8.5 (P2): the local-neutralizability hypothesis is load-bearing for the exponential bound, yet it is stated as an assumption rather than derived for any growing nonabelian or conformal family. The paper correctly notes that (P2) is intentionally broader than the contractible-vacuum criterion of Proposition 3.15 and must be verified architecture-by-architecture (Remark 8.7). For the central claim of a “conditional Peierls-type threshold theorem” this is acceptable only if the abstract and introduction continue to emphasize that no automatic extension to arbitrary TQFT/CFT codes is claimed; any stronger phrasing should be removed.","section":null},{"comment":"Sections 9–10: the representation-theoretic and algebro-geometric directions (tube algebras, Yangians, Higgs bundles, spectral curves, Jacobians, GKP analogies) are almost entirely programmatic. They do not follow from Theorems 3.12 or 8.6 and contain no theorems that close the loop back to syndrome-admissible recovery. Either a concrete, fully worked test case (e.g., an explicit rank-2 spectral-curve footprint with a verified fibrewise Knill–Laflamme check) should be supplied, or these sections should be substantially shortened and clearly labelled as open directions so that they do not dilute the formal core.","section":null}],"minor_comments":[{"comment":"Abstract and §1.1: the phrase “diagrammatic field theory of quantum error correction” is slightly overstated relative to the content; the ZX material is a stabilizer shadow and the later geometric sections are speculative. Soften to match the carefully conditional body.","section":null},{"comment":"Proposition 5.1 and Figure 5: the Clifford-shadow circuit is clear, but an explicit statement that the optional braid B2 is not required for the pure X-type footprint measurement would avoid a possible misreading.","section":null},{"comment":"§7.3, Eqs. (59)–(60): the normalized block-norm weights are correctly presented as a minimal likelihood model, not a universal noise law; a one-sentence reminder that physical priors and detector likelihoods must still be supplied would help non-CFT readers.","section":null},{"comment":"Notation: the dual use of “footprint” for both the abstract boundary datum and the measured syndrome is carefully distinguished in Definition 3.18, but a short glossary or consistent subscripting (fp vs Synd) in later sections would reduce occasional ambiguity.","section":null},{"comment":"References: the interface literature on measurement-only topological computation, detector-error models, and nonabelian decoding is well cited; a few recent works on Floquet and dynamically generated codes could be added for completeness in §8.8.","section":null}],"recommendation":"minor_revision","confidential_remarks":"The formal core (categorical footprint projectors, fibrewise KL, Ising examples, conditional Peierls theorem) is sound and carefully scoped; the main risk is that the long speculative Sections 9–10 and the ambitious title may create an impression of broader results than are proved. A minor-revision request that trims or clearly labels those sections, and that keeps the abstract’s conditional language, should be sufficient. The paper is a good fit for a theory-oriented quant-ph or mathematical-physics venue that values organizational frameworks."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The useful takeaway is that Rayan isolates the footprint as the intermediate datum between error history and measured syndrome, proves that exact recovery for a syndrome-admissible algebra is exactly fibrewise Knill–Laflamme (Theorem 3.12), and then gives a fully explicit six-σ Ising code where a pair-charge measurement is safe, recovers a Majorana bilinear, and leaves a second same-footprint bilinear that differs by a logical flip. That last example is the cleanest concrete nontrivial fibre I have seen written down in this language.\n\nWhat is actually new is organizational rather than a stronger algebraic criterion. Remark 3.13 says so: after sector resolution you are back to ordinary KL. The value is the diagnostic-versus-syndrome-admissible distinction, the measure-then-recover factorization, the contractible-vacuum scalarity criterion, and the Peierls theorem written in footprint language with four explicit hypotheses. The categorical core (3.4, 3.12, 3.14–3.15, 3.17) is carefully proved under unitary fusion assumptions. The Ising four- and six-puncture calculations are fully explicit (F-moves, Majorana bilinears, conformal-block weights). The geometric and Hopf/Yangian sections are labelled as directions and do not pretend to be theorems.\n\nThe soft spot is exactly the one the paper flags: local neutralizability (P2) in the Peierls family is an assumption, broader than contractible-vacuum scalarity, and must be checked per architecture. Decoder balance is automatic for min-weight chains but not free in nonabelian labelled models. That does not break the theorem; it makes the threshold conditional, as advertised. No hidden inconsistency in the formal statements.\n\nThis is for people already working on anyonic, string-net, or conformal-block codes who want a portable checklist and a clean language for same-footprint ambiguity. It is not a hardware paper and does not claim a universal TQFT threshold. I would send it to peer review; the math is grounded enough and the examples are sharp enough to deserve referee time. Worth engaging if you care about nonabelian decoding architecture.","headline":"Solid organizational paper: fibrewise KL under syndrome-admissibility plus an explicit Ising nontrivial fibre, with a correctly conditional Peierls threshold; soft spot is architectural verification of (P2), not the formal core.","tokens_in":49231,"tokens_out":544,"would_cite":true,"duration_ms":6855,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P73","18M20","57K16","81T45","81T40","18M30","81P70"],"pacs":[],"model":"grok-4.5","headline":"Local error footprints organize quantum error correction: measure total charge without reading the logical state, then recover fibrewise.","keywords":["quantum error correction","fusion-space code","unitary fusion category","footprint projector","syndrome-admissible algebra","fibrewise Knill–Laflamme","Peierls threshold","Ising anyons"],"falsifier":"Exhibit a concrete growing family of fusion-space or string-net codes that satisfies bounded region growth, local stochastic noise, and decoder balance, yet still admits non-scalar residual components smaller than the claimed neutralization scale, so that the exponential Peierls bound on logical failure fails.","tokens_in":49267,"feed_emoji":"⚛️","tokens_out":1075,"duration_ms":19506,"temperature":0.7,"pith_summary":"This paper reframes quantum error correction as a field-theoretic problem on fusion spaces. An error history leaves a local “footprint”—visible total-charge or fusion-channel data on a chosen cluster—and a carefully chosen commuting algebra of footprint projectors can be measured as a syndrome without revealing the encoded state. Once that measurement is done, exact correctability is equivalent to the ordinary Knill–Laflamme conditions holding inside each measured sector alone, so recovery factors as measure-then-recover. Contractible neutral defect composites act as scalars and supply a categorical sufficient criterion. Explicit Ising calculations show both complementary logical diagnostics (four σ-punctures) and a genuine syndrome-admissible code with same-footprint decoding ambiguity (six σ-punctures). For growing families the paper proves a conditional Peierls-type threshold: under bounded local growth, local stochastic noise, local neutralizability of small residuals, and decoder balance, logical failure decays exponentially below a nonzero error rate.","feed_headline":"Error footprints turn QEC into fibrewise recovery","feed_subtitle":"Measure local charge without reading the logical state; a conditional threshold follows","key_machinery":"The syndrome-admissible footprint algebra: a commuting family of total-charge projectors that leaves the code untouched in the no-error sector and resolves chosen error representatives into measured sectors. Theorem 3.12 then reduces exact correction to fibrewise Knill–Laflamme, giving a measure-then-recover factorization; the Peierls hypotheses (P1)–(P3) convert that organization into an exponential failure bound.","core_discovery":"For fusion-space codes in a unitary fusion category, exact recovery conditioned on a syndrome-admissible footprint algebra exists if and only if the fibrewise Knill–Laflamme equations hold inside every measured sector. Under a contractible-vacuum hypothesis, closed neutral composites evaluate to scalars and therefore satisfy those equations. The same footprint language yields a conditional Peierls threshold theorem for growing families that meet explicit local geometric, noise, neutralizability, and decoder-balance hypotheses.","pith_inferences":["The four- versus six-σ Ising contrast suggests a general design rule: redundancy that freezes selected pair charges is what turns diagnostic fusion measurements into safe syndromes.","Because the Peierls hypotheses are portable, numerical threshold searches for non-Abelian string-net or Fibonacci codes can be organized as checks of neutralizability and decoder balance rather than ad-hoc Monte Carlo alone.","Higgs-bundle and Jacobian directions in the later sections hint that continuous-variable or oscillator codes may admit an analogous “spectral footprint” once polarization data replace fusion labels.","If same-footprint logical ambiguity is generic once error families enlarge, practical decoders will need priors (locality, conformal weights, or energy) even after perfect syndrome extraction."],"forward_implications":["Stabilizer syndromes, anyonic charge measurements, and fusion-channel readouts become special cases of one intermediate datum—the footprint—rather than separate formalisms.","Exact correction factors cleanly into classical sector measurement followed by fibrewise recovery, so decoder design can treat cross-sector and within-fibre ambiguities separately.","Geometry-dependent conformal-block weights supply soft likelihood factors that can rank same-footprint histories once a physical noise model is fixed.","Any architecture that verifies the four Peierls hypotheses inherits an exponential memory threshold without needing a full surface-code homology argument from scratch.","The same footprint language extends, at least as a design checklist, to string-net, condensation, holographic, and measurement-based realizations."],"fun_headline_variants":["Fibrewise Knill-Laflamme equals exact footprint recovery","Syndrome-admissible charges enable measure-then-recover QEC","Fusion-space codes: neutral composites act as scalars","Footprint algebras resolve errors without reading logicals","Local neutralizability yields conditional Peierls threshold"],"cache_read_input_tokens":32896,"weakest_assumption_plain":"Small closed residual error histories must act harmlessly (as scalars, or as pure gauge) on the encoded space; the paper assumes this local-neutralizability condition rather than deriving it for arbitrary field theories.","fun_headline_variants_meta":{"raw":{"variants":["Fibrewise Knill-Laflamme equals exact footprint recovery","Syndrome-admissible charges enable measure-then-recover QEC","Fusion-space codes: neutral composites act as scalars","Footprint algebras resolve errors without reading logicals","Local neutralizability yields conditional Peierls threshold"]},"model":"grok-4.5","effort":"low","cost_usd":0.003196,"raw_usage":{"total_tokens":1182,"prompt_tokens":878,"num_sources_used":0,"completion_tokens":62,"cost_in_usd_ticks":31960000,"prompt_tokens_details":{"text_tokens":878,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":242,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":878,"tokens_out":62,"duration_ms":3527,"temperature":1.0,"reasoning_tokens":242,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-13T05:51:29.542297+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Exhibit a concrete growing family of fusion-space or string-net codes that satisfies bounded region growth, local stochastic noise, and decoder balance, yet still admits non-scalar residual components smaller than the claimed neutralization scale, so that the exponential Peierls bound on logical failure fails.","supporting_citations":[],"review_version":1}