{"id":"8cce5408-5764-49e6-8550-70742ae43d8e","arxiv_id":"2607.27339","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Fixed stabilizer measurements gain nothing from ancillas, while adaptive stabilizer measurements with a single magic state improve qubit state discrimination.","lead":"This paper works out how well you can tell two quantum states apart when your measurements are limited to stabilizer circuits. It shows that fixed circuits gain nothing from adding ancilla qubits, while adaptive circuits with a single magic state can improve the odds, and it gives formulas and a semidefinite program for the success probability.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Result 3's exact adaptive formula rests on an unverified sign-pattern achievability step; the central claim is conditional on every sign configuration being realizable by some Clifford choice.","rationale":"The reader's weakest assumption is exactly the missing sign-configuration achievability in SM H5, and this is also the most load-bearing concern I find. The central claim of the paper—the exact adaptive stabilization success probability and its operational consequences—depends on this step. The concern is not that the result is known to be false, but that the proof as written omits a crucial finite verification; hence the appropriate verdict remains CONDITIONAL, not REJECT. The paper has substantive independent support: Result 1 and Result 2 have more complete proofs, the Appendix C example demonstrates a real adaptive advantage with stabilizer ancillas, and Result 4 is explicitly identified by the authors as a lower bound in the asymmetric case, even though the statement's 'tightly' wording is misleading. I therefore do not propose changing the verdict, but the condition should explicitly require the sign-pattern table or reproducible code. The concrete test I propose is a direct computational enumeration that would settle the issue without ambiguity.","tokens_in":35626,"tokens_out":4296,"duration_ms":40446,"concrete_test":"Write a short script (or manual table) enumerating all 16 sign patterns for Δ_a, Δ_b, n_α, n_β. For each pattern, search over the six entangled basis pairs listed in Eq. (H100) and over the allowed choices of V0, V1 (equivalently, over Clifford unitaries U, V0, V1) to check whether the expression |Δ_i ± Δ_ij| + |Δ_k ± Δ_kj| equals (|Δ_a|+|Δ_b|)(|n_α|+|n_β|)/4, the RHS of Eq. (H110). The script should also verify the asserted relation sign(P_iP_j) = -sign(P_kP_j) for every commuting triple in Eq. (H100). If the script finds a counterexample, Result 3 is false as stated; if it confirms all patterns, the gap is closed and the formula is supported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central quantitative claim is Result 3: P_stab,a_suc(Δ,ω) = 1/2 + 1/4 max{||Δ||∞, ||Δ||_{2-ky}||n_ω||_{2-ky}/2}. The proof in SM H5 derives the upper bound using the triangle inequality (Eq. H110), then asserts achievability: 'one can do an exhaustive consideration of all possible sign combinations...' and concludes that the sum of absolute values can always be realized by suitable Clifford unitaries U, V0, V1. No table, code, or argument for this enumeration is provided. The same proof also states without derivation that sign(P_iP_j) = -sign(P_kP_j) for all paired entangled bases. If even one sign pattern of Δ_a, Δ_b, n_α, n_β is not realizable with the required sign structure, then Eq. (H110) is not saturated and Result 3 overestimates the adaptive success probability. Because Result 3 is used to quantify the advantage of non-stabilizer ancillas, to identify when Helstrom's bound is recovered, and to prove the fidelity bound in Result 6, this gap is load-bearing. The issue is finite and checkable, not an internal contradiction; however, without the missing achievability analysis the exact closed form is not established. A secondary inconsistency is the wording 'tightly bounded below' in Result 4, which Fig. 3 explicitly contradicts for asymmetric trajectories; this affects the presentation but is less central than the Result 3 gap.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies minimum-error quantum state discrimination when the measurement is restricted to stabilizer circuits, possibly augmented by ancillas. It reports four main results: (i) fixed stabilizer circuits with arbitrary stabilizer ancillas do not improve the success probability (Result 1); (ii) for qubits, fixed stabilizer circuits with one arbitrary qubit ancilla also give no improvement (Result 2); (iii) for qubits, adaptive stabilizer circuits with one arbitrary qubit ancilla achieve the exact success probability 1/2 + (1/4)max{||Δ||∞,||Δ||_{2-ky}||n_ω||_{2-ky}/2} (Result 3); and (iv) when non-stabilizerness is introduced directly into the POVM, the problem can be cast as an SDP and analytical lower bounds are derived (Result 4). Applications to quantum random access codes and unitary synthesis fidelity are also presented (Results 5 and 6). The proofs of Results 1–3 are in the Supplementary Material, while Result 4 rests on a no-leakage ansatz whose limitations are acknowledged in Fig. 3.","tokens_in":36069,"tokens_out":12854,"duration_ms":95260,"significance":"If the results are correct, the paper provides an operational characterization of non-stabilizerness (magic) in a fundamental information-theoretic task, showing that adaptive stabilizer circuits with a non-stabilizer ancilla strictly outperform fixed stabilizer circuits and quantifying the gap via the 2nd Ky Fan norm. The SDP formulation and the exact qubit formula are concrete tools that could be used in further resource-theoretic analyses. Strengths include explicit proofs for Results 1–3 in the SM, a reproducible SDP code, and falsifiable numerical predictions in Fig. 3. However, the exact formula of Result 3 relies on an unproduced finite case analysis, and Result 4's statement overclaims tightness; both issues need to be resolved before the paper can be accepted.","major_comments":[{"comment":"The proof of Result 3 derives an upper bound via the triangle inequality and then asserts achievability by 'an exhaustive consideration of all possible sign combinations' without supplying the enumeration. This step is load-bearing: if some sign configuration of Δ_a, Δ_b, n_α, n_β were not realizable by a valid choice of Clifford unitaries U, V0, V1, the closed form in Result 3 would overestimate the adaptive success probability. The same paragraph also uses the identity sign(P_iP_j) = -sign(P_kP_j) without derivation. The claim is plausible and can be proven by a short sign argument (choosing the common sign to make the two terms add constructively), but as written the proof is incomplete. Please provide the missing case analysis or a direct argument, and prove the sign identity.","section":"SM H5, after Eq. (H110)"},{"comment":"Result 4 states that the success probability is 'tightly bounded below' by max_A P^A_suc(µ). However, the paper's own Fig. 3 and the following paragraph show that for asymmetric trajectories (e.g., |T⟩ → |H⟩) the SDP solution strictly exceeds the analytical bound at intermediate µ, so the bound is not universally tight. The theorem as stated overclaims; it should say 'bounded below', with tightness stated only under the symmetry conditions identified in SM H6 (e.g., Δ aligned with a symmetry axis of the stabilizer octahedron). This is a statement-level inconsistency that should be corrected.","section":"Result 4 and Fig. 3"}],"minor_comments":[{"comment":"The explanatory chain leading to the SDP formulation is confusing: the 'guess' terminology suggests suboptimality, but the variables σ'_i and X_i are actual optimization variables in the final SDP. Please rewrite this passage to distinguish the definitional SDP representation of the 1-norm from the feasible variables enforcing the magic constraint.","section":"SM F1, Eq. (F8)"},{"comment":"The sentence 'Due to the symmetry of these states, Pµ_suc = max_A P^A_suc(µ). Therefore it also constitutes the solution obtained through the SDP' is ambiguous. It should clarify that for the symmetric geodesic the analytical bound equals the SDP optimum, not that the SDP is being replaced.","section":"Appendix D"},{"comment":"The abstract says 'adaptive circuits do' provide additional discrimination power with stabilizer ancillas. This is established only by the explicit two-qubit example in Appendix C, not as a general theorem; the phrasing should make this clear.","section":"Main text, abstract"},{"comment":"The phrase 'the 2nd vector KY-Fan norm' is nonstandard; it should be defined explicitly as the sum of the two largest absolute components, which it is, but consider using a more conventional notation to avoid confusion with the 2-norm.","section":"Result 3, notation"},{"comment":"The GitLab link [33] is cited but not included in the reference list with a URL. Since the SDP results and the no-leakage restricted SDP are important reproducibility artifacts, please provide the full link.","section":"Code availability"}],"recommendation":"major_revision","confidential_remarks":"The main gate is the missing achievability proof in SM H5 for Result 3. I checked the sign structure independently and believe the claim is true—condition (H110) can be saturated by choosing the common sign s = sign(Δ_aΔ_b n_α n_β)—but the manuscript must present this argument. The Result 4 'tightly bounded below' overclaim is a smaller but still important correction. Both are fixable within the manuscript's scope; no deeper conceptual error is apparent."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's the short version: this is a serious, well-organised paper that gives the first operational resource benchmark for non-stabilizerness in state discrimination, and most of it looks right. But the exact adaptive formula (Result 3) rests on an unverified achievability claim, so that central number is conditional until the authors produce the sign-pattern table or code.\n\nWhat's new and good: Results 1 and 2 (fixed stabilizer circuits gain nothing from any ancilla, including non-stabilizer qubit ancillas) are proven cleanly; the SDP formulation for measurement non-stabilizerness is genuinely useful, and the applications to QRACs and unitary-synthesis fidelity are natural and well-placed. The paper states its assumptions and distinguishes upper bounds from exact results. That's solid craftsmanship.\n\nNow the soft spot. In SM H5, after the triangle-inequality upper bound leading to Eq. H110, the proof asserts that \"one can do an exhaustive consideration of all possible sign combinations\" and concludes that the sum of absolute values is always achievable. No enumeration, table, code, or argument is given, and the same passage asserts sign(P_iP_j) = -sign(P_kP_j) for all paired entangled bases without derivation. Since Result 3 is used to describe when the Helstrom bound is recovered and to prove the fidelity bound (Result 6), this is load-bearing. The gap is finite and checkable, not an internal contradiction, but the closed form is not established until it's filled. I'd ask for the missing table or a supplementary notebook.\n\nA smaller problem: Result 4 calls the bound \"tightly bounded below,\" but Fig. 3 shows it's strict for asymmetric geodesics; the paper itself says so in the text. The wording should be \"strict lower bound\" or \"tight for symmetric cases.\" Minor, but it matters for how readers quote it.\n\nThe code statement says available on GitLab but gives no URL or commit hash; for a paper that asks us to trust a missing enumeration anyway, that's a practical issue.\n\nBottom line: this deserves a serious referee. The main idea is likely right, the methods are mostly transparent, and the gap is patchable. I'd cite it once the achievability step is made explicit. Bring it to a reading group if you want a good discussion of what counts as a proof in finite case analysis.","headline":"Solid paper, conditional central formula: Result 3's exact adaptive success probability rests on an unverified sign-pattern achievability step; otherwise the results and SDP framework are worth taking seriously.","tokens_in":36470,"tokens_out":2492,"would_cite":true,"duration_ms":24648,"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 proves that fixed stabilizer circuits cannot be helped by any ancilla, while adaptive stabilizer circuits with a single non-stabilizer qubit ancilla can improve quantum state discrimination, and derives the exact qubit success pr","keywords":["quantum state discrimination","stabilizer circuits","non-stabilizerness","magic states","adaptive measurements","Helstrom bound","semidefinite programming","quantum random access codes"],"falsifier":"For Result 3: enumerate all commuting Pauli pairs on two qubits and all single-qubit Clifford choices V0,V1, and check for random Δ and ω whether the closed-form value equals the maximum over circuits; if any state pair yields a strict gap, the exhaustive sign-pattern claim is false. For Result 4: run the SDP with and without the no-leakage constraint on a grid of asymmetric Δ and compare—the paper's Fig. 3 already shows a gap, so a closed-form measure of the leakage term would settle how far the bound is from exact.","tokens_in":35530,"feed_emoji":"⚛️","tokens_out":6915,"duration_ms":64691,"temperature":0.7,"pith_summary":"Quantum state discrimination asks how well two states can be told apart when only certain measurements are allowed. This paper restricts measurements to stabilizer circuits—Clifford unitaries plus computational-basis measurements—and asks how much discrimination power is lost, and how much a bit of 'magic' (non-stabilizerness) can restore. The central result is an operational separation: fixed stabilizer circuits gain nothing from any ancilla, whether stabilizer or not, but adaptive stabilizer circuits do. For single-qubit systems the paper gives an exact formula for the adaptive success probability in terms of the Bloch-vector difference of the two states and the Bloch vector of the ancilla, showing that an H-type magic state is always the best ancilla. Beyond that, it recasts discrimination with non-stabilizer measurements as a semidefinite program, derives a closed-form bound interpolating between the stabilizer limit and the Helstrom limit, and applies the results to quantum random access codes and unitary synthesis with a finite number of magic states.","feed_headline":"Ancillas add no power to fixed stabilizer circuits—adaptive ones do","feed_subtitle":"A single non-stabilizer qubit ancilla sharpens state discrimination when circuits can adapt, and the exact qubit formula is derived.","key_machinery":"The central object is the difference operator Δ=ρ−σ, which fully determines the discrimination problem. The paper's arguments hinge on rewriting any measurement achievable by a stabilizer circuit as a coarse-grained stabilizer basis, then using a lemma (Lemma 2) that reduces the optimal success probability to half of the sum of the absolute traces of Δ against the POVM elements. For the adaptive qubit case, the key identity is that the advantage factorizes into a product of two second vector KY-Fan norms—the sum of the two largest absolute components of the Bloch difference and of the ancilla—and the proof bounds this product by optimizing over entangled stabilizer bases. For non-stabilizer","core_discovery":"The paper's core discovery is a sharp dichotomy. For fixed stabilizer circuits, appending arbitrary ancillas—even non-stabilizer ones—never improves the minimum-error success probability; the stabilizer-only success probability P = 1/2 + (1/4)||Δ||∞ is universal. With adaptivity, a single qubit ancilla with Bloch vector n_ω can help, and for qubits the exact optimal success probability is P = 1/2 + (1/4)max{||Δ||∞, ||Δ||2−ky ||n_ω||2−ky /2}, where the 2−ky norm sums the two largest absolute components. This formula implies that the best ancilla is any H-type magic state, and that the Helstrom bound is recovered only for pairs of orthogonal stabilizer states or orthogonal H-type magic states.","pith_inferences":["The same coarse-graining technique could be applied to other restricted measurement classes, such as Gaussian measurements in continuous variables, to see whether the fixed-vs-adaptive separation is universal.","Because the paper shows Result 4 is not tight when the measurement vector leaks out of the active subspace, a promising follow-up is to compute the leakage term as a function of asymmetry; that would turn the lower bound into an exact formula for asymmetric state pairs.","The exact qubit formula suggests a concrete protocol: use one H-type magic state as a resource to rotate the measurement basis, and the success probability is simply the product of the two 'top-two' norms; this could be tested directly in a quantum processor with a single magic-state injection.","The sign-pattern enumeration in SM H5, if automated rather than asserted, would certify Result 3 numerically for all states; such a certification would be a natural benchmark for the proof's completeness."],"forward_implications":["Fixed stabilizer circuits define an intrinsic discrimination limit: no amount of ancilla preparation can push past ||Δ||∞, so any advantage must come from adaptivity or from non-stabilizer measurements.","Adaptive circuits with one H-type magic state strictly outperform fixed circuits for state pairs whose Bloch difference has two comparable large components, and the advantage is exactly quantified by the product of the two KY-Fan norms.","The exact qubit formula doubles as a benchmark for magic-state cost: a target success probability can be converted into the required non-stabilizerness of the ancilla.","The SDP formulation, though not efficient for many qubits, gives a universal method to compute optimal discrimination under bounded non-stabilizerness in any dimension.","The random-access-code result shows that optimal n→1 QRACs need non-stabilizerness on the measurement side, not just in preparation."],"fun_headline_variants":["Fixed stabilizer circuits ignore ancillas; adaptive ones exploit them","Ancillas sharpen discrimination only for adaptive stabilizer circuits","Exact qubit bound: adaptivity makes magic states matter","Stabilizer circuits: no free ancillas unless adaptive","Discrimination power gap: fixed vs adaptive stabilizer circuits"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"Two steps carry the quantitative results: Result 3 assumes without proof that every sign configuration of the Bloch components Δ_a, Δ_b, n_α, n_β is realizable by some Clifford choice (SM H5), and Result 4 assumes the no-leakage ansatz, which the paper itself shows can fail (Fig. 3); if either assumption breaks, the corresponding formula is an upper bound, not the exact or tight value.","fun_headline_variants_meta":{"raw":{"variants":["Fixed stabilizer circuits ignore ancillas; adaptive ones exploit them","Ancillas sharpen discrimination only for adaptive stabilizer circuits","Exact qubit bound: adaptivity makes magic states matter","Stabilizer circuits: no free ancillas unless adaptive","Discrimination power gap: fixed vs adaptive stabilizer circuits"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000598,"raw_usage":{"total_tokens":2643,"prompt_tokens":763,"completion_tokens":1880,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":507,"completion_tokens_details":{"reasoning_tokens":1797}},"tokens_in":507,"tokens_out":1880,"duration_ms":13215,"temperature":1.0,"reasoning_tokens":1797,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T09:09:33.541682+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For Result 3: enumerate all commuting Pauli pairs on two qubits and all single-qubit Clifford choices V0,V1, and check for random Δ and ω whether the closed-form value equals the maximum over circuits; if any state pair yields a strict gap, the exhaustive sign-pattern claim is false. For Result 4: run the SDP with and without the no-leakage constraint on a grid of asymmetric Δ and compare—the paper's Fig. 3 already shows a gap, so a closed-form measure of the leakage term would settle how far the bound is from exact.","supporting_citations":[],"review_version":1}