{"id":"235632dd-be34-440a-aa78-0f138a0259a6","arxiv_id":"1908.05107","paper_version":2,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The robustness of teleportation exactly equals the advantage an entangled resource provides over classical resources in teleporting quantum correlations and in subchannel discrimination.","lead":"This paper shows exactly why every entangled quantum state is useful for teleportation, even ones that score poorly on the standard benchmark. It proves that such states give a real advantage in two concrete tasks: teleporting quantum correlations and distinguishing quantum processes.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The free-set characterization (B21) underlies the SDP for T(Λ) and the equalities (13) and (17), but the converse is only argued for the separable-state case; the displayed reconstruction uses a purification, so the separable-measurement case is unproven.","rationale":"The reader's weakest assumption is exactly this characterization, and I agree that it is the load-bearing point. The paper's main claims about equality of robustness and advantage are only as good as the free set used to define q_c and p_c. The SDP (B22)-(B26), the dual game construction (D2), and the classical guessing upper bound (E15) all rely on identifying F with separable no-signaling Choi operators. Appendix B proves the inclusion free ⇒ separable-no-signaling for both separable-state and separable-measurement protocols, but the converse is not actually shown for the separable-measurement half; the displayed reconstruction uses a purification and does not check the POVM conditions. This is a fillable gap, not a detected counterexample; I therefore recommend conditional acceptance, with the characterization completed before the equality claims are regarded as fully established. A separate, clearly invalid quantifier step appears in Appendix F for the complete-monotone corollary, which strengthens the conditional verdict but is less central to Eqs. (13) and (17). The paper otherwise has substantial support from explicit SDP-duality arguments and from the detailed treatment of the separable-state case, and no issue with external consensus is being raised.","tokens_in":21554,"tokens_out":32825,"duration_ms":354431,"concrete_test":"Complete the missing converse of (B21) for the separable-measurement case: for an arbitrary family Y_a∈SEP with ∑_a Y_a=d_V^{-1}1_V⊗τ_B, verify that the operators O_a defined in (B18) form a separable POVM, ∑_a O_a=I_{V'A}. Do this analytically, or numerically in dimension d=2 by checking whether the separable-POVM realization constraints are feasible for every extreme Y_a; if a feasible Y_a has no such POVM, (B21) is false and T(Λ) must be recomputed from a corrected free set.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Both central equalities (13) and (17) compare against the free set F, and the whole SDP treatment is built on the equivalence (B21): a teleportation instrument is free iff its Choi operators are separable and satisfy the no-signaling sum. The forward direction is fine for either a separable shared state or a separable measurement. For the converse, Appendix B.b says the two cases are 'essentially the same' and then gives a construction (B17)-(B20) that starts from a family Y_a∈SEP with the no-signaling sum and uses the purification |τ⟩ of τ_B. That purification is generally entangled, so the construction does not exhibit a separable shared state; at best it would need to exhibit a separable POVM, but the text never verifies that the operators O_a in (B18) are positive, sum to the identity, and are separable. The main text, Eq. (4), even defines F only through separable shared states, which is a different (smaller) free set. If (B21) is not proved—or is false for the intended F—then the SDP value T(Λ), the dual certificates used in Appendices D and E, and the claimed advantages all change. This is the most load-bearing unproven step for the abstract's core quantitative claims.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a resource-theoretic treatment of quantum teleportation in which a teleportation instrument Λ is free (classical) if it can be realized by a separable shared state or a separable measurement. The central quantity is the robustness of teleportation T(Λ), defined via a convex optimization. The main results are: (i) for every entangled state, a Bell measurement yields T(Λ)>0, and T(Λ) exactly equals the maximal advantage, over all classical instruments, in a game of teleporting quantum correlations (Eq. 13); (ii) T(Λ) exactly equals the maximal advantage in subchannel discrimination with side information (Eq. 17), giving operational meaning to the robustness of entanglement via Eq. (19); and (iii) the two task scores provide complete sets of monotones for quantum and classical simulation orders (Eqs. (20) and (21)). These are supported by SDP-based proofs in Appendices B–E and a simulation-completeness proof in Appendix F.","tokens_in":21841,"tokens_out":18779,"duration_ms":171897,"significance":"If the results are correct, they would resolve an open question from [21] by showing that every entangled state is useful for a suitably generalized teleportation task, and they would place the robustness of teleportation in the same family as robustness measures for entanglement, steering, and measurement incompatibility by giving it a clean operational interpretation in a discrimination task. The paper also makes a strong structural claim by showing that the two game scores are complete monotones for natural partial orders on teleportation instruments. The SDP duality arguments for Eqs. (13) and (17) are detailed and, conditional on the free-set characterization, appear sound. However, two load-bearing proof gaps, in the free-set characterization (Appendix B.b) and in the completeness-of-monotones proof (Appendix F), currently prevent the stated claims from being fully established.","major_comments":[{"comment":"The two completeness claims in Eqs. (20) and (21) are presented as equivalent characterizations of the simulation orders. Because the proof of the converse direction in Appendix F fails for the reason described above, the 'only if' direction of these equivalences is not established. The forward direction (simulation implies ordering of scores) is a simple subset argument and is fine, but the reverse direction requires a genuinely different argument, likely using convex separation or the SDP dual, rather than the pointwise contradiction attempted here. This is not a minor presentational issue; it is an essential part of the resource-theoretic contribution.","section":"Section III.B.3 and Appendix F (both claims)"}],"minor_comments":[{"comment":"The proof of convexity of T(Λ) is incorrect as written: it claims T(Λ') ≤ tr Σ_a Λ'_a[ω_x]' and equates this trace with p T(Λ1) + (1−p) T(Λ2), but the objective value in the defining optimization (6) is the scalar r, not a trace of the noise instrument. The convexity property is standard and can be proven from the SDP formulation, but the displayed argument should be corrected.","section":"Appendix C.b, Eq. (C1)"},{"comment":"The definition of the free set F in the main text only mentions separable shared states, while Appendix B.b considers a free set generated by either a separable shared state or a separable measurement. This discrepancy should be resolved explicitly; the choice of free set changes the benchmarks q_c and p_c_succ and hence the numerical values of the advantages in Eqs. (13) and (17).","section":"Main text, Eq. (4) and Appendix B.b"},{"comment":"The system labels in the construction are inconsistent: the operators Y_a are initially defined on V B, but in Eq. (B18) they are written as Y^{V A}_a and multiplied by operators acting on a purification system A. This makes it difficult to verify the claimed identities and POVM conditions, and contributed to the gap noted in the second major comment.","section":"Appendix B, Eqs. (B18)–(B20)"},{"comment":"There are several typographical errors, including 'classicaly' in Appendix F, 'Prcoessing' in reference [19], and 'Journa' in reference [50]. These do not affect the technical content but should be corrected.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The paper addresses an interesting and likely correct set of results, and the SDP machinery is well chosen. However, the two gaps identified — the incomplete proof of the free-set characterization (B21) and the quantifier error in the completeness proof in Appendix F — are both load-bearing. The first affects the core quantitative equalities (13) and (17); the second invalidates one of the three main claims as proved. Both are fixable in principle, so I am not recommending rejection, but the revision needs to either supply complete proofs or clearly scope the claims to the characterization that is actually proven. The reliance on prior work [21,22] is appropriate, but the internal proof of (B21) cannot be deferred to those references without saying so explicitly."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nHere is my take on Lipka-Bartosik & Skrzypczyk, arXiv:1908.05107. The paper has a solid core and one shaky appendix. The core—the two operational identities showing that the robustness of teleportation equals the maximal advantage in teleporting quantum correlations and in subchannel discrimination with side information—is a genuine contribution. The SDP duality proofs in Appendices D and E look careful and correct, and the reduction of ordinary average fidelity to a special correlation game is a neat conceptual step. The consequence that every entangled state is useful in two concrete tasks, including as a quantum memory for subchannel discrimination, is substantial and answers an open question from the authors' earlier work.\n\nThe central measure T(Λ) is imported from their own published paper, but that is not circular: they use the published definition and prove new equalities around it. Self-citation here is not a weakness.\n\nNow the soft spots. Appendix F, which claims complete sets of monotones for the two simulation orders, has a genuine quantifier error. Equation (F5) does not follow from (F4): the max over the simulating instrument is inside, so you cannot fix a unitary correction and treat the resulting Δa as a single operator. The same issue appears in the p_succ argument around (F11). As written, the contradiction proof does not go through. This does not affect the main identities (13) and (17), but it does invalidate the advertised completeness claims (20) and (21). The authors may be able to repair this with a standard separation argument, but as it stands the appendix is not correct.\n\nThe second issue is less fatal but needs addressing. The main text defines the free set F through separable shared states, while Appendix B.b and the subchannel-discrimination task use \"separable state or separable measurement.\" The converse direction of the key characterization (B21) is only demonstrated via a purification of the reduced state, which gives a separable measurement, not a separable state. If the intended free set is the union, the construction may be sufficient, but the text should say so explicitly and verify the POVM conditions. If F is really only separable states, then the SDP in (B22) is not justified. This is a clarity gap, not necessarily a fatal one, but a referee should not let it pass.\n\nOverall: useful paper, honestly argued in the main line, with one genuinely flawed appendix and one definitional inconsistency. The central operational result deserves engagement. I would send it to peer review with instructions to fix or soften Appendix F and to clarify the free set. If those are addressed, the paper is publishable.\n\nRecommendation: serious referee, conditional accept.","headline":"Solid core, shaky completeness appendix: the operational identities for robustness of teleportation are worth a referee's time, but the complete-monotones proof has a real quantifier gap and the free-set definition needs clarifying.","tokens_in":22330,"tokens_out":31717,"would_cite":true,"duration_ms":319902,"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":"This paper claims that a single quantity, the robustness of teleportation, exactly measures the maximum advantage a quantum teleportation scheme offers over classical schemes in two operational tasks: teleporting quantum correlations and…","keywords":["robustness of teleportation","quantum teleportation","quantum correlations","subchannel discrimination","quantum memory","entanglement","resource theory","semidefinite programming"],"falsifier":"An explicit teleportation instrument Λ with computed robustness T(Λ) for which any game of teleporting quantum correlations has ratio q(G,Λ)/q_c(G) strictly greater than 1+T(Λ), or any subchannel-discrimination instance with p_succ/p_c_succ strictly greater than 1+T(Λ), would refute the central claim.","tokens_in":21369,"feed_emoji":"⚛️","tokens_out":8680,"duration_ms":69300,"temperature":0.7,"pith_summary":"The paper aims to give operational meaning to the previously formal observation that every entangled state yields non-classical teleportation. It shows that the robustness of teleportation, T(Λ), exactly equals the maximum advantage a quantum teleportation instrument offers over every classical instrument in two tasks: teleporting quantum correlations and discriminating quantum subchannels with side information. In both tasks the advantage ratio equals 1+T(Λ). Because T(Λ)>0 whenever the shared state is entangled and a Bell measurement is used, every entangled state, including bound-entangled states that fail the standard average-fidelity test, outperforms all separable states in both tasks. The paper also shows that the average fidelity of teleportation is a special case of the first task, which explains why that benchmark cannot see the usefulness of bound entanglement.","feed_headline":"Every entangled state gains a provable edge in two teleportation tasks","feed_subtitle":"The robustness of teleportation exactly predicts the advantage over classical schemes in two operational tasks.","key_machinery":"The central object is the robustness of teleportation T(Λ), the minimal weight of noise that must be mixed into the teleportation data so that it becomes reproducible by a classical teleportation instrument built from a separable shared state or a separable measurement. The argument is carried by the Choi–Jamiołkowski representation of the teleportation instrument: in this representation the free instruments are exactly the separable operators satisfying a no-signaling sum condition, which turns the definition of T(Λ) into a semidefinite program. Its dual solution provides entanglement witnesses, and these witnesses are used to build the games that saturate the 1+T(Λ) bound in both tasks. The same representation shows that the scores of the two games are complete monotones for the classical and quantum simulation orders.","core_discovery":"The central claim is an exact identity in two parts. For any teleportation instrument Λ, the optimal advantage in a game of teleporting quantum correlations over the best classical instrument is max_G q(G,Λ)/q_c(G) = 1+T(Λ); likewise, the optimal advantage in subchannel discrimination with side information over all classical strategies is max_E p_succ(E,A)/p_c_succ(E) = 1+T(Λ). The proof constructs, from the primal and dual solutions of the semidefinite program defining T(Λ), explicit games that saturate the bound, and shows that no game can exceed it. A direct corollary is that every entangled state, when used with a Bell measurement, is a strictly better teleportation resource and a strictly better quantum memory than any separable state; in particular, bound-entangled states are useful in both tasks even though they do not beat the classical threshold for average teleportation fidelity.","pith_inferences":["Since T(Λ) can be estimated from tomographically complete teleportation data, the equality suggests a direct experimental prediction: the same number that quantifies non-classicality of the data should also appear as the measured advantage in either game, without additional fitting parameters.","The dual witnesses that certify T(Λ) can be read as explicit optimal strategies for the correlation-teleportation game, which may guide the design of protocols that actually achieve the predicted advantage.","The same robustness-and-discrimination pattern likely extends to other resource theories whose free operations satisfy a no-signaling structure, making 'maximal advantage = 1 + robustness' a candidate general principle."],"forward_implications":["Every entangled state, including bound-entangled states, becomes a strictly better resource than all separable states for teleporting quantum correlations, not just for teleporting unknown quantum states.","Every entangled state can serve as a useful quantum memory in subchannel discrimination, and optimizing the measurement as well yields the maximal advantage 1+R_E(ρ) over all classical strategies.","The average fidelity of teleportation is reinterpreted as the score of a particular game with classically correlated inputs, clarifying why it is an incomplete benchmark for entanglement usefulness.","The two task scores form complete sets of monotones: Λ can quantum-simulate Λ' if and only if q(G,Λ) ≥ q(G,Λ') for all games, and can classically simulate Λ' if and only if p_succ(E,Λ) ≥ p_succ(E,Λ') for all instruments E."],"supporting_citations":[{"why":"Defines the robustness of teleportation and proves that every entangled state with a Bell measurement produces non-classical teleportation data; this is the quantity and the non-classicality claim the paper gives operational meaning.","marker":"[21]"},{"why":"Establishes that the robustness of teleportation maximized over measurements equals the generalized robustness of entanglement, which the paper combines with its subchannel-discrimination result.","marker":"[22]"},{"why":"Derives the classical threshold for average teleportation fidelity, the benchmark whose generalization is the task of teleporting quantum correlations.","marker":"[15]"},{"why":"Introduces average fidelity of teleportation, shown in this paper to equal the score of a specific game with classical correlations.","marker":"[14]"},{"why":"Provides the proof technique of constructing subchannel-discrimination games from dual witnesses, used to show the advantage equals 1+T(Λ).","marker":"[32]"},{"why":"Supplies the convex-optimization duality and Slater condition used to derive the dual semidefinite program for the robustness of teleportation.","marker":"[60]"}],"fun_headline_variants":["Every entangled state beats classical schemes in two teleportation tasks","Bound entangled states also boost teleportation and quantum memory","Teleportation robustness exactly measures quantum advantage in two tasks","Every entangled state outperforms separable ones in two teleportation tasks","Exact quantum advantage from teleportation robustness in two tasks"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The derivation relies on identifying the free teleportation instruments with those whose Choi operators are separable and satisfy the no-signaling sum condition; if a different free set were intended, the claimed advantages would need to be recomputed, and the characterization is proved in detail only for separable shared states, with the separable-measurement case sketched as essentially the same.","fun_headline_variants_meta":{"raw":{"variants":["Every entangled state beats classical schemes in two teleportation tasks","Bound entangled states also boost teleportation and quantum memory","Teleportation robustness exactly measures quantum advantage in two tasks","Every entangled state outperforms separable ones in two teleportation tasks","Exact quantum advantage from teleportation robustness in two tasks"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000549,"raw_usage":{"total_tokens":2619,"prompt_tokens":939,"completion_tokens":1680,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":555,"completion_tokens_details":{"reasoning_tokens":1595}},"tokens_in":555,"tokens_out":1680,"duration_ms":12131,"temperature":1.0,"reasoning_tokens":1595,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:24:12.494920+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"An explicit teleportation instrument Λ with computed robustness T(Λ) for which any game of teleporting quantum correlations has ratio q(G,Λ)/q_c(G) strictly greater than 1+T(Λ), or any subchannel-discrimination instance with p_succ/p_c_succ strictly greater than 1+T(Λ), would refute the central claim.","supporting_citations":[{"cited_title":"Hasegawa, R","cited_arxiv_id":null,"evidence_quote":"Defines the robustness of teleportation and proves that every entangled state with a Bell measurement produces non-classical teleportation data; this is the quantity and the non-classicality claim the paper gives operational meaning."},{"cited_title":"Bao, X.-F","cited_arxiv_id":null,"evidence_quote":"Derives the classical threshold for average teleportation fidelity, the benchmark whose generalization is the task of teleporting quantum correlations."},{"cited_title":"Šupi ´c, P","cited_arxiv_id":null,"evidence_quote":"Provides the proof technique of constructing subchannel-discrimination games from dual witnesses, used to show the advantage equals 1+T(Λ)."},{"cited_title":"Veitch, S","cited_arxiv_id":null,"evidence_quote":"Supplies the convex-optimization duality and Slater condition used to derive the dual semidefinite program for the robustness of teleportation."}],"review_version":1}