{"id":"29ba2369-17b6-47bd-9eaa-ce314f4180a9","arxiv_id":"2608.07628","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":1,"one_line_summary":"For Haar-random state-tangent frames, the fraction of quantum Fisher information kept by a fixed-basis record and then by a rank-r diagonal readout are independent Beta variables, so low-weight readouts retain exponentially little information.","lead":"Quantum circuits can remain sensitive to parameter changes while a learning model that only reads low-order statistics barely reacts. The paper proves exact finite-size formulas for how much Fisher information survives the measurement and the readout, and shows numerically that generic circuits approach these laws as depth grows.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The exact Beta laws are sound, but the practical suppression for finite-depth circuits rests on an unproven isotropy crossover; the paper's own §III leaves a joint-frame approximation theorem open, and the numerics at d=6n still show KS distances near 0.16.","rationale":"The reader's weakest assumption is the same load-bearing point: the exact laws hold under Haar state-tangent isotropy, while finite-depth circuits only approach this condition empirically, with the paper explicitly leaving a joint-frame approximation theorem open. My independent review of the derivation found no flaw in Theorems 3 and 4 under their stated assumption; the projection identity, the chi-square decomposition, and the independence argument are all consistent. The real risk is that the practical, circuit-level claim of exponential readout suppression inherits an unproven isotropy crossover. The numerical evidence is honest and includes the U(1) control, which demonstrates that rank correction is not sufficient when anisotropy persists. This supports the reader's CONDITIONAL verdict rather than moving it: the central mathematical claim stands, but the finite-depth transfer remains a substantive open condition that should be stated even more prominently and, ideally, addressed in a revision. My proposed check would directly test orientation invariance of the readout law, isolating isotropy from rank and support effects.","tokens_in":18703,"tokens_out":21357,"duration_ms":231858,"concrete_test":"Use the paper's exact-statevector propagator at n=16 and d=6n with 1000 independent circuits. For each tangent, compute IA/Ffull for two readout spaces of the same centered rank r=14: (a) the fixed low-weight Walsh span span{chi_A : |A|<=1}, and (b) a freshly drawn random rank-14 subspace of the centered score space, for example random linear combinations of Walsh functions. Under the Haar state-tangent frame, both empirical distributions must be identical and exactly Beta(7, (N-7)/2). If the distribution for (b) differs from that for (a), or if either deviates significantly from the Beta law at this larger n, the finite-depth tangent is not isotropic and the exponential suppression is not guaranteed for arbitrary low-rank readouts.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorems 3 and 4 are internally sound: given a Haar state-tangent frame, the successive projections onto the probability sector and the readout subspace yield the claimed Beta laws, and the beta-gamma independence argument in Appendix A is valid. The load-bearing problem is the transfer to finite-depth generic circuits. Proposition 7 realizes the Haar frame only when the post-parameter suffix is an exact independent Haar unitary; for the tested circuits the paper explicitly states that no finite-depth joint-frame approximation theorem is proven (Section III). The numerical crossover is suggestive, but at d=6n the mean KS distance to the Beta laws is still about 0.16, and the exact distributional law is not claimed for finite depth. If the tangent is weakly anisotropic while FQ and Ffull remain of order one, the expected fraction retained by a low-rank readout could be parametrically larger than r/(2N); the U(1) control shows exactly this after support and rank corrections, with observed enhancements of 69x, 19x, and 6.4x for k=1,2,3. Hence the practical QML conclusion that every fixed-order diagonal readout retains only O(n^k 2^{-n}) of the full-record information is contingent on an isotropy assumption that the numerical evidence supports only partially and does not prove.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the gap between the quantum Fisher information F_Q, the Fisher information F_full in the full computational-basis bitstring distribution, and the maximum variance-normalized response I_A available to a diagonal readout space A for a pure-state tangent. Its main formal result is a score-projection identity (Prop. 2) and exact Beta-distribution laws (Theorems 3-4) for the two successive information fractions when the joint state-tangent frame is Haar random, with means 1/2 and r/(2^n-1); corollaries give exponential suppression O(n^k 2^{-n}) for all low-weight diagonal Pauli strings. The paper supports the finite-depth relevance with exact-statevector simulations across five nonconserving circuit families and a U(1)-conserving control, and it derives conditional variance-normalized gradient bounds for classical heads.","tokens_in":18920,"tokens_out":22759,"duration_ms":215229,"significance":"If the theorems hold as stated, this is a clean, parameter-free finite-size result that isolates a readout-rank mechanism distinct from existing barren-plateau and expressibility arguments. The paper's strengths are the self-contained projection proof, the explicit independence claim, falsifiable finite-size distributional predictions, the reproducible numerical pipeline (Zenodo archive), and the U(1) counterexample showing that rank alone is not sufficient. The principal caveat, acknowledged in the paper, is that the transfer of the exact laws to finite-depth circuits is not proven; the numerics show an increasing but incomplete approach to the Haar law. This caveat limits the practical reach but does not undermine the exact Haar-frame theorems.","major_comments":[{"comment":"The joint-frame approximation theorem for finite-depth circuits is explicitly left open, and the numerical evidence at d=6n still shows mean KS distances near 0.16 to the Beta laws. Because the abstract's first sentence and the QML discussion in Section V present the exponential suppression as the paper's practical message, the manuscript should state more prominently that the O(n^k 2^{-n}) statement is proven only for Haar state-tangent frames, while for finite-depth generic circuits it is a numerically supported crossover. This does not affect the correctness of Theorems 3-4, but it is the main gap between the exact result and the practical narrative.","section":"Section III (after Prop. 7) and abstract"}],"minor_comments":[{"comment":"There are duplicated passages in the full text: the paragraph beginning 'and 0.920-0.932 for k = 3' appears twice, and the discussion of the aggregate readout A≤k is repeated before and after Table I. These should be merged into a single coherent subsection.","section":"Section IV.B-IV.C"},{"comment":"The Zenodo archive reference would be more useful with a persistent DOI or URL, since the current entry gives only the author and title.","section":"Reference [35]"},{"comment":"In the paragraph introducing N_supp, it would help to state explicitly that for an invariant symmetry subspace the phase sector also has dimension M-1, so N_supp is the correct replacement in both Theorems 3 and 4; otherwise the reader may wonder why the invisible sector is also M-1 rather than 2D-M-1.","section":"Section III, support correction"},{"comment":"The sentence 'The accounting below exhausts the 9420 crossover jobs' is slightly cryptic; it would be clearer to state directly that the 20 blind and 6 vanishing tangents are part of the 9420 total and that none of the remaining jobs has p_z=0 with q_z≠0.","section":"Appendix B"}],"recommendation":"minor_revision","confidential_remarks":"The paper is within scope for a quantum information journal. The main concern is the finite-depth transfer, but the authors are transparent about it and the exact Haar-frame theorems are sound. A wording adjustment in the abstract and the cleanup of duplicated text should suffice; I do not see a need for new technical results."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read this one. The core result is a genuinely clean piece of information geometry: under a Haar joint state–tangent frame, the two information fractions Ffull/FQ and IA/Ffull are independent Beta variables with means 1/2 and r/N. The proof via chi-square decomposition is short and correct, and the corollaries for low-weight Walsh subspaces are the right way to state the practical consequence—even the joint span of all diagonal Pauli strings through fixed weight k retains only Θ(n^k 2^{-n}) of the full record. The paper earns its keep on the exact side: parameter-free predictions, analytic tangent propagation, exact-statevector checks against the Beta laws, and a deliberate U(1) control that breaks the law. The author also states the limits clearly, including the fact that the joint-frame approximation theorem for finite-depth circuits is left open.\n\nThe soft spot is exactly that crossover. Proposition 7 gives a sufficient condition—an independent Haar suffix—but for the tested generic circuits the paper explicitly says no finite-depth joint-frame approximation theorem is proven. At d=6n the mean KS distance to the Beta laws is still around 0.16. That means the finite-depth evidence is a suggestive crossover, not a derivation. The U(1) family shows the danger: after support and rank corrections, observed retention is 69x, 19x, and 6.4x above the rank-law prediction. So the broad QML claim that fixed-order diagonal readouts exponentially lose information is only as strong as the isotropy assumption, and the numerics support that assumption only partially. I don't think this undermines the exact Haar-frame theorems, which are the paper's real contribution. It does limit how far the results transfer to arbitrary circuits.\n\nMinor issues: the Zenodo archive is cited but has no URL or DOI, and no commit hash is given; for sample-level CSVs that should be fixed. There is also a duplicated block of text in Section IV, which a copyedit would catch.\n\nWho is this for? People working on QML gradient behavior, readout design, or information geometry of parameterized circuits. The exact laws are worth knowing even if the finite-depth story is unresolved. I'd take it for review, with the understanding that the main thing to demand in revision is either a real joint-frame approximation result or a more guarded statement about the finite-depth regime. I'd cite it for the Beta laws.","headline":"Exact Beta laws for readout information are clean and correct under isotropy; the main gap is that the finite-depth transfer is left as an unproven crossover.","tokens_in":19480,"tokens_out":1873,"would_cite":true,"duration_ms":18481,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"For a Haar-random joint state and tangent frame, the two information losses in a fixed-basis readout are independent Beta variables, and any fixed-weight Pauli readout retains only $\\Theta(n^k 2^{-n})$ of the full-record information.","keywords":["quantum Fisher information","readout-rank law","Haar-random tangent frames","Beta distribution","parameterized quantum circuits","barren plateaus","diagonal Pauli readouts","tangent isotropy"],"falsifier":"Evaluate $F_{\\rm full}/F_Q$ and $\\mathcal I_{\\le k}/F_{\\rm full}$ for a generic circuit family at depth $d=6n$ across $n=6,\\dots,14$: under the rank law the mean of $\\mathcal I_{\\le k}/F_{\\rm full}$ should approach $r_k/(2^n-1)$ and the probability-integral-transformed samples should approach uniformity. The claim would be falsified if the mean stays bounded away from the rank prediction as depth grows, or if the number-conserving discrepancy (observed fractions $0.262$, $0.501$, $0.680$ against rank-law predictions $0.0038$, $0.0262$, $0.1058$ at $n=14$) persists after fully scrambling within the symmetry sector.","tokens_in":18454,"feed_emoji":"📉","tokens_out":12229,"duration_ms":95673,"temperature":0.7,"pith_summary":"A parameterized quantum circuit can have a healthy state tangent while a learning model built from a fixed measurement record barely responds. This paper proves that the separation is governed by two successive orthogonal projections: from the full quantum tangent to the probability-changing sector of the computational basis, and then from the complete bitstring record to the span of the retained observables. When the joint state–tangent frame is Haar random, the two information fractions are independent Beta variables with means $1/2$ and $r/(2^n-1)$, so the identity of individual observables matters only through the centered rank $r$ of the subspace they span. The quantitative consequence is that even the joint span of all diagonal Pauli strings through fixed weight $k$ retains only $\\Theta(n^k 2^{-n})$ of the full-record information on average. Exact-statevector experiments show increasing agreement with this hierarchy for five nonconserving circuit families as depth grows, while a number-conserving family violates the law even after support and rank corrections.","feed_headline":"Quantum readouts of fixed order keep only an exponentially small slice","feed_subtitle":"Under isotropic frames, even all weight-k Pauli strings retain only an exponentially small fraction of the record.","key_machinery":"The load-bearing object is the score-projection identity $\\mathcal I_{\\mathcal A}=4\\|P_{W_p(\\mathcal A)}x\\|^2$, which turns readout accessibility into ordinary Euclidean projection of the probability tangent $x$ onto the centered score subspace $W_p(\\mathcal A)$. The distributional law comes from the classical hyperspherical projection law: the squared norm of a uniformly distributed sphere vector projected onto a fixed subspace is Beta-distributed. In the Haar frame, the $2N$ real tangent coordinates split into three independent chi-square blocks of dimensions $r$, $N-r$, and $N$, giving the successive Beta laws and their independence. The circuit-side machinery is the independent Haar suffix construction: if a circuit can be cut as $U_{\\rm post}|a_\\theta\\rangle$ with $U_{\\rm post}$ an independent Haar unitary, the output state and tangent form a Haar two-frame, so all laws hold exactly. The numerical protocol uses exact-statevector propagation of state and tangent together, with support and Gram-rank corrections for symmetry sectors.","core_discovery":"The central discovery is an exact finite-size readout-rank law for isotropic quantum tangents. For a Haar-random orthonormal two-frame (state and horizontal tangent), the fixed computational basis projects the $2N$-dimensional real tangent onto an $N$-dimensional amplitude sector, and a centered rank-$r$ diagonal readout projects that sector onto $r$ score directions. The ratios $F_{\\rm full}/F_Q$ and $\\mathcal I_{\\mathcal A}/F_{\\rm full}$ are independent Beta variables, with means $1/2$ and $r/N$, and consequently $\\mathbb E[\\mathcal I_{\\mathcal A}/F_Q]=r/(2N)$. Because all computational-basis Pauli strings through weight $k$ span a centered subspace of dimension $r_k=\\sum_{j=1}^k \\binom{n}{j}$, the expected retained fraction is $\\Theta(n^k 2^{-n})$ for every fixed $k$. The paper argues that this exponential suppression is a readout-compression effect, not a loss of state sensitivity: the state and the full bitstring record can both respond at order one while fixed-order observables see almost nothing. The paper also demonstrates, through the number-conserving counterexample, that rank is predictive only when the tangent is isotropic; outside that regime the orientation of the probability tangent inside the readout subspace still matters.","pith_inferences":["If the isotropic crossover seen in deep generic circuits persists beyond $n=14$, then variational quantum classifiers built from low-weight Pauli features have an information ceiling independent of their optimizer and classical post-processing; adding more low-weight features with redundant spans would not help, and escaping the bottleneck requires changing the measurement basis, raising the reado","The same hyperspherical projection law applies to any isotropic tangent in a finite probability simplex, so an analogous exponential gap between full-record and low-rank readout information should appear in high-dimensional classical probabilistic models whenever their score tangents are approximately isotropic; this suggests the phenomenon is not uniquely quantum.","A testable extension is to randomize the measurement basis: randomized-basis estimation recovers half of the quantum Fisher information, but combining basis randomization with a rank-$r$ readout should reduce the factor-$1/2$ loss while leaving the rank-$r$ compression, and the resulting distribution of $\\mathcal I_{\\mathcal A}/F_Q$ would need a new derivation.","The number-conserving counterexample suggests symmetry sectors can preserve low-weight tangent modes; an adaptive readout that measures the actual Gram rank and adds observables in directions of large residual score could exploit this, but the paper leaves that measurement-design problem open."],"forward_implications":["A classifier whose features are the $n$ single-qubit expectations $\\langle Z_i\\rangle$ implements a rank-$n$ readout inside a score space of dimension $2^n-1$; under isotropy its expected fraction of the full record is $n/(2^n-1)$, about $0.085\\%$ at $n=14$, and its expected fraction of the quantum Fisher information is about $0.043\\%$.","Using every diagonal Pauli string through weight $k$ jointly does not remove the bottleneck: the joint feature space has rank $r_k=\\sum_{j=1}^k \\binom{n}{j}$, and the expected retained fraction of the full record remains $\\Theta(n^k 2^{-n})$ for fixed $k$.","The variance-normalized gradient of any differentiable classical head is bounded by $\\mathcal I_{\\le k}$, so for isotropic tangents its expected value relative to $F_Q$ is $\\Theta(n^k 2^{-n})$; with polynomial bounds on the classical head and feature covariance, the raw squared gradient inherits an exponential factor, giving a conditional readout-induced mechanism rather than a full barren-plateau","Number-conserving circuits at half filling violate the rank law even after correcting the measurement support and the actual Gram rank of the readout, showing that tangent isotropy, not just readout rank, is the essential condition for the hierarchy.","For Haar frames the laws are exact at finite size, including fluctuations; finite-depth generic circuits only approach them with depth, so the exact Beta distributions are not automatically valid for arbitrary circuits."],"supporting_citations":[{"why":"Defines the quantum Fisher information and the measurement bound that supply the reference quantity $F_Q$.","marker":"[7]"},{"why":"Supplies the hyperspherical projection law used to derive the Beta distributions in Theorems 3 and 4.","marker":"[18]"},{"why":"Defines the classical Fisher information in the bitstring distribution that is compared against the quantum bound.","marker":"[22]"},{"why":"Gives the Haar two-frame construction used to model the joint state–tangent distribution.","marker":"[24]"},{"why":"Motivates finite-depth random circuits as approaching unitary designs, the deep-circuit limit the paper tests numerically without assuming convergence.","marker":"[27]"},{"why":"Explains why number-conserving circuits require parametrically greater depth to reach design behavior, contextualizing the U(1) counterexample.","marker":"[32]"}],"fun_headline_variants":["Fixed-order quantum readouts retain an exponentially tiny slice","Isotropic tangents: even all weight-k observables see only an exponential sliver","Readout-rank law: fixed-order Pauli strings capture O(n^k/2^n) of the record","Exponential suppression of fixed-order readouts in isotropic quantum systems"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The central claim relies on the assumption that the state and its infinitesimal change form a direction-independent, Haar-random two-frame relative to the measurement; if the change has a preferred orientation, the predicted Beta laws and the exponential readout suppression can fail, exactly as the number-conserving counterexample shows.","fun_headline_variants_meta":{"raw":{"variants":["Fixed-order quantum readouts retain an exponentially tiny slice","Isotropic tangents: even all weight-k observables see only an exponential sliver","Readout-rank law: fixed-order Pauli strings capture O(n^k/2^n) of the record","Exponential suppression of fixed-order readouts in isotropic quantum systems"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000842,"raw_usage":{"total_tokens":3712,"prompt_tokens":1033,"completion_tokens":2679,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":649,"completion_tokens_details":{"reasoning_tokens":2596}},"tokens_in":649,"tokens_out":2679,"duration_ms":17719,"temperature":1.0,"reasoning_tokens":2596,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T00:29:10.811202+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Evaluate $F_{\\rm full}/F_Q$ and $\\mathcal I_{\\le k}/F_{\\rm full}$ for a generic circuit family at depth $d=6n$ across $n=6,\\dots,14$: under the rank law the mean of $\\mathcal I_{\\le k}/F_{\\rm full}$ should approach $r_k/(2^n-1)$ and the probability-integral-transformed samples should approach uniformity. The claim would be falsified if the mean stays bounded away from the rank prediction as depth grows, or if the number-conserving discrepancy (observed fractions $0.262$, $0.501$, $0.680$ against rank-law predictions $0.0038$, $0.0262$, $0.1058$ at $n=14$) persists after fully scrambling within the symmetry sector.","supporting_citations":[{"cited_title":"Zamir, A proof of the Fisher information inequality via a data processing argument, IEEE Trans","cited_arxiv_id":null,"evidence_quote":"Defines the quantum Fisher information and the measurement bound that supply the reference quantity $F_Q$."},{"cited_title":"Ragoneet al., A lie algebraic theory of barren plateaus for deep parameterized quantum circuits, Nat","cited_arxiv_id":null,"evidence_quote":"Supplies the hyperspherical projection law used to derive the Beta distributions in Theorems 3 and 4."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the classical Fisher information in the bitstring distribution that is compared against the quantum bound."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the Haar two-frame construction used to model the joint state–tangent distribution."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Motivates finite-depth random circuits as approaching unitary designs, the deep-circuit limit the paper tests numerically without assuming convergence."}],"review_version":1}