{"id":"d9f5ecc5-f278-459b-8500-10d1930c0396","arxiv_id":"2608.02333","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A monitored quantum trajectory can be compressed to its type counts without losing quantum Fisher information or model recovery, while universal state recovery still requires the full ordered record.","lead":"Quantum sensors that monitor their own noise can compress the recorded noise labels dramatically if the goal is only metrological precision or model recovery, but not if the goal is full quantum state recovery. This paper gives exact conditions for such compression and shows the memory requirement is task-dependent, linking quantum sensing, statistics, and quantum error correction.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: Theorem 3's construction and supporting inequalities are internally consistent within the explicitly declared orthogonal-pointer architecture.","rationale":"The reader identified the orthogonal-pointer architecture as the weakest assumption; I agree that this is the boundary of the theorem's scope, but it is stated explicitly and does not threaten the theorem as formulated. The central construction in Theorem 3 is deliberately flat in its normalized conditional outputs, and the paper's complete-model obstruction explains why this flatness is necessary in the informationally complete faithful regime. All the mathematical steps I checked are internally consistent: the syndrome-compression identity, the order-forgetting criterion, the multinomial span lower bound, and the Knill-Laflamme incompatibility argument. The only small presentational gap is that Eq. (S49) suppresses the z-dependence of the effective classical recovery map obtained by tracing out the quantum output; however, fixing z=0 repairs this immediately and preserves the rank lower bound. Because no internal inconsistency or unstated load-bearing condition emerged, the correct verdict remains ACCEPT with moderate confidence, consistent with the reader's assessment.","tokens_in":24035,"tokens_out":30655,"duration_ms":347746,"concrete_test":"Re-derive the classical lower bound at the fixed signal value z=0, where the retained quantum output is maximally mixed, and verify that the induced recovery map R_0 is a linear stochastic matrix satisfying R_0 C p(q)=p(q) for all interior q. Then compute the numerical rank of the 27x10 matrix of p(q) vectors for r=3, n=3 over a random grid of interior q; if the rank is not 10, the M_model lower bound has a hidden gap.","verdict_should_be":"UNCHANGED","load_bearing_attack":"After re-deriving the key steps, I do not find a load-bearing gap in the central existence claim. Theorem 1's Pythagorean remainder and Corollary 1's support condition are correct; Theorem 2's order-forgetting argument (exchange of two tensor factors forcing scalar differences of SLDs) is valid for faithful blocks; the type-map construction in the Supplemental Material yields QFI losslessness because the accumulated-score map is injective on types; the M_model lower bound from the span of multinomial probability vectors is sound because tracing out the retained quantum output at a fixed signal value (say z=0) induces a linear stochastic map, so any recovery through an M-symbol alphabet forces M >= binom(n+r-1,r-1); and the M_state=r^n bound follows from the complete Knill-Laflamme incompatibility graph. The weakest point is the explicitly stated orthogonal-pointer/classical-label scope: the r^n lower bound and the whole rate separation are proven only for classical post-processing of projective label records. This is a boundary of the claim, not a hidden assumption, and the paper flags coherent-controller bounds as requiring separate theory. I therefore see no reason to change the reader's ACCEPT.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies how much of the classical record produced by a monitored quantum instrument must be retained in order to preserve metrological information, to recover the full signal-and-noise statistical model, and to recover arbitrary quantum states. The main results are: (i) an exact Pythagorean identity (Theorem 1) for the QFI lost under coarse graining of the fine syndrome record, with a support-resolved lossless criterion; (ii) a characterization (Theorem 2) of when trajectory order can be forgotten, namely when the branch SLD scores differ from a common term by scalar multiples of the identity, with a stability bound for defects; (iii) explicit faithful qubit constructions (Theorem 3) in which the QFI-optimal and full-model-recovery record has size binom(n+r-1,r-1) (zero terminal rate), while deferred arbitrary-state recovery requires r^n records (log_2 r bits per use); (iv) a graph-theoretic formulation (Theorem 4) of the minimum recovery and feedback alphabet, showing that online correction can recycle memory but pays an irreducible per-use alphabet; and (v) a Stinespring Pythagorean identity (Theorem 5) connecting the finite-syndrome result to general channel recovery. The proofs of the central constructions are analytic and are largely deferred to the Supplemental Material, including the detailed proof of Theorem 3's lower bounds.","tokens_in":24211,"tokens_out":13029,"duration_ms":160744,"significance":"The central claim, if correct, is a clean separation between statistical sufficiency for parameter estimation and universal state recovery. The manuscript's exact rate statement, namely zero terminal rate for full signal-and-noise model recovery versus log_2 r bits per use for deferred universal recovery in the same monitored qubit family, is striking and is supported by explicit constructions rather than by numerical fits or fitted parameters. The paper also gives a sharp obstruction to nonflat full-model recovery in the informationally complete faithful regime, a quantitative conditioning result for approximate score rigidity, and an exactly solvable continuous-axis benchmark. The scope is honestly delimited: the orthogonal-pointer architecture, classical post-processing of labels, and independent faithful blocks are stated as assumptions, and the paper explicitly leaves rank-deficient order-forgetting and coherent-controller resource bounds to future work. I find the derivations internally consistent, and I have no load-bearing technical objection.","major_comments":[],"minor_comments":[{"comment":"Two passages refer to a nonexistent 'Theorem IV' ('...realize Theorem IV' and 'the complete-graph family of Theorems IV and 3'). The intended reference appears to be Theorem 4 in the first instance and Theorems 3 and 4 in the second; please correct the numbering, since the current text is confusing.","section":"§IV, 'Noncommuting realization' and Theorem 4 proof"},{"comment":"The abstract and introductory sentences state the compression result without the orthogonal-pointer and classical-label qualification that is introduced in Proposition 1 and reiterated in Section V. Because the exact rate separation is proven only for that architecture and for independent faithful blocks, I recommend stating this scope in the abstract or at the first occurrence of the central claim.","section":"Abstract and §I"},{"comment":"The definition of M_model is compact: it should explicitly say whether the terminal post-processing may be stochastic and whether the recovery channel acts jointly on the retained quantum output and the classical record. The Supplement's proof handles stochastic post-processing, but the main-text statement currently leaves this to inference.","section":"§IV, Theorem 3"},{"comment":"The exact order-forgetting criterion in Eq. (19) and the accumulated-score condition assume faithfulness; the rank-deficient support condition in Corollary 1 is the more general statement. Since the paper explicitly defers rank-deficient order forgetting to future work, a sentence in Section III reminding the reader that Theorem 2 does not cover rank-deficient blocks would prevent overreading.","section":"§III, Theorem 2"},{"comment":"The threshold result in Eq. (35) is stated with 'r_n' for the alphabet size, but the immediately preceding sentence writes 'size rn' without a subscript; the notation should be made consistent, and the proof, currently only in the Supplement, could be sketched in one line using the given binomial bound.","section":"§IV, 'Growing alphabets'"},{"comment":"The sentence 'The proof and experimental interpretation of Proposition 1 are given in the Supplemental Material [16]' is missing a period before 'The construction makes explicit...'; also, the main text relies on the Supplement for several key proofs, including Theorems 5 and S3 and details of Theorem 3, so the permanent availability of the Supplement should be guaranteed.","section":"After Proposition 1"}],"recommendation":"minor_revision","confidential_remarks":"The manuscript is well within the journal's scope and the central rate separation is likely to be of broad interest. I recommend minor revision; the main points to fix are the Theorem IV numbering, a few definitional clarifications, and some notation consistency. I do not see any circularity or overclaiming beyond the explicitly stated orthogonal-pointer architecture."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The short version: this is a solid theory paper and the central claims hold up on re-derivation. It proves an exact QFI-loss identity for compressing monitored syndrome records, gives a clean criterion for when trajectory order can be forgotten, and constructs an explicit faithful qubit model where complete model recovery needs only polynomially many type records while deferred arbitrary-state recovery needs exponentially many. That separation is the real contribution, and it is not in the earlier QFI-compression literature.\n\nWhat is genuinely new: Theorem 1's Pythagorean remainder (with the support-resolved zero-loss condition), Theorem 2's common-score order-forgetting criterion, and Theorem 3's explicit rate separation. The stress-test note re-derived the key steps and I agree there is no load-bearing gap. The proofs live mostly in the supplementary material, but they are real proofs—including a rigorous Lloyd-type algorithm with an exact one-swap refinement and a conditional approximate rigidity theorem that is honestly labeled structural rather than practical. The paper is also upfront about its architecture: orthogonal-pointer fine records, independent faithful blocks, and parameter-independent classical processing of labels. That is a genuine boundary of the claims, not a hidden assumption; the authors explicitly flag coherent-controller bounds as future work.\n\nSoft spots, in proportion: the main text has a 'Theorem IV' typo that should be fixed, and the stability bound in Eq. (25) is loose (per-use loss, not asymptotically vanishing). Neither undermines the results. More substantively, the complete-model recovery in Theorem 3 works because the normalized conditional states are identical in the informationally complete regime—the complete-model obstruction shows this is forced, so it is internally consistent, but anyone applying the model-recovery result should know it does not cover non-flat branch structure. The two-layer rate separation is proven only for classical post-processing of projective label records; that is the declared scope.\n\nWho it is for: anyone working on quantum sensing with monitored noise, syndrome compression, or erasure conversion. It deserves a serious referee; I would accept with minor revisions. I would also cite it if I were writing on QFI-preserving compression or monitored metrology.\n\nRecommendation: send it to review. It is a within-subfield advance with solid math and an honest statement of its limits.","headline":"Solid, self-contained theory paper: exact syndrome-compression identity plus a clean task-dependent polynomial-vs-exponential memory separation; worth a serious referee.","tokens_in":24719,"tokens_out":2741,"would_cite":true,"duration_ms":28046,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P50","94A17","62B10","81P45"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper shows that the record of a monitored noise trajectory can be compressed to a small type summary without losing quantum Fisher information, but the same record resists compression when the task is universal recovery of the…","keywords":["quantum Fisher information","symmetric logarithmic derivative","syndrome compression","sufficient statistics","type classes","quantum state recovery","monitored quantum trajectories","quantum error correction"],"falsifier":"Implement the explicit qubit family of Theorem 3 and check whether the score map is injective on type counts: if two distinct type vectors $k$ and $\\ell$ ever give the same accumulated score vector $u(k) = u(\\ell)$ for some $r$ and $n$, the claimed lossless type record $M_{\\mathrm{model}}^{(n)} = \\binom{n+r-1}{r-1}$ would fail; conversely, if two distinct $n$-use trajectories of that family satisfy the Knill--Laflamme condition and can share one terminal recovery flag, the claimed $r^n$ state-recovery bound would collapse.","tokens_in":1886,"feed_emoji":"⚛️","tokens_out":3386,"duration_ms":83872,"temperature":0.7,"pith_summary":"Syndrome information -- the record of which noise event occurred in a monitored quantum sensor -- is not a single resource: how much of that record must be stored depends on what task it serves. The paper proves an exact identity giving the quantum Fisher information lost when a fine noise trajectory is compressed to a coarser syndrome, together with a criterion under which the ordering of noise events can be forgotten entirely. For an explicit faithful monitored qubit family, the complete joint signal-and-noise model is recoverable from only polynomially many type records, requiring $O(\\log n)$ terminal memory, whereas deferred recovery of arbitrary $n$-qubit input states from the same record requires all $r^n$ trajectories, or $O(n)$ memory. If the claim is right, syndrome memory is a task- and timing-dependent resource that connects quantum sensing, statistical sufficiency, and quantum error correction.","feed_headline":"Noise record: polynomial for metrology, exponential for recovery","feed_subtitle":"A small type summary preserves the whole noise model in O(log n) memory; universal state recovery still needs every trajectory.","key_machinery":"The argument is carried by the exact symmetric-logarithmic-derivative (SLD) geometry of flagged quantum states: Theorem 1 gives a Pythagorean remainder identity, $F_Q(\\Omega_{\\theta}^{\\mathrm{fine}}) - F_Q(\\Omega_{\\theta}^{(f)}) = \\sum_a \\operatorname{Tr}[\\tau_a(S_a - T_{f(a)})^2]$, which yields a necessary and sufficient support-resolved criterion for lossless syndrome compression. Theorem 2 establishes that, for faithful independent blocks, trajectory order can be forgotten exactly when each branch SLD takes the common-score form $S_{a,\\mu} = L_\\mu + s_{a,\\mu} I$, in which case the accumulated scalar score, a function only of the type vector, is the minimal QFI-preserving statistic and the type map has size $\\binom{n+r-1}{r-1}$. The state-recovery lower bound uses the Knill--Laflamme incompatibility graph: distinct trajectories in the explicit family are pairwise incompatible, making the graph complete with chromatic number $r^n$, which Theorem 4 converts into the minimum terminal alphabet for deferred recovery and the per-use feedback alphabet for online correction.","core_discovery":"The central claim is that monitored-noise records carry strictly different amounts of information depending on whether the intended use is metrological inference, complete statistical-model recovery, or universal quantum-state recovery. For a faithful $r$-parameter qubit model with $r$ fine random-unitary errors per use, the paper constructs an explicit family in which the quantum Fisher information is preserved exactly by the type-record compressor, giving $M_{\\mathrm{QFI}}^{(n)} = M_{\\mathrm{model}}^{(n)} = \\binom{n+r-1}{r-1}$, while exact deferred recovery of arbitrary $n$-qubit states requires $M_{\\mathrm{state}}^{(n)} = r^n$ terminal records. The rates separate: the terminal model-recovery record rate is zero, while the terminal state-recovery rate is $\\log_2 r$ bits per use. A graph-theoretic formulation shows that online correction can recycle a single register but replaces terminal storage by an irreducible per-use readout and feedback alphabet, so syndrome information is never eliminated, only shifted in timing.","pith_inferences":["The $O(\\log n)$ model-recovery memory suggests that syndrome-based noise spectroscopy and self-calibration could in principle run on bounded classical memory, provided the orthogonal-pointer architecture can be engineered in a practical sensor; this extension is not proven in the paper.","The trichotomy -- QFI preservation, complete-model recovery, universal state recovery -- likely extends beyond qubits and random-unitary noise, with the defect-matrix inequality in Theorem 2 giving a quantitative loss estimate for approximate type compression in more general models.","A concrete experimental test could monitor the QFI under a coarse partition of a two-outcome qubit channel with detector confusion, where the paper's formula predicts the exact retained QFI as a function of the error and confusion probabilities.","The informational-completeness obstruction suggests that non-flat full-model recovery is only possible when the coarse family occupies a proper sufficient subsystem, which may limit the ambition of record-compression schemes for full characterization of quantum channels."],"forward_implications":["For the explicit monitored qubit family, the complete joint signal-and-noise statistical model can be reconstructed from polynomially many type records using only $O(\\log n)$ bits of terminal memory.","Deferred recovery of arbitrary $n$-qubit input states from the same classical record requires exponentially many terminal records, so syndrome memory is task-dependent, not a fixed property of the noise process.","Online correction does not remove the syndrome bottleneck: it trades terminal storage for an irreducible readout and feedback alphabet of at least the chromatic number $\\chi(G_P)$ on every use.","If the per-use alphabet grows sublinearly ($r_n = o(n)$), the terminal model-recovery rate remains zero, so the polynomial-vs-exponential separation is not an artifact of fixed alphabet size.","A zero-QFI-loss partition exists exactly when the fine SLD scores share a common non-scalar part; when this common-score form holds throughout a parameter region, the parameter-independent type map is lossless throughout that region."],"supporting_citations":[{"why":"Provides the symmetric-logarithmic-derivative definition and QFI formalism on which every identity in the paper is built.","marker":"[14]"},{"why":"Supplies the extended-convexity remainder that the exact normalized residual refines into a precise compression gap.","marker":"[19]"},{"why":"Gives the Knill--Laflamme conditions used to prove that distinct trajectories can never share a recoverable terminal flag in the state-recovery lower bound.","marker":"[20]"},{"why":"Provides the Petz recovery map used in the informational-completeness obstruction that forces flat branch structure for reversible model recovery.","marker":"[23]"},{"why":"Underlies the channel information--disturbance tradeoff used in the conditioned approximate-rigidity theorem that bounds recovery error from local metrological losses.","marker":"[28]"},{"why":"Represents the classical sufficient-statistics and type-class theory that the paper's type-compression construction extends to the quantum flagged setting.","marker":"[12]"}],"fun_headline_variants":["Noise compression: polynomial for sensing, exponential for recovery","Quantum memory split: sensing polynomial, recovery exponential","Task-dependent records: sensing compresses, recovery expands","Metrology: O(log n) memory. Recovery: O(n) memory","Same noise, different memory: sensing log, recovery exponential"],"cache_read_input_tokens":27008,"weakest_assumption_plain":"The entire compression framework assumes the fine noise record is already available as classical labels produced by an orthogonal pointer (an ancilla or accessible environment sector), and that only parameter-independent classical processing of those labels is allowed while the quantum outputs are left untouched.","fun_headline_variants_meta":{"raw":{"variants":["Noise compression: polynomial for sensing, exponential for recovery","Quantum memory split: sensing polynomial, recovery exponential","Task-dependent records: sensing compresses, recovery expands","Metrology: O(log n) memory. Recovery: O(n) memory","Same noise, different memory: sensing log, recovery exponential"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000835,"raw_usage":{"total_tokens":3613,"prompt_tokens":886,"completion_tokens":2727,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":502,"completion_tokens_details":{"reasoning_tokens":2645}},"tokens_in":502,"tokens_out":2727,"duration_ms":20425,"temperature":1.0,"reasoning_tokens":2645,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T04:06:35.987675+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Implement the explicit qubit family of Theorem 3 and check whether the score map is injective on type counts: if two distinct type vectors $k$ and $\\ell$ ever give the same accumulated score vector $u(k) = u(\\ell)$ for some $r$ and $n$, the claimed lossless type record $M_{\\mathrm{model}}^{(n)} = \\binom{n+r-1}{r-1}$ would fail; conversely, if two distinct $n$-use trajectories of that family satisfy the Knill--Laflamme condition and can share one terminal recovery flag, the claimed $r^n$ state-recovery bound would collapse.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the symmetric-logarithmic-derivative definition and QFI formalism on which every identity in the paper is built."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the extended-convexity remainder that the exact normalized residual refines into a precise compression gap."},{"cited_title":"Unden, P","cited_arxiv_id":null,"evidence_quote":"Gives the Knill--Laflamme conditions used to prove that distinct trajectories can never share a recoverable terminal flag in the state-recovery lower bound."},{"cited_title":"Choi, Illinois Journal of Mathematics18, 565 (1974)","cited_arxiv_id":null,"evidence_quote":"Underlies the channel information--disturbance tradeoff used in the conditioned approximate-rigidity theorem that bounds recovery error from local metrological losses."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Represents the classical sufficient-statistics and type-class theory that the paper's type-compression construction extends to the quantum flagged setting."}],"review_version":2}