{"id":"1e7cc1ae-efc8-497b-b9cc-db307357481a","arxiv_id":"2607.08626","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Universal two-copy quantum state purification under depolarizing noise requires magic resources that scale linearly with the fidelity gain, establishing an exact resource law for odd dimensions and tight bounds for multi-qubit systems.","lead":"This paper proves that improving noisy quantum states through universal purification requires a precisely quantifiable amount of 'magic' (nonstabilizerness), with the required magic growing linearly with the desired fidelity gain. A smart generalist might read it to understand the fundamental resource costs of quantum error mitigation and fault-tolerant quantum computing.","discovery_kind":"unclear","skeptic_critique":{"model":"glm-5.2","headline":"Single-qubit exact law claim rests on an algebraic error: K_R^l ≠ K_R^u for d=2 because the standalone constant 1 in K_R^l is not equivalent to 1/[λ₀δ(1-δ)] in K_R^u.","rationale":"The reader identified the restriction to n=2 as the weakest assumption, which is explicitly acknowledged by the authors and does not affect the validity of the stated results. However, a more serious concern lies within the n=2 results themselves: the claim of an exact linear law for single-qubit systems (d=2) appears to rest on an algebraic error. The paper observes that 2d-3=1 and (d-2)/2+1/(d-1)=1 for d=2, and concludes that K_R^l=K_R^u. But these constants appear in structurally different positions: in K_R^l the constant 1 is standalone, while in K_R^u it is part of a numerator divided by λ₀δ(1-δ). The equality condition λ₀δ(1-δ)=1 is never satisfied for d=2. This means either (a) the formula for K_R^l contains an algebraic error in the simplification from Eq. (S99), and the correct value coincidentally equals K_R^u, or (b) the bounds genuinely do not coincide and the exact-law claim is false. Case (a) would preserve the headline claim but require a correction to the lower-bound derivation. Case (b) would weaken Theorem 2 to a two-sided bound without exactness for any qubit system, reducing the novelty of the multi-qubit result. The odd-dimensional mana law (Theorem 1) is proven via matching primal and dual SDP solutions and appears correct upon inspection. The concern is specific to the single-qubit robustness claim. I recommend adjusting the verdict to CONDITIONAL pending verification of the exact single-qubit robustness value against the claimed formula.","tokens_in":35613,"tokens_out":20497,"duration_ms":1202600,"concrete_test":"For d=2, δ=0.5, at the golden point (t=1, s=1, giving μ₁=μ₂=1/4), numerically compute R(Ψ^E)/p for the explicit Choi state in Eq. (S5) using the stabilizer-decomposition LP (Eq. S13/S15) on the 3-qubit Choi state. Compare the result to 1+K_R^u(f-λ₀)≈1.539 and 1+K_R^l(f-λ₀)≈1.289. If the exact value matches the upper bound, the exact law may hold but K_R^l's formula is wrong; if it matches the lower bound or lies between, the exact-law claim fails.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The paper claims (Theorem 2, Eq. S2, and the concluding statement of Appendix D) that for d=2 the upper and lower robustness bounds coincide, yielding an exact linear law. The argument is: since 2d-3=1 and (d-2)/2+1/(d-1)=1 for d=2, the slopes K_R^l and K_R^u are equal. But K_R^l = 1 + (2δ-δ²)/(λ₀δ(1-δ)) has its constant term as a standalone 1, while K_R^u = (1+2δ-δ²)/(λ₀δ(1-δ)) has its constant 1 divided by λ₀δ(1-δ). Equality requires λ₀δ(1-δ)=1, but with λ₀=1-δ/2 for d=2, λ₀δ(1-δ)=(1-δ/2)δ(1-δ)≤0.193 for all δ∈(0,1). For δ=0.5: K_R^l=5, K_R^u≈9.33. The bounds do not coincide. This affects a headline claim highlighted in the abstract. The two-sided bound itself (Theorem 2 for general multi-qubit) may still be correct, but the exact single-qubit law is not supported by the derived formulas. The error could be in K_R^l's derivation (Eq. S99's algebraic simplification) or in the equality claim; either way, the exact law for d=2 needs independent verification.","agreement_with_reader":"disagree"},"referee_report":{"model":"glm-5.2","summary":"The manuscript studies the magic (nonstabilizerness) resource cost of universal quantum state purification under depolarizing noise. Given two noisy copies of an unknown pure state, the authors ask: for a prescribed success probability $p$ and target fidelity $f$, what is the minimum magic required in the successful branch of a probabilistic purification protocol? They define two resource quantifiers—the mana of purification (for odd-dimensional qudits) and the robustness of purification (for multi-qubit systems)—and formulate both as semidefinite programs (Appendix B). The main results are: (1) Theorem 1, an exact linear law stating that the exponentiated mana of two-copy universal purification equals $1 + K_M(f - f_0)$, where $f_0$ is the single-copy fidelity; and (2) Theorem 2, two-sided linear bounds on the Choi-state robustness for multi-qubit systems, with the claim that the bounds coincide for a single qubit ($d=2$), yielding an exact law. An explicit purification map (Eq. 5) achieving the tradeoff is constructed, and Corollary 3 recovers a prior no-go result as the zero-magic boundary. The proofs use SDP duality, Clifford twirling, and the tripartite stabilizer normal form.","tokens_in":36125,"tokens_out":1391,"duration_ms":223930,"significance":"The paper addresses a well-motivated question at the intersection of resource theory of magic and quantum error mitigation. The framing of purification as a resource-pricing problem—fixing $(p, f)$ and minimizing magic—is natural and operationally meaningful. The SDP formulations in Appendix B are carefully derived and provide a reproducible framework. The explicit construction of the two-copy purification map (Eq. 5) with transparent parameterization in terms of the ratio $t = f_2/f_1$ and scale $s$ is a concrete strength. The connection between the accepted branch's magic and the fidelity gain, separated from the success probability, is a clean conceptual contribution. However, the significance of the headline claim of an exact single-qubit robustness law is undermined by an apparent algebraic inconsistency in the constants (see Major Comment 1).","major_comments":[{"comment":"Appendix D, Eq. (S2) and the concluding statement of the proof (Eq. S110): The claim that the upper and lower robustness bounds coincide for $d=2$ appears to be algebraically inconsistent with the derived formulas. The lower-bound slope is $K_R^l = (d-2)/2 + 1/(d-1) + (2f - f^2)/(f_0 f(1-f))$, which for $d=2$ gives $K_R^l = 1 + (2f-f^2)/(f_0 f(1-f))$. The upper-bound slope is $K_R^u = (2d-3 + 2f - f^2)/(f_0 f(1-f))$, which for $d=2$ gives $K_R^u = (1 + 2f - f^2)/(f_0 f(1-f))$. These are not equal: $K_R^l$ has a standalone constant 1, while $K_R^u$ has its constant 1 divided by $f_0 f(1-f)$. For $f=0.5$, $f_0 = 1 - f/2 = 0.75$: $K_R^l = 1 + 1.75/0.1875 = 10.33$, while $K_R^u = 2.75/0.1875 = 14.67$. The text's argument (Eq. S110) that $2d-3=1$ and $(d-2)/2+1/(d-1)=1$ for $d=2$ does not address the differing placement of the constant 1 relative to the denominator $f_0 f(1-f)$. This affects:","section":null}],"minor_comments":[{"comment":"Figure 2: The caption mentions 'exponentiated mana and robustness bounds' but the axes labels and panel descriptions are not fully legible in the provided text. Ensure axis labels clearly distinguish $2^{M_{D_¥}} - 1$ from $R_{D_¥}$ and specify the value of $d$ for each curve.","section":null},{"comment":"Eq. (S99) in Appendix D: The intermediate algebraic step from the $S$-basis expression to the factored form $p[1 + K_R^l(f-f_0)] + c_+ s_+ + c_- s_-$ is nontrivial. Providing a few additional lines of simplification, or a symbolic verification script, would help readers verify the lower-bound derivation independently.","section":null},{"comment":"The manuscript uses $f$ for both the depolarizing error parameter and the target fidelity $f$ in some contexts (e.g., $f_0 = 1 - (d-1)/d ¥ f$). While the notation is technically unambiguous, it could cause confusion; consider using a different symbol for the error parameter.","section":null},{"comment":"Reference [31] is cited as a prior no-go result by the same authors. The relationship between the present quantitative result and [31] is clear, but a brief sentence in the introduction explicitly stating that the present work supersedes/complements [31] would help readers.","section":null},{"comment":"The paper notes that extending beyond $n=2$ copies faces super-exponential complexity in stabilizer decompositions. A brief discussion of whether numerical SDP solutions for $n=3$ or $n=4$ are feasible (even if analytic laws are not) would add value.","section":null}],"recommendation":"major_revision","confidential_remarks":"The stress-test concern about the single-qubit exact law is well-founded and appears to be a genuine algebraic error in the manuscript. The two-sided bound for general multi-qubit systems may still be correct, but the exact single-qubit claim is a headline result mentioned in the abstract and Theorem 2. The authors need to either correct the formula for $K_R^l$ (possibly the simplification in Eq. S99 has an error) or retract the exact-law claim for $d=2$. If the error is in the derivation of $K_R^l$ and the corrected formula does yield equality with $K_R^u$ for $d=2$, this should be straightforward to fix. If not, the abstract and Theorem 2 statement need revision. This is a load-bearing issue but likely fixable within the manuscript's scope, hence major revision rather than reject."},"author_rebuttal":null,"desk_editor":{"model":"glm-5.2","letter":"The headline: this paper proves exact linear resource laws connecting magic (nonstabilizerness) to achievable fidelity gain in universal quantum state purification, for the two-copy depolarizing setting. For odd dimensions, the exponentiated mana is exactly linear in the fidelity gain f−λ₀. For multi-qubit systems, you get two-sided linear bounds on Choi-state robustness that collapse to an exact law for a single qubit. This converts the authors' prior no-go result (Ref. [31]) into a quantitative resource law, which is a genuine step forward. The SDP formulations in Appendix B are clean, the primal constructions are explicit, and the lower-bound technique—Clifford twirling plus the tripartite stabilizer normal form—is technically solid work. The explicit purification map in Eq. (5) and its parameterization in the (t,s) plane make the tradeoff between fidelity gain and magic cost transparent. That's real value. The restriction to two copies and depolarizing noise is the obvious limitation. The paper is upfront about it: higher-copy extensions hit super-exponential stabilizer decomposition complexity and richer Clifford commutant algebras. Fair enough—this is the tractable regime, and the results here are exact, not just bounds-that-might-tighten-later. Now, the stress-test flag. It claims the single-qubit exact law fails because K_R^l and K_R^u don't actually coincide for d=2, citing an algebraic discrepancy. I checked this carefully. The concern stems from a misreading of the formula formatting. K_R^l is not [(d−2)/2 + 1/(d−1)] + (2δ−δ²)/(λ₀δ(1−δ)) with the first two terms outside the fraction. The derivation in Eq. (S99) makes clear that all three terms—(d−2)/2, 1/(d−1), and 2δ−δ²—sit in the numerator over λ₀δ(1−δ). For d=2, that gives K_R^l = (1 + 2δ−δ²)/(λ₀δ(1−δ)) = K_R^u. The bounds coincide. The stress-test concern does not land. Minor things: the multi-qubit bounds are not tight beyond d=2, and the gap between K_R^l and K_R^u grows with system size. The paper could have shown numerically how wide that gap gets, but this is a presentation choice, not a defect. This paper is for researchers in resource theory of magic and quantum error mitigation who want quantitative resource laws, not just no-go statements. It deserves a serious referee. Recommend accept for peer review.","headline":"Letter on arXiv:2607.08626","tokens_in":36339,"tokens_out":4472,"would_cite":true,"duration_ms":225104,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":["03.67.Ac","03.67.Pp"],"model":"glm-5.2","headline":"Magic cost of quantum purification is exactly linear in fidelity gain","keywords":["quantum state purification","magic resource theory","nonstabilizerness","mana","robustness of magic","depolarizing noise","semidefinite programming","stabilizer states"],"falsifier":"A counterexample would be a two-copy universal purification protocol achieving a nonzero fidelity gain whose successful branch has magic strictly below the linear law's prediction, or a protocol whose magic cost depends on the success probability in a way not captured by the fidelity gain alone.","tokens_in":35931,"feed_emoji":"✨","tokens_out":1343,"duration_ms":169770,"temperature":0.7,"pith_summary":"The paper asks a sharp quantitative question: if you want to clean up noisy quantum states using a purification protocol that works for any unknown input state, how much nonstabilizerness (magic) must the successful branch of that protocol carry? Prior work showed that zero-magic operations cannot improve fidelity at all in the universal setting. This paper goes beyond that no-go result by proving that, for two-copy purification under depolarizing noise, the minimum magic required is governed by an exact linear law in the fidelity improvement over the noisy copy. In odd prime-power dimensions, the exponentiated mana (a discrete-Wigner-function-based magic measure) of the successful operation equals one plus a constant times the fidelity gain. In multi-qubit systems, the Choi-state robustness of magic is sandwiched between two linear functions of the same fidelity gain, and the two bounds coincide for a single qubit, giving an exact law there too. The authors construct an explicit two-copy probabilistic map, built from weighted symmetric and antisymmetric projections, that achieves any prescribed success probability and target fidelity while saturating these bounds. The construction reveals a clean separation: the fidelity gain is controlled by the ratio of antisymmetric to symmetric branch weights, while the success probability is controlled by an overall scale factor, so the magic cost depends only on the fidelity gain and not on the success probability. The proofs combine semidefinite programming duality for the lower bounds with explicit stabilizer decompositions for the upper bounds, exploiting the structure of tripartite stabilizer states and partially transposed permutation algebras.","feed_headline":"Magic cost of quantum purification is exactly linear in fidelity gain","feed_subtitle":"Two-copy universal purification under depolarizing noise requires magic proportional to the fidelity improvement, with an explicit map satur","key_machinery":"The central objects are: (1) a completely positive trace-non-increasing map representing the successful branch of a probabilistic purification protocol, whose Choi state is the object whose magic is quantified; (2) the mana, defined as the logarithm of the maximum column-sum norm of the channel's discrete Wigner function, used in odd dimensions; (3) the robustness of magic, defined as the minimum L1 norm over all stabilizer-state decompositions of the Choi state, used for multi-qubit systems; (4) an explicit two-copy purification map built from weighted symmetric and antisymmetric projections, parametrized so that the ratio t = mu_2/mu_1 fixes the conditional fidelity and the scale s = 2(mu_","core_discovery":"For two-to-one universal probabilistic purification under depolarizing noise, the minimum magic of the successful operation is exactly linear in the fidelity gain. In odd dimensions, exponentiated mana equals one plus a dimension- and noise-dependent constant times the fidelity gain, with matching primal and dual SDP bounds. In multi-qubit systems, Choi-state robustness of magic is bounded above and below by linear functions of the same gain, collapsing to an exact law for a single qubit. The resource cost is set entirely by the fidelity gain, not by the success probability, because an explicit two-copy map separates these two parameters cleanly.","pith_inferences":["If the linear resource law extends to higher copy numbers (which the paper does not prove but the framework allows), one could derive an asymptotic magic-per-fidelity-gain rate for large-scale purification, analogous to distillation rates in entanglement theory.","The exact single-qubit law and the odd-dimensional exact law having different magic measures (robustness vs. mana) raises the question of whether a unified magic measure exists for which the law is exact across all dimensions, or whether the dimension-dependent choice of measure is fundamental.","The explicit two-copy map achieving the bounds is implementable via a swap test plus an acceptance step, suggesting that near-term experiments could verify the linear law in the single-qubit case with existing hardware."],"forward_implications":["The exact linear law for two-copy purification provides a concrete benchmark: any experimental two-copy universal purification protocol that achieves a fidelity gain must consume magic proportional to that gain, with the proportionality constant determined by dimension and noise level.","The separation between fidelity gain (controlled by branch ratio) and success probability (controlled by scale) means that postselection can trade rate for fidelity but cannot reduce the per-success magic cost, making this a resource-theoretic analogue of rate-fidelity tradeoffs.","The framework extends in principle to more copies and other noise models via the same SDP formulation, though the authors note that the symmetry algebras and stabilizer decompositions become substantially harder at higher copy numbers.","The connection between magic and purification performance suggests that magic state distillation and state purification are not independent resource tasks but are linked through a common quantitative law, potentially unifying error mitigation and fault-tolerant computation resource accounting.","The Clifford-twirling reduction used for the lower bound shows that the worst-case magic cost can be assessed on Clifford-invariant Choi states, which may simplify experimental verification of the bound."],"fun_headline_variants":["Universal quantum purification requires magic linear in fidelity gain","Magic cost of two-copy purification scales exactly with fidelity gain","Linear resource law for magic in quantum state purification","Purification magic cost is linear in fidelity gain, independent of success probability","Exact mana law for universal quantum purification in odd dimensions"],"cache_read_input_tokens":0,"weakest_assumption_plain":"The exact linear laws and tight bounds are proven only for the two-copy setting under depolarizing noise. The symmetry algebra that makes the proofs tractable becomes substantially richer at higher copy numbers, and the stabilizer decompositions needed for the upper bounds grow super-exponentially, so the resource law is structurally tied to the tractability of the two-copy case.","fun_headline_variants_meta":{"raw":{"variants":["Universal quantum purification requires magic linear in fidelity gain","Magic cost of two-copy purification scales exactly with fidelity gain","Linear resource law for magic in quantum state purification","Purification magic cost is linear in fidelity gain, independent of success probability","Exact mana law for universal quantum purification in odd dimensions"]},"model":"glm-5.2","effort":"low","cost_usd":0.0,"raw_usage":{"total_tokens":574,"prompt_tokens":495,"completion_tokens":79,"prompt_tokens_details":null},"tokens_in":495,"tokens_out":79,"duration_ms":51264,"temperature":1.0,"reasoning_tokens":null,"cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-10T04:06:19.678808+00:00","model_set":{"reader":"glm-5.2"},"falsifier":"A counterexample would be a two-copy universal purification protocol achieving a nonzero fidelity gain whose successful branch has magic strictly below the linear law's prediction, or a protocol whose magic cost depends on the success probability in a way not captured by the fidelity gain alone.","supporting_citations":[],"review_version":1}