{"id":"79f90067-014f-4f4c-bcaf-ff0ad69309aa","arxiv_id":"2608.00830","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"A syndrome-resolved decoder for graph-GKP codes reuses rejected local syndromes to infer the logical Pauli frame, yielding finite-size loss-tolerance pseudothresholds for photonic MBQC.","lead":"Two quantum error correction strategies for photonic computers, graph codes and GKP codes, are brought under one decoder that keeps every measurement clue, even 'failed' ones. The decoder converts uncertain readings into located erasures, and finite-size simulations show how much light loss five- and seven-qubit modules can tolerate.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No fatal formal flaw in selected-event likelihood; main gap is unvalidated closest-coset approximation in all numerical loss-tolerance claims.","rationale":"The reader's weakest assumption was the physical noise model and the trace-preserving flagged-instrument assumption. I do not view that as the primary load-bearing risk: the loss-amplification channel is a standard additive Gaussian displacement channel, and the flagged-instrument abstraction is internally coherent. Rather, the decisive unaddressed issue for the quantitative claims is the systematic use of the closest-coset approximation in all simulations, with no exact-wrapped comparison to bound the omitted sector-dependent factor in Eq. (51). Because the paper acknowledges this as future work and ships no code or data, the numerical loss-tolerance conclusions must remain conditional. The central formal argument, however, is sound as far as I can tell, so I recommend no change to the reader's CONDITIONAL verdict.","tokens_in":33817,"tokens_out":25181,"duration_ms":348122,"concrete_test":"Recompute one representative cube logical-X panel (for example η = 0.65, σ_GKP = 0.15, and a confidence threshold giving ε ≈ 0.1) using the exact wrapped selected-branch likelihood, Eq. (48)-(49), instead of the closest-coset score Eq. (50). Compare the accepted-frame error and the attenuation-reference crossing ℓ_ref; additionally report the sector dependence of R_b(σ,e). If the exact results move outside the Monte Carlo uncertainty or change ℓ_ref by more than a few percent, the reported pseudothresholds must be re-derived under the exact likelihood.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The formal framework is internally consistent: Eq. (38) correctly makes the branch deterministic in the local records, and Eq. (43) with Eqs. (44)-(49) properly conditions on accepted and rejected local syndromes; Eq. (53) is a valid controller-facing pushforward for the declared model. Pure loss followed by quantum-limited amplification is exactly the additive Gaussian displacement channel of Eq. (15), so non-Gaussian backaction is not the real issue. The load-bearing weakness is numerical: every executable result uses the closest-coset approximation (Eq. 50) instead of the exact wrapped likelihood, and Eq. (51) exhibits the omitted sector-dependent factor R_b(σ,e;D_b). If R_b varies appreciably with (σ,e), the normalized CC posterior used for frame confidence and erasure decisions can be miscalibrated relative to the exact target, and all reported pseudothresholds and loss-tolerance curves (Figs. 4-9) would shift. The paper itself lists an exact-vs-CC comparison as future work and provides no code or error bars, so this uncontrolled approximation is the main unresolved obstacle to accepting the quantitative loss-tolerance claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a causal framework for measurement-based loss tolerance in graph–GKP codes. Local GKP recovery is modeled as a flagged instrument that outputs a refreshed block, a continuous syndrome record, and a confidence score; low-confidence outcomes are converted into located erasures. The availability mask and graph branch are treated as deterministic functions of the same analog records used for error inference, so both accepted and rejected local decisions enter the selected-event likelihood (Eq. 43). The paper derives branch-compatible lattice compilation (Theorem III.1), syndrome-resolved closest-coset decoding, Pauli-frame pushforwards, recursive concatenation, and logical parity fusion (Theorem VII.1). Numerical simulations report finite-size pseudothresholds for square and hexagonal lattices and for adaptive/transversal fusion, with the caveat that all executable results use the closest-coset approximation rather than the exact wrapped likelihood.","tokens_in":34088,"tokens_out":6723,"duration_ms":81198,"significance":"If the framework is correct, it provides a useful unified statistical interface between continuous-variable GKP information and discrete graph-code control, which is relevant for MBQC, fusion-based computation, and photonic repeaters. The algebraic core is carefully presented, with Theorem III.1 and Theorem VII.1 proved and the accessibility polynomials (65) and (69) explicitly enumerated and checked at their fixed points. The paper is transparent about what is and is not included in the benchmarks. However, the quantitative loss-tolerance claims currently rest on an unvalidated closest-coset approximation and thin numerical support: no error bars, no Monte Carlo sample counts, and no code/data release. These gaps do not undermine the formal framework, but they prevent acceptance of the reported numerical thresholds as established results.","major_comments":[{"comment":"All executable loss-tolerance results (Figs. 4–9, 12–13 and the quoted intervals in Secs. V E, VI C–D, VII B) use the closest-coset score, not the exact wrapped likelihood. Equation (51) shows that the exact score differs from the CC score by a sector-dependent factor R_b(σ,e;D_b)≥1, and the text states that exact-vs-CC comparison is future work. Since thresholds, erasure decisions, and frame posteriors are calibrated within the CC model, the quantitative pseudothresholds are not yet supported. A small-module exact-vs-CC comparison, or at least a bound on the variation of R_b and the resulting posterior bias, is required before these numbers can be accepted.","section":"Sec. V C, Eq. (51)"},{"comment":"The benchmark curves have no error bars, no Monte Carlo sample counts, and no code/data release. The statement near Eq. (54) that frequentist accepted-frame errors are used to calibrate the confidence threshold is not backed by any validation data. Without these, the reported ℓ_ref and ℓ_br intervals and the square/hexagonal differences cannot be distinguished from statistical or systematic noise. Please provide reproducible code/data and convergence diagnostics, including the number of samples per point and confidence intervals.","section":"Sec. V E, Eqs. (74)–(76)"},{"comment":"The adaptive-versus-transversal fusion comparison is not normalized by expected Bell-attempt count or other resource consumption. The paper acknowledges this, but the central practical message of an 'adaptive advantage' is based solely on the half-success attenuation ℓ_1/2 under different attempt schedules. Because the adaptive policy can consume a variable number of Bell attempts and interface blocks, the comparison should at least report the expected number of attempts/resources at each operating point, or be explicitly labeled as a policy-level illustration rather than an architectural advantage.","section":"Sec. VII B, Figs. 12–13"}],"minor_comments":[{"comment":"Typo: 'speudothresholds' should be 'pseudothresholds'.","section":"Sec. VI C c"},{"comment":"The text uses 'pseudothreshold' for an attenuation-reference crossing. Since ℓ is a transmissivity deficit rather than a Pauli-error probability, 'reference crossing' is the more precise term; consider using it consistently to avoid confusion with fault-tolerance thresholds.","section":"Eqs. (75)–(76)"},{"comment":"Many curves are plotted without distinct markers, making them hard to distinguish at print size. Adding markers or separating into per-graph panels would improve readability.","section":"Figs. 6 and 7"},{"comment":"The notation for records D and subspaces C_i is occasionally left implicit. A short table of symbols for D_loc, D_out, C_b, R_b, and the branches would help the reader navigate the causal structure.","section":"Sec. II C"},{"comment":"There is no data-availability or code-repository statement. Given the prominent numerical claims, a reproducibility statement is strongly recommended.","section":"General"}],"recommendation":"major_revision","confidential_remarks":"The formal framework appears sound and the paper is a good conceptual contribution, but the quantitative claims are not yet ready without exact-vs-CC validation and reproducible numerical details. I recommend requiring the authors to provide code/data, Monte Carlo diagnostics, and at least a small-module exact-wrapped-likelihood comparison before acceptance. The large number of self-citations is not itself problematic, but several are background and could be trimmed. The manuscript otherwise fits the journal's scope."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Let me give you the short version first. This paper is worth taking seriously as a new decoder-interface construction, and its central move—keeping rejected local GKP syndromes in the graph-level likelihood and pushing a Pauli-frame posterior, rather than a hard decision, to the controller—is genuinely not in the cited literature. The algebraic scaffolding (Theorem III.1, Theorem VII.1, Appendices A and B) is coherent; I did not find a load-bearing formal error. The combinatorial accessibility polynomials (Eqs. 65, 69) check out at their fixed points. The paper ships no code, but the derivations are explicit enough to rebuild.\n\nThe soft spots are all in the numerical layer. Every simulation uses the closest-coset approximation (Eq. 50), and the omitted sector-dependent normalizer R_b in Eq. (51) could shift the reported pseudothresholds and loss-tolerance curves if it varies appreciably with the sector. The paper itself lists the exact-vs-CC comparison as future work, which is the right thing to do but means the quantitative claim is not yet validated. There are no error bars and no artifacts. The benchmark definition ell_ref (Eq. 75) is a self-referential crossing, not a fault-tolerance threshold; the authors say so, but the abstract's 'pseudothresholds' language is easy to over-read. The fusion comparison is explicitly not resource-normalized, and the A(θ) panels treat the non-Gaussian terminal resource as ideal. These are acknowledged restrictions, not hidden ones, and they are addressable.\n\nThe physical model—pure loss followed by quantum-limited amplification giving a single Gaussian displacement channel—is standard. The real fragility is not non-Gaussian backaction; it is whether the flagged instrument assumption (Eq. 22) holds in an actual implementation, i.e., whether recovery readout destroys the syndrome and whether independent losses can occur after recovery. That is an assumption to flag in a revision, but not a disqualifying flaw.\n\nWho is this for? People building photonic MBQC, fusion-based, or repeater controllers that need a soft-information interface between GKP recovery and graph-level pathfinding. It deserves a serious referee. The right peer-review request is: give us error bars, code/data, the exact-vs-CC comparison, a hard-decision baseline ablation, and a resource-normalized fusion accounting. I'd send it out.","headline":"A genuinely new decoder interface for graph-GKP, but the quantitative loss-tolerance claims outrun the provided numerical evidence.","tokens_in":34606,"tokens_out":1995,"would_cite":true,"duration_ms":19297,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper argues that graph–GKP loss tolerance requires a syndrome-resolved decoder in which low-confidence local GKP blocks become located erasures and rejected syndromes still contribute to the logical Pauli-frame posterior.","keywords":["GKP codes","graph codes","loss tolerance","Pauli-frame decoding","syndrome-resolved decoding","measurement-based quantum computation","fusion-based quantum computation","photonic repeaters"],"falsifier":"Run the same cube and decorated-pentagon benchmarks with the rejected-syndrome factors in Eq. (46) replaced by flag-only factors and with the availability mask drawn independently of the analog records; if accepted-frame error and fusion success do not worsen at the quoted attenuation-reference crossings, the central claim is not supported.","tokens_in":33673,"feed_emoji":"⚛️","tokens_out":5197,"duration_ms":62748,"temperature":0.7,"pith_summary":"The paper tries to establish a single causal statistical interface between GKP recovery and graph-level control for photonic measurement-based quantum computation. It claims that the availability of a graph node is not an independent random deletion but is generated by thresholding the analog GKP record, so both accepted and rejected local decisions must appear in the global likelihood. The correct output of a graph–GKP module is therefore a posterior over the outgoing logical Pauli frame, not a hard decoded bit. If true, this gives a common interface for logical Pauli measurements, non-Pauli transport, recursive concatenation, and fusion, with finite-size pseudothresholds for square and hexagonal lattices.","feed_headline":"Rejected GKP syndromes still count in the new decoder","feed_subtitle":"A graph–GKP decoder treats erasures as data-dependent and outputs a Pauli-frame posterior for MBQC.","key_machinery":"The selected-event closest-coset decoder: a covariance-weighted closest-coset approximation to the exact wrapped logical-coset maximum-likelihood target, evaluated on physical displacement sectors C_{σ,e} = τ_{σ,e} + L_G modulo the invisible sublattice K_b^lat. It carries the argument because the branch/availability event enters the likelihood as a deterministic function of the stored local records, and the resulting normalized sector posterior Π_b(σ,e|D_b) is pushed through the branch Pauli-transfer map τ_b to yield the controller-facing frame posterior Π_b^fr(f|D_b).","core_discovery":"The paper's central claim is that the availability mask and graph branch are deterministic functions of the local analog GKP records, expressed by b = B_Γ(Dloc_{1:n}). Consequently, the selected-event likelihood must include the probability of both accepted and rejected local decisions, and the normalized posterior over the outgoing logical Pauli frame, built by pushing the syndrome-resolved sector posterior through the branch's Pauli-transfer map, is the correct object for a controller. The paper derives this selected-event closest-coset decoder, shows that local abstention, accessibility failure, confidence failure, and accepted frame error are distinct events, and applies the same engine","pith_inferences":["Editorial inference: a direct decoder ablation, replacing the accepted/rejected local likelihood factors with hard erasure flags and treating the availability mask as independent, would quantify the practical gain of keeping rejected syndromes; the paper identifies this as a next step but does not run it.","Editorial inference: the omitted multiplicity factor R_b(σ,e;D_b) in the closest-coset approximation could be used to construct certified bounds on how far the max-log posterior is from the exact wrapped posterior, which would make small-module threshold claims stronger.","Editorial inference: the posterior-interface view suggests network-level confidence-aware routing in all-photonic repeaters, where a graph fragment's local GKP records inform whether to fuse, reroute, store, or discard it."],"forward_implications":["A graph–GKP module can export a full Pauli-frame posterior and confidence, allowing soft propagation of frame uncertainty through MBQC instead of a hard decision after every module.","Local abstention, accessibility failure, confidence failure, and accepted frame error are separated and not double-counted; raising the confidence threshold trades accepted Pauli error for located erasures that graph redundancy can route around.","The same selected-event closest-coset engine applies to logical Pauli measurements, protected A(θ) transport, recursive concatenation, and parity fusion, giving architectures one decoder interface.","Finite-size benchmarks show graph topology has a substantial effect on the loss-tolerance boundary, while the hexagonal lattice generally lowers logical failure through its larger shortest logical displacement.","Recursive concatenation should propagate posterior channels, not scalar erasure probabilities; scalar accessibility polynomials are only algebraic checks."],"supporting_citations":[{"why":"Supplies the GKP lattice conventions, stabilizer phase sector, and finite-energy state model used throughout the construction.","marker":"[12]"},{"why":"Provides the exact wrapped logical-coset maximum-likelihood target and the analog-syndrome decoding perspective that the closest-coset engine approximates.","marker":"[14]"},{"why":"Establishes that pure loss followed by quantum-limited amplification composes into an additive Gaussian displacement channel with the covariance used in Eq. (15).","marker":"[20–22]"},{"why":"Shows that loss-tolerant graph states exploit multiple logical representatives, the graph mechanism this framework conditions on decoder-generated erasures.","marker":"[7]"},{"why":"Supplies the availability-pattern graph pathfinding view that the paper extends by making availability a deterministic function of the analog records.","marker":"[9]"},{"why":"Provides the stabilizer syndrome/normalizer decomposition used to build outer syndrome sectors and the pushforward to logical frames.","marker":"[23]"}],"fun_headline_variants":["Both accepted and rejected syndromes shape the Pauli frame","Decoder maps local GKP records to data-dependent erasures","Graph-GKP decoder uses all syndrome outcomes for loss tolerance","Syndrome-resolved decoding combines GKP and graph branches","Erasures arise from confidence scores, not random sampling"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"The physical channel after loss and gain compensation is a single additive Gaussian displacement channel, and local GKP recovery is a nondestructive flagged instrument that returns both a refreshed block and a usable syndrome.","fun_headline_variants_meta":{"raw":{"variants":["Both accepted and rejected syndromes shape the Pauli frame","Decoder maps local GKP records to data-dependent erasures","Graph-GKP decoder uses all syndrome outcomes for loss tolerance","Syndrome-resolved decoding combines GKP and graph branches","Erasures arise from confidence scores, not random sampling"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000407,"raw_usage":{"total_tokens":1944,"prompt_tokens":733,"completion_tokens":1211,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":477,"completion_tokens_details":{"reasoning_tokens":1131}},"tokens_in":477,"tokens_out":1211,"duration_ms":10861,"temperature":1.0,"reasoning_tokens":1131,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T00:11:38.241331+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same cube and decorated-pentagon benchmarks with the rejected-syndrome factors in Eq. (46) replaced by flag-only factors and with the availability mask drawn independently of the analog records; if accepted-frame error and fusion success do not worsen at the quoted attenuation-reference crossings, the central claim is not supported.","supporting_citations":[{"cited_title":"Koudia, Physica Scripta99, 015115 (2024)","cited_arxiv_id":null,"evidence_quote":"Supplies the GKP lattice conventions, stabilizer phase sector, and finite-energy state model used throughout the construction."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the exact wrapped logical-coset maximum-likelihood target and the analog-syndrome decoding perspective that the closest-coset engine approximates."},{"cited_title":"Raussendorf, D","cited_arxiv_id":null,"evidence_quote":"Shows that loss-tolerant graph states exploit multiple logical representatives, the graph mechanism this framework conditions on decoder-generated erasures."},{"cited_title":"Morley-Short, M","cited_arxiv_id":null,"evidence_quote":"Supplies the availability-pattern graph pathfinding view that the paper extends by making availability a deterministic function of the analog records."}],"review_version":1}