{"id":"6ce6bf7a-5cda-4d90-a7f7-2d5cd3676960","arxiv_id":"2608.01770","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Fidelity estimation to a known rank-r reference state requires Theta-tilde(r^2/epsilon^2) copies, closing the factor-r gap between known upper and lower bounds.","lead":"This paper settles the sample complexity of estimating fidelity to a known low-rank quantum reference state, proving a quadratic-in-rank lower bound that matches the known upper bound up to logarithms. The result marks a real limit on how efficiently quantum states can be compared when one state is known in advance.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 3.4's condition (26) is insufficient: substituting it into (36) leaves a B^{K-1} factor, so the Newton-ball bound (39) is unproved and the moment-twin construction in Prop. 3.1 is not established.","rationale":"Most of the proof is coherent: the Wishart–Schur identities (Lemmas 3.5, 3.7), long-cycle cancellation (Prop 3.9), nuclear-norm concentration (Lemma 4.1), and the binomial-thinning embedding (Lemma 4.3) all check out at the level of displayed equations. The single load-bearing soft spot is the exact moment-twin construction, exactly where the reader placed its weakest assumption. I found a specific inequality in Lemma 3.4 that does not close: (26) is too weak to yield (39) for the B values used later. Because Proposition 3.1 is the foundation of the hard family, Theorem 1.1 is not fully proved until this is fixed. The flaw is technical and likely fixable — it affects constants/exponents in a size condition, not the overall strategy — so I would not reject the paper; I would make acceptance conditional on a corrected Lemma 3.4. This goes slightly beyond the reader's verdict, which accepted with medium confidence. I agree with the reader that Prop 3.1/Lemma 3.4 is the weakest assumption, but our concrete algebraic objection is new.","tokens_in":16891,"tokens_out":36122,"duration_ms":412410,"concrete_test":"Independently re-derive Lemma 3.4's implication (26)⇒(39). Take B=(K+2)^M with M=40, η=10^{-8}, and r = ceil(η^{-1} B K (C_pcK)^{5K}) with the paper's C_pc; compute L0 = η^{-1}(CK)^K K B^K/r and ρ=(C_1K)^{-3K}/2 for K=5,10,20 and verify whether L0≤ρ/2. If it fails, test the strengthened condition r ≥ η^{-1} B^K K (C_pcK)^{C M K} and confirm both (28) and the K-range (29). Also check the Lagrange inverse norm bound (35) directly for these parameters.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"In Lemma 3.4, after rounding, the authors define e_k and set L0 = ||A^{-1}e||∞ ≤ η^{-1}(CK)^K K B^K/r (Eq. 36). They then claim (39), L0 ≤ ρ/2 with ρ=(C_1K)^{-3K}, follows from condition (26), r ≥ η^{-1} B K (C_pcK)^{5K}. Substituting (26) into (36) gives only L0 ≤ η^{-1}(CK)^K K B^K / [η^{-1} B K (C_pcK)^{5K}] = (CK)^K B^{K-1}/(C_pcK)^{5K}, not the stated bound. In the main application B ≤ C_B(K+2)^M with M=M* large (needed in Prop. 3.1 to make the support fraction α arbitrarily small), so B^{K-1} ≈ K^{(M-1)K}; no fixed constant C_pc can dominate this against ρ = K^{-3K} for all K in the range (29). Thus the displacement bound (28), the contraction-mapping step, and the exact moment equality (27) are not proved as written. Proposition 3.1 is the only source of the twin spectra that separate fidelity while keeping n-copy states indistinguishable, so this gap is load-bearing. The gap looks repairable — e.g. strengthen (26) to r ≥ η^{-1} B^K K (C_pcK)^{C M K}, or use the slack in (29) explicitly — but it must be fixed and checked.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper resolves, up to logarithmic factors, the sample complexity of estimating the root Uhlmann fidelity F(ρ,σ) to a known rank-r reference σ. The main result is S(r,ε)=Θ~(r^2/ε^2), obtained by matching Wang's O(r^2/ε^2) upper bound with a new Ω(r^2/(ε^2 (log r)^C)) lower bound. The lower bound is proved by a two-prior construction: exact spectral moment twins (Proposition 3.1), a size-biased doubly correlated Wishart model that yields an explicit Schur-law for the prior-averaged state, and a Cauchy-identity argument reducing indistinguishability to a long-cycle estimate in a weighted random permutation model. A direct-sum embedding and binomial thinning transfer the base indistinguishability to a fixed rank-r noncommuting reference with the optimal 1/ε^2 dependence. The same priors give near-quadratic lower bounds for spectrum estimation and rank testing. The proof is detailed, with appendices fixing Wishart and Schur-Weyl conventions and normalization checks.","tokens_in":17209,"tokens_out":20737,"duration_ms":221303,"significance":"If correct, this is a substantial result: it closes the factor-r gap left by Wang and establishes a near-quadratic barrier for constant-accuracy spectrum estimation, a question highlighted in very recent work. The technical machinery — radial size-biased Schur measures, exact moment matching, and long-cycle cancellation — is novel and likely to be useful for other nonpolynomial spectral functionals. The paper is unusually careful about conventions and normalization, and the main indistinguishability chain from moment twins to trace-distance bounds is coherent and checkable. The central weakness is a specific, load-bearing algebraic gap in the packet-correction lemma (Lemma 3.4), discussed below; it appears repairable without changing the structure or conclusions of the paper.","major_comments":[{"comment":"The stated condition (26), r ≥ η^{-1} B K (C_pc K)^{5K}, does not imply the Newton-ball bound (39). Substituting (26) into (36) gives L0 ≤ η^{-1}(C K)^K K B^K / [η^{-1} B K (C_pc K)^{5K}] = (C K)^K B^{K-1}/(C_pc K)^{5K}. For this to be ≤ ρ/2 = (C_1 K)^{-3K}/2 one needs B^{K-1} ≤ (C_pc^5/(2 C C_1^3))^K K^K, i.e. B = O(K). But in Proposition 3.1 the measures from Lemma 3.3 have support [0,2(K+1)^{M*}] with M* a fixed but arbitrarily large universal integer (chosen to make the support fraction α arbitrarily small), so B ~ K^{M*}. No universal constant C_pc can absorb B^{K-1} against K^{-3K}. The sentence claiming (39) follows from r ≥ η^{-1} B K (C K)^{4K+1} is also algebraically incorrect: it leaves B^{K-1}/(C^{3K+1} K^{3K+1}), again requiring B=O(K). This gap is load-bearing because Lemma 3.4 is the only source of the exact moment twins used in Proposition 3.1. The gap is repairable — for","section":"Lemma 3.4"},{"comment":"The 'In particular' statement says that when B ≤ C_B(K+2)^M, the size condition (26) holds for K ≤ c_{M,η,C_B} log r / log log r. With the corrected condition involving B^K, the logarithm of the right-hand side is O_{M,C_B}(K log K) and the same conclusion holds, but the constant c_{M,η,C_B} will depend on M. The proof should state this explicitly, because Proposition 3.1 later allows M* to depend on the target support fraction α*, and the constants in (10) must be chosen accordingly.","section":"Lemma 3.4"}],"minor_comments":[{"comment":"The displayed matrix for ω_{G,q} is slightly ambiguous: the off-diagonal blocks G/(√r√S) and G^*/ (√r√S) should specify that they act from T to B and B to T, respectively, and the convention for the conjugate transpose relative to the vectorization convention used earlier. This is a notation issue, not a mathematical one.","section":"Eq. (87)"},{"comment":"The notation Tr(ρ) for the normalized square-root trace is easy to confuse with the ordinary trace tr(ρ). Consider using a distinct symbol, such as T(ρ) throughout, including in Corollary 1.2, to avoid ambiguity.","section":"Section 1.2"},{"comment":"In the sentence 'Every non-control atom receives a number of points differing from its target r µ_b-mass by at most K+2', the target should read r(1−η)ν̄_b-mass, since the control packets are handled separately. This is a wording clarity issue.","section":"Lemma 3.4"},{"comment":"Reference [10] is cited for Wishart moments and the symmetric group; the precise theorem used (the complex Wishart moment identity) could be pinned down to a numbered result to help the reader verify the convention-dependence of Eq. (45).","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The paper presents a strong and novel lower-bound technique, and most of the proof appears sound and carefully verified. However, the packet-correction lemma contains a load-bearing algebraic error: the stated size condition does not imply the Newton-ball bound when B grows as a power of K, which is exactly the regime used in Proposition 3.1. The error is localized and repairable, and I do not see a reason to reject. I would require the authors to fix Lemma 3.4's condition (26) and the derivation of (39), and to re-check the dependence on M* in Proposition 3.1, before acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know. First, if the lower bound stands, this is the result that closes Wang's factor-r gap and gives a near-quadratic spectrum-estimation lower bound; the construction is genuinely new. Second, as written, the proof has a load-bearing gap in Lemma 3.4. The stress-test note is right: substituting condition (26) into (36) leaves B^{K-1} in the numerator, and since B can be as large as (K+2)^M with M >= 6, no choice of the universal constant C_pc makes L0 <= rho/2 for K in the claimed range. The proof even says (39) follows from a weaker condition, but that weaker condition also fails for B of this size. This matters because Lemma 3.4 is the only source of the exact moment twins in Prop. 3.1; without it the hard family collapses.\n\nWhere the paper earns credit: the size-biased Schur measure reduction is a nice idea, the Wishart-Schur identity is worked out carefully, and the binomial-thinning embedding is clean. The authors are honest about the AI drafting and don't oversell the logarithmic factors. The structure is solid and the gap is likely repairable — strengthening (26) to something like r >= eta^{-1} B^K K (C_pc K)^{C M K} would make the contraction go through, at the cost of shrinking the constant in (10) but not breaking the overall theorem.\n\nSmaller notes: the notation around Eq. (87) is a bit ambiguous, and the paper would benefit from a sign check on the permutation convention in the appendix. These are minor.\n\nBottom line: the result is significant and the proof is mostly coherent, but I would not accept the current version as-is. This paper deserves a serious referee, and the referee should be asked to verify Lemma 3.4. If the repair is as straightforward as it looks, the theorem should hold.","headline":"Worth refereeing, but the main lower bound rests on a packet-correction lemma whose stated condition does not imply the claimed contraction bound; the gap looks repairable.","tokens_in":17754,"tokens_out":5593,"would_cite":true,"duration_ms":54234,"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":"Estimating root Uhlmann fidelity to a known rank-r reference requires r²/ε² copies, up to log factors.","keywords":["sample complexity","Uhlmann fidelity","rank-r reference","quantum spectrum estimation","two-prior method","Schur–Weyl duality","moment matching","Wishart ensemble"],"falsifier":"Numerically search for K at the claimed scale, say K = floor(log r / log log r) for r around 10⁴–10⁶, and look for two probability vectors satisfying the exact moment equalities (11)–(12) with the support promises (14)–(15). If the packet-correction Newton iteration cannot converge within the required displacement bound for some r in this range, Proposition 3.1 fails and the lower bound has a gap. Alternatively, an explicit estimator using o(r²/ε²) copies for the fixed maximally mixed reference would directly falsify Theorem 1.1.","tokens_in":16726,"feed_emoji":"🎯","tokens_out":6554,"duration_ms":74108,"temperature":0.7,"pith_summary":"The paper settles, up to logarithmic factors, how many copies of an unknown quantum state are needed to estimate its fidelity to a known rank-r reference state. The answer is r²/ε²: the paper proves a matching lower bound that closes the factor-r gap left by the known upper bound. The argument builds two ensembles of states that have exactly the same low-order spectral moments yet provably different fidelity, so any estimator using fewer copies cannot tell them apart. The same construction yields a near-quadratic lower bound for constant-accuracy quantum spectrum estimation, matching a recent upper bound. If the proof is correct, the rank of the reference—not the ambient dimension—is the controlling resource for fidelity estimation, up to logarithms.","feed_headline":"Fidelity to a known rank-r state needs ~r²/ε² copies","feed_subtitle":"A matching lower bound closes the factor-r gap and sets the polynomial sample-complexity order.","key_machinery":"The central mechanism is a size-biased Schur measure: the prior dΠ_b(G) ∝ ||G||_F^{2m} dQ_b(G) cancels the tensor-power normalization, leaving the m-copy average state as a direct sum over Schur labels with block weights s_λ(a^{(b)})². The fixed-degree Cauchy identity, exp(Σ_k z^k/k p_k(x)p_k(y)), converts equality of the first K power sums into equality of all short-cycle weights in a weighted permutation model; a long-cycle estimate bounds trace distance by the probability of a cycle longer than K. This makes two spectra with matching moments indistinguishable while their fidelity differs.","core_discovery":"Root Uhlmann fidelity F(ρ,σ)=tr√(√σρ√σ) to a known rank-r reference has sample complexity Θ~(r²/ε²) under collective measurements. The lower bound holds for a fixed reference σ=P_T/r on a 2r-dimensional system, and every hard state with nonzero matrix parameter does not commute with σ, so the hardness is not a commuting-eigenbasis artifact. The proof uses the two-prior method: two priors with fidelity values separated by a constant but whose m-copy average states are o(1) apart in trace distance. Exact spectral moment matching builds the two spectra; a size-biased doubly correlated Wishart model gives an explicit Schur decomposition of the prior-averaged states; the Cauchy identity turns mom","pith_inferences":["The moment-twin construction is not obviously limited to fidelity: the same two priors should lower-bound estimation of any spectral functional that separates the two ensembles and is continuous in trace distance.","The binomial-thinning trick, which converts m-copy indistinguishability into n=Θ(m/q) embedded copies, suggests a general reduction for transplanting hardness to fixed-reference settings at a cost of 1/ε².","If the logarithmic slack can be removed, the bottleneck is likely the packet-correction lemma: a tighter exact moment-matching construction or a sharper long-cycle estimate would settle the remaining factor.","A numerical test of Proposition 3.1 for moderate r and K—checking whether the Newton iteration converges within the displacement bound—would indicate how concrete the hard family is."],"forward_implications":["The rank r of the known reference, not the ambient dimension, determines the sample complexity of fidelity estimation up to logarithmic factors.","Any estimator using fewer than c r²/((log r)^C ε²) copies fails for the fixed maximally mixed reference on an r-dimensional subspace.","The lower bound survives the stronger assumption that the estimator receives a purification of the unknown state.","Constant-accuracy quantum spectrum estimation requires near-r² copies, matching the best known upper bound up to powers of log r.","A two-sided, constant-distance rank-testing problem also requires near-r² copies."],"supporting_citations":[{"why":"Supplies the matching O(r²/ε²) upper bound and poses the factor-r gap that this paper closes.","marker":"[1]"},{"why":"Provides the near-quadratic upper bound for constant-accuracy spectrum estimation that Corollary 1.3 matches.","marker":"[5]"},{"why":"Supplies the Frobenius and Cauchy identities used to express Schur moments and convert moment matching into cycle cancellation.","marker":"[9]"},{"why":"Supplies the complex Wishart moment identity that yields the s_λ(a)s_λ(b) factors in the size-biased Schur law.","marker":"[10]"},{"why":"Supplies the Gaussian concentration inequality used to prove the Ginibre nuclear-norm lower bound.","marker":"[11]"},{"why":"Supplies the quantum distinguishability bound behind the two-prior principle.","marker":"[12]"}],"fun_headline_variants":["Fidelity to known rank-r state: sample complexity is ~r²/ε²","Tight bound: estimating fidelity to rank-r reference needs ~r²/ε² samples","Sample complexity of fidelity to a known rank-r state settled at ~r²/ε²","Fidelity estimation to a rank-r reference: Θ~(r²/ε²) samples suffice and are necessary","Matching bound: fidelity to rank-r state requires Θ~(r²/ε²) copies"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"Proposition 3.1 must hold: for every large r and K ≈ log r / log log r, there must exist two length-r probability vectors with exactly equal power sums through degree K, one supported on at most αr entries and the other with a constant fraction of entries in a band around 1/r; the entire two-prior hard family depends on this exact moment-matching construction.","fun_headline_variants_meta":{"raw":{"variants":["Fidelity to known rank-r state: sample complexity is ~r²/ε²","Tight bound: estimating fidelity to rank-r reference needs ~r²/ε² samples","Sample complexity of fidelity to a known rank-r state settled at ~r²/ε²","Fidelity estimation to a rank-r reference: Θ~(r²/ε²) samples suffice and are necessary","Matching bound: fidelity to rank-r state requires Θ~(r²/ε²) copies"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000744,"raw_usage":{"total_tokens":3217,"prompt_tokens":868,"completion_tokens":2349,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":612,"completion_tokens_details":{"reasoning_tokens":2229}},"tokens_in":612,"tokens_out":2349,"duration_ms":18040,"temperature":1.0,"reasoning_tokens":2229,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-04T21:19:08.414473+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Numerically search for K at the claimed scale, say K = floor(log r / log log r) for r around 10⁴–10⁶, and look for two probability vectors satisfying the exact moment equalities (11)–(12) with the support promises (14)–(15). If the packet-correction Newton iteration cannot converge within the required displacement bound for some r in this range, Proposition 3.1 fails and the lower bound has a gap. Alternatively, an explicit estimator using o(r²/ε²) copies for the fixed maximally mixed reference would directly falsify Theorem 1.1.","supporting_citations":[{"cited_title":"Estimating Fidelity to a Reference Quantum State","cited_arxiv_id":"2606.26034","evidence_quote":"Supplies the matching O(r²/ε²) upper bound and poses the factor-r gap that this paper closes."},{"cited_title":"The Keyl-Werner algorithm is not optimal for spectrum estimation","cited_arxiv_id":"2607.27117","evidence_quote":"Provides the near-quadratic upper bound for constant-accuracy spectrum estimation that Corollary 1.3 matches."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Frobenius and Cauchy identities used to express Schur moments and convert moment matching into cycle cancellation."},{"cited_title":"Ledoux,The Concentration of Measure Phenomenon, American Mathematical Society, 2001","cited_arxiv_id":null,"evidence_quote":"Supplies the Gaussian concentration inequality used to prove the Ginibre nuclear-norm lower bound."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the quantum distinguishability bound behind the two-prior principle."}],"review_version":1}