{"id":"eba41b34-a13e-4e2f-a342-ea2efec0992d","arxiv_id":"1908.10347","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The weight of informativeness of a measurement exactly quantifies the optimal advantage in quantum state exclusion games and equals the single-shot excludible information of the associated quantum-to-classical channel.","lead":"This paper shows that a measure of how informative a quantum measurement is, called the weight of informativeness, exactly matches the best advantage that measurement gives in a game where players guess which state was not sent. It also connects this measure to a new information quantity and to whether one measurement can simulate another.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the central equalities are sound; flagged gaps in Appendices C and D are fixable presentation issues, not correctness threats.","rationale":"The reader identified the same technical weak points I considered: the unstated decoding reduction in Appendix C and the outcome-count handling in Appendix D. I agree these are the least-secure steps, and the reader is right that they are minor. On closer inspection, both are fixable without altering the results. The decoding reduction is guaranteed by the classical nature of the channel output, and the outcome-count gap disappears when one restricts to ensembles with k equal to the number of outcomes of M', which the universal quantification over E permits. Result 1's proof is rigorous: the lower bound uses the decomposition property of WoI, and the achievability uses the dual SDP to construct a valid ensemble; the final step of using M itself as a strategy is legitimate because M simulates itself. Result 2 then follows from Result 1 via a standard identity, and Result 3's sufficiency proof is valid after the minor k-fix. The paper's central claims—WoI as the exact state-exclusion advantage, the excludible-information formula, and the complete monotones—are therefore correctly established. The conjecture is explicitly labeled as conjectural, so it does not affect the verdict. I see no reason to change the reader's ACCEPT.","tokens_in":13855,"tokens_out":19800,"duration_ms":189113,"concrete_test":"Verify Eq. (8) by writing a general decoding POVM as D_g = sum_a p(g|a) |a><a| and re-deriving I_exc(Λ_M) without the shortcut D_g=|g><g|; if the resulting expression differs from -log(1 - WoI(M)) for any c-q channel, the excludible-information claim would need qualification.","verdict_should_be":"UNCHANGED","load_bearing_attack":"After reviewing the proofs of Results 1–3, I find no load-bearing flaw. The unstated decoding reduction in Appendix C is valid for c-q channels because any decoding POVM D_g on the classical output space only enters through its diagonal entries <a|D_g|a> = p(g|a), which form a conditional probability distribution. Thus the optimal decoding is equivalent to the computational-basis measurement followed by classical post-processing, and the subsequent minimization over p(x|g) is exactly the optimization over simulations of M. The outcome-count issue in Appendix D is resolved by fixing the ensemble size k to the number of outcomes of M' (padding with zero operators if l'<k, or coarse-graining if l'>k); since the condition is required for all E, it holds in particular for k=l'. The proof's minimax step is then valid because the strategy spaces are convex and compact for a fixed k and fixed Hilbert-space dimension. Result 1 is supported by SDP strong duality, and Result 2 follows from Result 1 via the identity min_x f(x) = min_p sum_x p(x) f(x). No circularity or unsupported physical assumption appears in the central chain.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces the weight of informativeness (WoI) as a resource quantifier for the convex quantum resource theory of measurement informativeness, proves its basic properties, and establishes two main operational results. First, for any measurement M, the optimal advantage over classical strategies in state exclusion games, quantified by the ratio of quantum to classical error probabilities minimized over all ensembles, equals 1 - WoI(M). Second, the single-shot excludible information of the quantum-to-classical channel associated with M is -log[1 - WoI(M)], extending the known robustness-based three-way correspondence to weight-based quantifiers and exclusion tasks. The paper also proves that error probabilities in state exclusion games form a complete set of monotones for measurement simulation, giving a necessary and sufficient condition for M to simulate N in terms of these probabilities. The central proofs are analytic, using an explicit dual SDP for the WoI, strong duality, and a minimax argument.","tokens_in":14049,"tokens_out":5838,"duration_ms":57426,"significance":"If the results hold, the paper makes a significant conceptual contribution to quantum resource theories: it provides the first operational interpretation of a weight-based quantifier, establishes a parallel three-way correspondence between resource quantifiers, operational tasks, and single-shot information-theoretic quantities, and identifies a second complete set of monotones for measurement simulation. The proofs are mathematically sound and self-contained: the dual SDP in Appendix B is explicit, the reduction in Appendix C is valid for quantum-to-classical channels, and the monotonicity proof in Appendix D uses a correct minimax step. There is no circularity: the state exclusion game and excludible information are defined independently of WoI, and the equalities are proven rather than assumed. The conjecture that the weight-exclusion correspondence holds for arbitrary resource theories is clearly stated and appropriately supported by a forthcoming companion result.","major_comments":[],"minor_comments":[{"comment":"The monotonicity statement in the main text reads \"N≼ M→ WoI(N)≤ WoI(N)\", which is a typo: the second WoI should be evaluated on M. Appendix A states the correct inequality WoI(M') ≤ WoI(M). Please correct the main-text statement.","section":"Section II, Lemma (iii)"},{"comment":"The proof silently restricts the decoding POVM to the computational basis by setting D_g = |g><g|, then optimizes over classical post-processings p(x|g). This reduction is valid for a quantum-to-classical channel because any decoding POVM D_g enters only through its diagonal entries <a|D_g|a>, which form a conditional probability distribution, but this justification is not stated. Since Eq. (C6) and hence Eq. (8) rely on this reduction, please add a brief explanation. Also, the Kronecker delta immediately after \"Choosing D_g = |g><g|\" should read δ_{a,g}, not δ_a^x.","section":"Appendix C, proof of Result 2"},{"comment":"In the sufficiency proof, the argument treats M' as a k-outcome measurement in Eq. (D3), but M' has l' outcomes. The assumption (9) holds for all ensembles, so one can take k = l' (or pad/coarse-grain accordingly) to make the comparison well-defined. The text should state this explicitly so that the subsequent minimax step is unambiguous.","section":"Appendix D, sufficiency proof"}],"recommendation":"minor_revision","confidential_remarks":"The manuscript is technically sound and the flagged issues are local clarifications rather than correctness threats. I recommend minor revision; the authors should fix the typo in the Lemma, add the missing justification for the decoding reduction in Appendix C, and clarify the outcome-count matching in Appendix D."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nYou should know that this is the dual result to Skrzypczyk-Linden: instead of robustness and discrimination, it is weight and exclusion. The main result, Eq. (5), says the optimal state-exclusion advantage of a measurement over classical strategies is exactly 1−WoI(M). That is a real theorem, proven with SDP duality, and it gives weight-based quantifiers the operational meaning they were missing. The paper also introduces excludible information and shows it equals −log(1−WoI) for the c-q channel, making a genuine three-way correspondence.\n\nWhat is good: the proofs are self-contained and largely rigorous. I checked the lower bound via the weight decomposition and the upper bound via the dual SDP; both go through. The complete-set-of-monotones result (Result 3) is a nice bonus, and the minimax step is legitimate once you fix the outcome-count issue. No fitted parameters, no circularity. The parallel to [23] is appropriately acknowledged; this is not a re-derivation.\n\nThe soft spots are all minor. The monotonicity lemma has a typo (WoI(N) ≤ WoI(N)). Appendix C assumes, without stating it, that for c-q channels the optimal decoding is the computational basis followed by classical post-processing; the stress-test note is right that this is valid because only diagonal entries matter, but it should be written as a lemma. Appendix D does not explain how outcome counts are matched when simulating M′; fixable by padding or coarse-graining, as you noted. None of these affect the main claims.\n\nThe generic conjecture in Section VII is clearly labeled as future work; it does not detract from what is proven. This is not a branch-reshaping paper, but it is exactly the kind of clean, useful result that belongs in the literature.\n\nI would send it to a serious referee. With a careful revision touching the appendices, it should be accepted.\n\nBest,\n[You]","headline":"This paper proves the weight-exclusion dual of the robustness-discrimination result and is sound enough to referee.","tokens_in":14569,"tokens_out":1613,"would_cite":true,"duration_ms":17275,"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":"The weight of informativeness of a measurement equals its optimal advantage in state exclusion games.","keywords":["weight of informativeness","state exclusion games","excludible information","measurement simulability","quantum resource theory","single-shot information","POVM","convex optimisation"],"falsifier":"Take a POVM $M$, compute $\\mathrm{WoI}(M)=1-\\sum_a \\lambda_{\\min}(M_a)$, and obtain the optimal ensemble from the dual SDP in Appendix B; if the ratio $P^{\\mathrm{Q}}_{\\mathrm{err}}(\\mathcal{E}^*,M)/P^{\\mathrm{C}}_{\\mathrm{err}}(\\mathcal{E}^*)$ is not exactly $1-\\mathrm{WoI}(M)$, Result 1 is false. Similarly, one can compute the excludible information of $\\Lambda_M$ directly from the minimisation in Appendix C and compare it with $-\\log[1-\\mathrm{WoI}(M)]$.","tokens_in":13649,"feed_emoji":"🎯","tokens_out":7127,"duration_ms":73198,"temperature":0.7,"pith_summary":"This paper gives an operational meaning to a geometric resource quantifier called the weight of informativeness of a quantum measurement: the minimal weight with which a general measurement must be mixed with an uninformative one to reproduce it. It proves that this number exactly equals the best possible advantage the measurement can provide over purely classical guessing in a state exclusion game, where the player must name a state that was not sent. The paper also introduces a single-shot information quantity, excludible information, and shows that for the quantum-to-classical channel associated to a measurement it is determined by the same weight. This creates a three-way correspondence between a resource quantifier, a game, and an information-theoretic quantity, and it shows that exclusion games form a complete set of monotones for measurement simulation.","feed_headline":"Informativeness weight sets the state-exclusion advantage","feed_subtitle":"The paper proves a three-way equivalence between a geometric quantifier, a quantum game, and a single-shot information quantity.","key_machinery":"The central object is the weight of informativeness, $\\mathrm{WoI}(M)=\\min\\{w : M_a = wN_a + (1-w)q(a)\\mathbb{1}\\}$ with $N$ a POVM and $q$ a probability distribution, which has the closed form $\\mathrm{WoI}(M)=1-\\sum_a \\lambda_{\\min}(M_a)$. Its dual semidefinite programme yields the extremal ensemble that saturates the bound in Result 1. The second engine is the quantum-to-classical channel $\\Lambda_M$ and the conditional exclusion entropy $H_{-\\infty}(X|G)$, which is manipulated into $-\\log P^{\\mathrm{Q}}_{\\mathrm{err}}(\\mathcal{E}, M)$ by optimising over classical post-processings. The simulability order $N_x=\\sum_a p(x|a)M_a$ connects the game's minimisation to the resource order, and minimax reasoning is used to prove the completeness result.","core_discovery":"Result 1 is the exact identity $\\min_{\\mathcal{E}} P^{\\mathrm{Q}}_{\\mathrm{err}}(\\mathcal{E}, M)/P^{\\mathrm{C}}_{\\mathrm{err}}(\\mathcal{E}) = 1 - \\mathrm{WoI}(M)$, where the left side is the smallest ratio, over all ensembles, between the best exclusion-error probability achievable using the measurement $M$ and the best classical error probability, and the right side is a number computed from $M$ alone. Result 2 adds that the single-shot excludible information of the quantum-to-classical channel $\\Lambda_M(\\rho)=\\sum_a |a\\rangle\\langle a| \\operatorname{Tr}(M_a\\rho)$ equals $-\\log[1-\\mathrm{WoI}(M)]$. Result 3 states that $M$ can simulate $N$ if and only if $P^{\\mathrm{Q}}_{\\mathrm{err}}(\\mathcal{E}, M) \\le P^{\\mathrm{Q}}_{\\mathrm{err}}(\\mathcal{E}, N)$ for every ensemble $\\mathcal{E}$. The paper's claim is that these form one coherent correspondence: a weight-based resource measure, an exclusion task, and a single-shot information quantity are the same object from three viewpoints.","pith_inferences":["The authors conjecture that the weight-exclusion correspondence is generic across quantum resource theories; if that holds, weight-based quantifiers in other resource theories would acquire operational interpretations as optimal advantages in exclusion tasks rather than remaining purely geometric measures.","Because $\\mathrm{WoI}$ has a closed form, Result 1 turns an optimisation over all ensembles into an eigenvalue computation, which could make exclusion advantages easy to estimate for large or noisy POVMs.","The if-and-only-if in Result 3 implies that any failure of simulation is witnessed by some exclusion game, but the proof does not identify a finite set of games that would certify simulation; finding such a finite witnessing set would turn the criterion into a practical test."],"forward_implications":["For any measurement and any state exclusion game, the measurement can reduce the classical error probability by at most a factor $1-\\mathrm{WoI}(M)$, and there is a game where this bound is attained.","The single-shot excludible information of the channel induced by a measurement is exactly $-\\log[1-\\mathrm{WoI}(M)]$, so a purely geometric quantifier computes a communication-theoretic quantity for exclusion tasks.","A measurement $M$ can simulate a measurement $N$ exactly when $M$ is never worse than $N$ in any state exclusion game, giving a second complete set of monotones for measurement simulation.","The weight of informativeness can be evaluated efficiently: it is the solution of an SDP and has the explicit eigenvalue formula $1-\\sum_a \\lambda_{\\min}(M_a)$."],"supporting_citations":[{"why":"Supplies the parallel three-way correspondence between robustness of informativeness, state discrimination, and single-shot accessible information that this paper mirrors.","marker":"[23]"},{"why":"Formalises the state exclusion game that the paper uses as its operational task.","marker":"[43]"},{"why":"Defines measurement simulability via post-processing, the partial order underlying Results 1 and 3.","marker":"[44]"},{"why":"Provides the convex-optimisation duality used to derive the dual SDP and the optimal ensemble in the proof of Result 1.","marker":"[45]"},{"why":"Introduced the weight quantifier that the weight of informativeness generalises to measurements.","marker":"[32]"},{"why":"Introduced the same weight idea in entanglement theory, giving the quantifier its name and context.","marker":"[33]"}],"fun_headline_variants":["Informativeness weight defines state-exclusion advantage","Excludible info set by weight of informativeness","Weight of informativeness controls state-exclusion error","Informativeness weight ties exclusion to excludible info"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof assumes that the best a player can do with a fixed measurement in an exclusion game is to classically process its outcomes, and that the relevant optimisation problems can be swapped in the standard convex way; if some strategy outside this description performed better, the exact equality with the weight of informativeness would fail.","fun_headline_variants_meta":{"raw":{"variants":["Informativeness weight defines state-exclusion advantage","Excludible info set by weight of informativeness","Weight of informativeness controls state-exclusion error","Informativeness weight ties exclusion to excludible info"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001399,"raw_usage":{"total_tokens":5650,"prompt_tokens":930,"completion_tokens":4720,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":546,"completion_tokens_details":{"reasoning_tokens":4658}},"tokens_in":546,"tokens_out":4720,"duration_ms":38960,"temperature":1.0,"reasoning_tokens":4658,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T10:47:18.739162+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a POVM $M$, compute $\\mathrm{WoI}(M)=1-\\sum_a \\lambda_{\\min}(M_a)$, and obtain the optimal ensemble from the dual SDP in Appendix B; if the ratio $P^{\\mathrm{Q}}_{\\mathrm{err}}(\\mathcal{E}^*,M)/P^{\\mathrm{C}}_{\\mathrm{err}}(\\mathcal{E}^*)$ is not exactly $1-\\mathrm{WoI}(M)$, Result 1 is false. Similarly, one can compute the excludible information of $\\Lambda_M$ directly from the minimisation in Appendix C and compare it with $-\\log[1-\\mathrm{WoI}(M)]$.","supporting_citations":[{"cited_title":"Bandyopadhyay, R","cited_arxiv_id":null,"evidence_quote":"Formalises the state exclusion game that the paper uses as its operational task."},{"cited_title":"Guerini, J","cited_arxiv_id":null,"evidence_quote":"Defines measurement simulability via post-processing, the partial order underlying Results 1 and 3."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduced the weight quantifier that the weight of informativeness generalises to measurements."},{"cited_title":"This quantifier has several different names such as: part, content, cost and weight","cited_arxiv_id":null,"evidence_quote":"Introduced the same weight idea in entanglement theory, giving the quantifier its name and context."}],"review_version":1}