{"id":"39342b05-28c7-418e-ab96-0d5d2ae8f626","arxiv_id":"2507.10830","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Non-locality and entanglement-assisted communication advantage are shown to be equivalent via wire-cutting, with new facet-tailored tasks and a qutrit-over-qubit separation.","lead":"The paper proves a general equivalence between Bell inequality violations and quantum-assisted advantage in classical communication tasks, and introduces new tasks where non-local correlations beat shared randomness. It also reports a specific task where qutrit entanglement beats qubit entanglement, which the authors use to certify the shared state's local dimension.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Qutrit-over-qubit claim may be unproven: the qubit upper bound 0.93491 in §3.3 is for rank-1 projective measurements, not general two-qubit POVMs; POVMs on qubits can exceed projective bounds, so a two-qubit POVM strategy might match the qutrit value 0.93883.","rationale":"I read the central theorem (Theorem 1) and the task-family constructions as internally sound: the wire-cutting equivalence is argued coherently, and Lemma 2's proof is valid under the paper's explicitly non-standard definition of a non-local facet. The reader's weakest-assumption concern about terminology and existence of such faces is real but mostly a scope/clarity issue, not a demonstrated falsehood. The more load-bearing gap is the qutrit-over-qubit numerical highlight. The paper's abstract advertises 'qutrit over qubit entanglement advantage,' and Section 3.3 explicitly claims that assistance from two-qubit entangled states yields a lower payoff. But the quoted upper bound is for rank-1 projective measurements, and general qubit POVMs are not covered by that bound. Since the task has three Bob outputs, non-projective measurements are not a priori irrelevant, so a two-qubit POVM strategy could in principle close the gap to the qutrit value. Releasing the numerical optimization code would help only if that code actually optimizes over general POVMs; a rank-1 projective see-saw would not resolve the concern. The recommended verdict remains conditional, as the reader already set; I would keep it conditional with the additional explicit condition that the qubit upper bound be established for general two-qubit POVMs or the qutrit-over-qubit claim be qualified accordingly.","tokens_in":27810,"tokens_out":45158,"duration_ms":540885,"concrete_test":"For CS[d=2,k=3], optimize the payoff over two-qubit states and arbitrary POVMs (not just rank-1 projectors), e.g., parameterize general qubit POVMs with up to 4 outcomes and run the see-saw; alternatively, compute a dimension-2 upper bound that includes POVMs by applying the Navascués–Vértesi method to the Naimark-dilated dimension (2×4 or 4×2). If the qubit maximum stays at or below 0.93491, the qutrit-over-qubit claim survives; if it exceeds 0.93491 or reaches 0.93883, the claim must be restricted to projective qubit strategies and the local-dimension certification statement must be qualified.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's headline numerical claim is that CS[d=2,k=3] shows a two-qutrit state outperforming two-qubit states (Section 3.3, Tables 2–3). The only upper bound ruling out qubit strategies is 0.93491 from the Navascués–Vértesi method [31], which the text states is for 'two-qubit entanglement and rank 1 projectors.' That bound does not cover arbitrary two-qubit POVMs: a general POVM on a qubit may require a Naimark dilation to an ancilla, so it corresponds to a projective measurement on a local Hilbert space of dimension >2, outside the dimension-2 bound. The see-saw lower bound in Table 2 is likewise apparently over projective qubit strategies. Consequently, the statement that 'assistance from two-qubit entangled states leads to a lower payoff' (Section 3.3) is not established for all two-qubit strategies, and the further claim that CS[2,3] enables device-independent certification of local dimension is stronger than what is proven. This does not affect Theorem 1 or the task-family constructions, but it does affect an advertised central advantage.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces two techniques, wire-cutting and wire-reading, for studying correlation-assisted classical communication tasks in a prepare-and-measure scenario. Theorem 1 states that, for any correlation-assisted bounded classical communication task, a no-signalling correlation violates the associated Bell inequality if and only if it provides an advantage over shared randomness in the task, with an analogous equivalence for quantum correlations. The paper then constructs two families of tasks, CS[d,k] and CS[{P*_NL},d,k], in which correlations on the authors' 'non-local facets' achieve the algebraic maximum payoff while shared randomness is strictly suboptimal. Numerical see-saw and NPA results are reported, including the headline claim that the task CS[d=2,k=3] exhibits a qutrit-over-qubit entanglement advantage and enables device-independent certification of local dimension.","tokens_in":28072,"tokens_out":16117,"duration_ms":203249,"significance":"If the main claims hold, Theorem 1 gives a clean operational equivalence between Bell-violation and communication advantage, and wire-reading is a genuinely interesting conceptual addition that can certify non-classical assistance in scenarios where the usual payoff would not. The task families are elegant and the local bounds are derived exactly and without fitted parameters, which is a strength. The advertised dimensional-advantage example is, however, the least secure part of the paper: it rests on numerical upper bounds that currently do not cover all two-qubit strategies. The paper also uses a nonstandard notion of 'non-local facet' whose geometric status is not fully clarified. These issues are fixable within the manuscript's scope, so the appropriate decision is major revision rather than rejection.","major_comments":[{"comment":"The claimed qutrit-over-qubit advantage for CS[d=2,k=3] is not established for all two-qubit strategies. The value 0.93491 is described as an upper bound 'on the quantum payoff with two-qubit entanglement and rank 1 projectors' from the Navascués-Vértesi method [31]. A general POVM on a qubit can be Naimark-dilated to a projective measurement on a larger local Hilbert space, so a bound restricted to rank-1 projectors on two qubits does not rule out two-qubit POVM strategies exceeding 0.93491. The see-saw lower bounds in Table 2 also appear to be over projective qubit strategies. Consequently, the statements in Section 3.3 that 'assistance from two-qubit entangled states leads to a lower payoff' and that CS[2,3] enables device-independent certification of local dimension are stronger than what is proven. The authors should either extend the bound to arbitrary POVMs on two-qubit states or explicitly restrict the dimensional-advantage claim to rank-1 projective measurements.","section":"Section 3.3, Tables 2-3"},{"comment":"The paper's 'non-local facet' is not a facet in the standard polytope sense, and the proofs of Theorems 3 and 5 depend on this nonstandard notion. The definition before Lemma 2 should be stated as an explicit assumption (for example, a face of the no-signalling polytope containing no local extreme points) rather than being presented as a standard geometric object. The examples, in particular Face{P_NL^(1), P_NL^(2)} for I3322 in Section 3.2.2, should be verified to be faces or facets of the relevant no-signalling polytope under that definition. Without this, the claim that 'any non-local facet' leads to optimal payoff in the first task family is not connected to the usual geometry of no-signalling polytopes. In addition, the proof of Lemma 2 should state explicitly that the weight p in the decomposition P_NL = p P_L + (1-p) P~ is chosen as a sufficiently small positive number, bounded by the minimum positive probability among the finitely many relevant entries.","section":"Section 2.1, Lemma 2 and Appendix D"}],"minor_comments":[{"comment":"The decomposition step in the proof of Lemma 2 is stated as 'Clearly' but requires the finite-minimum argument; please spell out that p is chosen to be the minimum of the relevant positive probabilities.","section":"Appendix D"},{"comment":"The notation N(tau', n != m_{tau'} | m) is used without definition; it should be written as sum_{n != m_{tau'}} N(tau', n | m).","section":"Appendix F"},{"comment":"The infinite penalty -infinity in the payoff (25) is handled informally; please add a short argument that the optimal payoff is recovered in the limit Theta -> infinity.","section":"Proposition 1, Appendix B"},{"comment":"There is a typo in the definition of the non-local facet: 'some son-local facet' should read 'some non-local facet'.","section":"Section 2.1"},{"comment":"The relation between the task in Table 1 and the task CS[2,2] in Section 3.1 is not immediately transparent; please spell out the mapping between the four inputs and the pairs m=(m1,m2).","section":"Table 1"},{"comment":"The numerical claims in Tables 2 and 3 are not reproducible from the text; please describe the see-saw and NPA implementations (solver, convergence criteria, measurement parameterizations) or make code available.","section":"Section 3.3"}],"recommendation":"major_revision","confidential_remarks":"The core Theorem 1 and the task-family constructions are interesting and likely sound; the main risk is the overclaimed dimensional advantage, which depends on a qubit upper bound for rank-1 projectors only. The non-standard facet terminology also needs clarification. I do not see grounds for rejection, but the current version should not be accepted without fixing these points."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The part of this paper that matters is Theorem 1: the wire-cutting equivalence turning any correlation-assisted bounded classical communication task into a Bell inequality, with violation equivalent to advantage. That is a clean, general bridge, and the proof is straightforward and sound. The wire-reading idea is also genuinely new, and the families of tasks built on it go beyond the single CHSH-type example in [26]. The analytical bounds for those tasks are derived carefully, and the Appendix proofs are coherent. This is a real contribution to the prepare-and-measure and nonlocality literature.\n\nThe soft spots are real but local. The headline numerical claim, that CS[d=2,k=3] shows qutrit entanglement beating qubit entanglement, is not established as stated. The upper bound 0.93491 from the Navascués–Vértesi method is explicitly for two-qubit rank-1 projective measurements, not general two-qubit POVMs. A general POVM on a qubit can be Naimark-dilated to a projective measurement on a larger local dimension, so that bound does not rule out a two-qubit POVM strategy reaching or exceeding 0.93883. The see-saw lower bounds also appear to be over projective strategies. This does not affect Theorem 1 or the task constructions, but it does mean the advertised device-independent local-dimension certification is stronger than what is proven. The authors need to either close the POVM gap or qualify the claim.\n\nThe other issue is terminology. The paper defines a \"non-local facet\" as a face containing no local extreme point, which is not what \"facet\" means in standard polytope geometry. Lemma 2 depends on that definition. I suspect the proofs go through if the intended objects are faces spanned by non-local extremals, but the paper should reconcile this with standard terminology. It caused this reader real confusion.\n\nI would also want the numerical code and data for Tables 2 and 3 released before accepting the numerical claims. The analytical theorems are the core and they look solid; the numerics should be reproducible.\n\nWho is this for: people working on nonlocality and communication complexity, prepare-and-measure scenarios, and Bell inequalities derived from tasks. The paper deserves serious peer review. Recommendation: send it to referees, with a request to fix the POVM loophole, clarify the facet terminology, and release the numerical artifacts.","headline":"A solid wire-cutting equivalence and a genuinely new wire-reading tool, but the advertised qutrit-over-qubit advantage is not proven because the qubit upper bound only covers rank-1 projective measurements.","tokens_in":28559,"tokens_out":3457,"would_cite":true,"duration_ms":43624,"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 proves an exact equivalence between violation of a task-tailored Bell inequality and quantum advantage in the corresponding classical-communication task, and constructs communication tasks in which any non-local facet…","keywords":["Bell inequalities","non-locality","entanglement-assisted classical communication","prepare-and-measure tasks","no-signalling polytope","wire-cutting","wire-reading","qutrit advantage"],"falsifier":"Take a specific non-local facet such as the I3322 facet with the two extremal correlations given in Section 3.2.2 and enumerate all $2^3=8$ functions $L_B:[3]\\to[2]$, computing the sets $\\Phi_{x,a}^{L_B}$ for each extremal correlation; if for some $L_B$ every input $x$ has some output $a$ with $P(a,L_B(y)|x,y)>0$ for all $y$, then Lemma 2 fails and the claimed algebraic-maximum payoff for the corresponding facet-tailored task cannot hold.","tokens_in":27631,"feed_emoji":"⚛️","tokens_out":8010,"duration_ms":90136,"temperature":0.7,"pith_summary":"The paper establishes that, for any bounded classical communication task assisted by a no-signalling correlation, violating the Bell inequality tailored to that task is exactly equivalent to outperforming shared randomness in the task itself. The first direction, wire-cutting, turns the communication protocol into a Bell scenario by treating the sent message as the receiver's input to the shared correlation; this makes the payoff functional literally the same expression as the Bell functional. The second ingredient, wire-reading, treats the classical message as an observable and lets the payoff depend on it, exposing advantages of non-local correlations in minimal prepare-and-measure scenarios where shared randomness is strictly suboptimal. On that basis the paper builds two families of tasks tailored to non-local facets of the no-signalling polytope and exhibits quantum advantages, including a case where two-qutrit entanglement beats two-qubit entanglement. If correct, the results give a general recipe for converting communication advantage into Bell violation and back.","feed_headline":"Bell violation equals communication advantage, task by task","feed_subtitle":"Wire-cutting turns any bounded communication task into a Bell test whose violation exactly predicts its entanglement advantage.","key_machinery":"Three mechanisms carry the argument. (1) Wire-cutting: for a task with channel $T$ and payoff weights $w$, define the Bell functional $B_{S,T}(P)=\\sum_{m,\\tau,\\tau',n} w^m_n\\, T(\\tau'|\\tau)\\, P(\\tau,n|m,\\tau')$; because the channel couples Alice's sent message to Bob's received message, the payoff equals the Bell functional, giving the violation–advantage equivalence. (2) Wire-reading: the classical message can be read without disturbance, so the payoff may include the received message $\\tau'$ as an observable; Proposition 1 reduces such tasks to ordinary tasks with a penalty term, and this visibility is what lets non-local assistance show up when the original payoff is already saturable by shared randomness. (3) Non-local facets: a face of the no-signalling polytope containing no local extremal point; Lemma 2 asserts that on such a facet, for any function $L_B$ there is an Alice input $x$ such that $P(a,b=L_B(y)|x,y)=0$ for every output $a$ on some non-empty set of $y$'s. That zero-probability structure lets Alice encode so that Bob's output always avoids the forbidden image, giving algebraic maximum payoff.","core_discovery":"The central claim is Theorem 1: for a communication task $C_{M,N}[T,\\{w\\}]$ with local bound $s_{\\Lambda}$, a no-signalling correlation $P$ violates the associated Bell inequality $B_{S,T}(P)>s_{\\Lambda}$ if and only if using $P$ as assistance to the channel gives payoff $S(N)>s_{\\Lambda}$; the same equality holds between the maximum quantum payoff and the maximum quantum violation of the associated Bell inequality. The proof runs through the “wire-cutting” identity $S(N)=B_{S,T}(P)$, where the classical wire is cut at the channel and the received message becomes Bob's input to the shared correlation. The paper then introduces wire-reading, in which the payoff also records the received classical message; this reveals non-classical assistance in scenarios where the message-independent payoff shows no advantage. Using wire-reading, the authors define tasks $CS[d,k]$ and facet-tailored tasks $CS[\\{P^{*}_{NL}\\},d,k]$ in a receiver-without-input prepare-and-measure scenario, prove a tight shared-randomness bound for each, and show that any correlation on a non-local facet of the no-signalling polytope attains the algebraic maximum payoff. Numerically, two-qubit entangled states give payoffs above the local bound for several $(d,k)$, and for $CS[2,3]$ a two-qutrit strategy with non-projective measurements beats the optimal two-qubit strategy, with matching NPA level-2 upper bound.","pith_inferences":["Beyond the paper: the wire-reading construction suggests a general recipe—promote any classical message to an observable in the payoff—that could turn other classically saturable communication tasks into non-locality witnesses, including tasks with noisy channels or multiple rounds.","Beyond the paper: the facet-tailoring method indicates that each face of the no-signalling polytope can be probed by a dedicated communication task; enumerating all facets of small polytopes would yield a catalogue of communication tasks whose optimal payoff singles out that facet.","Beyond the paper: the qutrit-over-qubit separation suggests communication payoffs may serve as device-independent dimension witnesses; one testable extension is to check whether the $CS[2,3]$ payoff gap persists under noise and under finite measurement precision."],"forward_implications":["For every correlation-assisted bounded communication task, Bell violation and communication advantage are two readings of the same linear functional: the maximum quantum-assisted payoff equals the maximum quantum violation of the associated Bell inequality.","The NPA hierarchy and the Navascués–Vértesi method therefore become tools for bounding entanglement-assisted communication advantage, not just Bell violations.","Wire-reading makes the classical message part of the score, so tasks that look classically optimal without wire-reading can still certify non-local assistance: the four-input, one-bit example goes from no visible advantage to local bound $3/4$.","In $CS[d,k]$, any correlation on a non-local facet achieves payoff $1$, and its mixtures with white noise are advantageous whenever the noise fraction stays below $1/k^{d-1}$; for the facet-tailored tasks the corresponding threshold is $p>1/2$.","Quantum states provide explicit advantages in these tasks, and $CS[2,3]$ certifies that a two-qutrit entangled state with non-projective measurements outperforms two-qubit entanglement, so the tasks are sensitive to the local dimension of the shared state."],"supporting_citations":[{"why":"defines the earlier one-bit prepare-and-measure task and its shared-randomness analysis that CS[d=2,k=2] is modelled on.","marker":"[26]"},{"why":"supplies the adaptive entanglement-assisted communication framework and the non-commuting polynomial optimisation viewpoint used to equate maximum quantum payoff with maximum Bell violation.","marker":"[22]"},{"why":"shows that shared randomness assistance gives no quantum communication advantage in Bob-without-input prepare-and-measure scenarios, motivating the wire-reading construction.","marker":"[27]"},{"why":"provides the NPA hierarchy used to upper-bound maximum quantum payoffs through maximum quantum violations.","marker":"[30]"},{"why":"provides the Navascués–Vértesi method that pins down the two-qubit optimal payoff in CS[d=2,k=3].","marker":"[31]"},{"why":"defines the NPA hierarchy's foundational bounding technique for quantum correlations used throughout the numerical analysis.","marker":"[32]"},{"why":"supplies the pre- and post-processing resource-theoretic formalism used in Remark 1 to transform the shared correlation into the wire-cut correlation.","marker":"[28]"},{"why":"supports the type-independent local-operations-and-shared-randomness formalism behind the transformed no-signalling correlation.","marker":"[29]"},{"why":"introduces the penalty trick used in Proposition 1 to reduce wire-reading tasks to ordinary tasks with large negative coefficients.","marker":"[25]"}],"fun_headline_variants":["Bell violation equals quantum advantage in communication","Wire-cutting turns comms tasks into Bell tests","Non-local facets power optimal communication payoff","Qutrit entanglement outdoes qubit in new tasks","Wire-reading reveals advantage where none seemed"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The paper's results rest on Lemma 2's geometric claim that on a non-local facet—a face of the no-signalling polytope containing no local extreme point—every assignment of a forbidden output for each of Bob's inputs has some Alice input under which those forbidden outputs have exactly zero probability; if a facet in the standard sense contains local vertices, or if that zero-probability structure fails, the optimal-payoff proofs for the constructed task families do not go through.","fun_headline_variants_meta":{"raw":{"variants":["Bell violation equals quantum advantage in communication","Wire-cutting turns comms tasks into Bell tests","Non-local facets power optimal communication payoff","Qutrit entanglement outdoes qubit in new tasks","Wire-reading reveals advantage where none seemed"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000149,"raw_usage":{"total_tokens":1228,"prompt_tokens":1013,"completion_tokens":215,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":629,"completion_tokens_details":{"reasoning_tokens":148}},"tokens_in":629,"tokens_out":215,"duration_ms":3328,"temperature":1.0,"reasoning_tokens":148,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T17:25:49.253212+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a specific non-local facet such as the I3322 facet with the two extremal correlations given in Section 3.2.2 and enumerate all $2^3=8$ functions $L_B:[3]\\to[2]$, computing the sets $\\Phi_{x,a}^{L_B}$ for each extremal correlation; if for some $L_B$ every input $x$ has some output $a$ with $P(a,L_B(y)|x,y)>0$ for all $y$, then Lemma 2 fails and the claimed algebraic-maximum payoff for the corresponding facet-tailored task cannot hold.","supporting_citations":[{"cited_title":"On en- tanglement assistance to a noiseless classical channel","cited_arxiv_id":null,"evidence_quote":"defines the earlier one-bit prepare-and-measure task and its shared-randomness analysis that CS[d=2,k=2] is modelled on."},{"cited_title":"Adaptive advantage in entanglement-assisted communications","cited_arxiv_id":null,"evidence_quote":"supplies the adaptive entanglement-assisted communication framework and the non-commuting polynomial optimisation viewpoint used to equate maximum quantum payoff with maximum Bell violation."},{"cited_title":"Classi- cal information storage in an n-level quan- tum system","cited_arxiv_id":null,"evidence_quote":"shows that shared randomness assistance gives no quantum communication advantage in Bob-without-input prepare-and-measure scenarios, motivating the wire-reading construction."},{"cited_title":"A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations","cited_arxiv_id":null,"evidence_quote":"provides the NPA hierarchy used to upper-bound maximum quantum payoffs through maximum quantum violations."},{"cited_title":"Boundingthesetoffinitedimensionalquan- tum correlations","cited_arxiv_id":null,"evidence_quote":"provides the Navascués–Vértesi method that pins down the two-qubit optimal payoff in CS[d=2,k=3]."},{"cited_title":"Bounding the set of quan- tum correlations","cited_arxiv_id":null,"evidence_quote":"defines the NPA hierarchy's foundational bounding technique for quantum correlations used throughout the numerical analysis."},{"cited_title":"Quantifying Bell: the Resource Theory of Nonclassicality of Common-Cause Boxes","cited_arxiv_id":null,"evidence_quote":"supplies the pre- and post-processing resource-theoretic formalism used in Remark 1 to transform the shared correlation into the wire-cut correlation."},{"cited_title":"The type-independent resource theory of local operations and shared ran- domness","cited_arxiv_id":null,"evidence_quote":"supports the type-independent local-operations-and-shared-randomness formalism behind the transformed no-signalling correlation."},{"cited_title":"Advantage of hardy’s nonlocal correlation in reverse zero-error channel coding","cited_arxiv_id":null,"evidence_quote":"introduces the penalty trick used in Proposition 1 to reduce wire-reading tasks to ordinary tasks with large negative coefficients."}],"review_version":1}