{"id":"7fbbaff6-54c9-4db0-ac0c-81a5f0aefa83","arxiv_id":"2608.09540","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":3.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A review that gathers rate characterizations for strong and empirical quantum coordination across network topologies and links them to nonlocal games, DI-QKD, and quantum repeaters.","lead":"This paper is a review of quantum coordination, the task where distributed users generate correlated behavior instead of just exchanging messages. It explains how coordination rates connect to nonlocal games, device-independent quantum key distribution, and quantum repeaters.","discovery_kind":"review","skeptic_critique":{"model":"deepseek-v4-flash","headline":"CHSH example in Section III.E uses input-dependent states that violate the independence assumption (37) on which Theorems 1 and 7 rely, leaving the quoted game coordination rates unsupported.","rationale":"The reader's weakest assumption correctly identifies Eq. (37) as a load-bearing condition for Theorems 1 and 7. My stress-test goes further: the paper itself violates this assumption in Section III.E, where the CHSH example uses source states parameterized by the classical inputs X and Y. Because the game protocol distributes correlations in Phase 1 before the referee chooses questions, a state depending on (x,y) cannot be prepared, and the corresponding c-q target state fails the independence condition. Consequently, the quoted coordination rates for the CHSH game are not justified by the stated theorems. This is a more specific and more damaging issue than the Figure 7 table inconsistency noted by the reader: it affects a central application of the theoretical framework, not just a summary table. The paper is a review that clearly presents the theorems and their assumptions, and the main quantum empirical-coordination claim is attributed to the cited work [55]; however, the internal inconsistency makes the game application unreliable as written. The appropriate verdict remains conditional acceptance: the example should be corrected (e.g., by restricting to \\alpha_{x,y} constant or by clearly modeling a source with access to the questions), and the affected rate formulas should be revised or explicitly qualified.","tokens_in":32020,"tokens_out":11712,"duration_ms":104695,"concrete_test":"Check whether the target state in Eq. (34) satisfies the independence condition (37): compute the c-q state corresponding to the ensemble {p_{XY}, |\\omega^{(x,y)}\\rangle} and verify whether the reduced state on XYS factorizes as \\omega_{XY} \\otimes \\omega_S. For non-constant \\alpha_{x,y}, it will not, so Theorems 1 and 7 cannot be invoked. Alternatively, derive the rate formulas in Section III.E directly from the broadcast-network protocol when \\alpha_{x,y} depends on x,y; if the Source has no access to X,Y, the derivation must fail, and the example must be restricted to constant \\alpha.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Theorems 1 and 7 characterize strong and empirical coordination in the quantum broadcast network only for target states satisfying Remark 3, Eq. (37): the source system S must be uncorrelated with the classical inputs X and Y. Section III.E applies these theorems to the CHSH game, where the Source distributes qubit pairs in the state |\\omega^{(x,y)}\\rangle = \\sqrt{\\alpha_{x,y}}|00\\rangle + \\sqrt{1-\\alpha_{x,y}}|11\\rangle (Eq. 34), with amplitudes depending on the referee's questions x and y. In the phased game implementation (Fig. 9), Phase 1 occurs before the questions are drawn in Phase 2, so the Source cannot condition its state on (x,y). Equivalently, unless \\alpha_{x,y} is constant, the induced c-q state \\omega_{XYSAB} has S correlated with XY, violating (37). Therefore the rate expressions Q_{1\\to2} \\ge \\tfrac12 h_2(\\tfrac12(\\alpha_{0,0}+\\alpha_{0,1})) + \\tfrac12 h_2(\\tfrac12(\\alpha_{1,0}+\\alpha_{1,1})) and the analogous Q_{1\\to3} bound in Section III.E do not follow from Theorems 1 and 7. If \\alpha_{x,y}=\\alpha, the formulas reduce to Q \\ge h_2(\\alpha), but the paper's general parameterized formulas and the threshold \\alpha^* > 0.04491 are outside the theorem's domain. Remark 1 asserts that strong and empirical rates are identical in this case, yet that assertion rests on the same theorems whose hypotheses are not met. This is a concrete internal inconsistency in the paper's central application of coordination to nonlocal games.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript is a review of quantum coordination in multi-user networks. It defines strong and empirical coordination for classical and quantum systems, reviews two-node, broadcast, cascade, multiple-access, and no-communication network models, and quotes exact rate characterizations from the authors' prior papers (Theorems 1–8, attributed to [21], [55], and [86]). The paper then applies the broadcast coordination framework to the CHSH game, deriving communication-rate thresholds for Bell violation, and discusses device-independent QKD and quantum repeaters as further applications. The review is clearly organized and the distinction between empirical and strong coordination is presented as a central theme, with the claimed quantum phenomenon that empirical coordination does not reduce the communication rate for bipartite pure states.","tokens_in":32373,"tokens_out":14988,"duration_ms":127818,"significance":"The paper fills a useful expository niche by collecting recent coordination results and connecting them to nonlocal games and quantum networking. The cascade examples (Example 1 versus Example 2) nicely illustrate how entangled targets can reverse the classical rate ordering, and the DI-QKD and repeater sections provide accessible context. The review does not contain new proofs; all technical statements are referenced to the authors' own prior work. The one new application, the CHSH coordination-rate calculation, contains a domain error described in the major comments, so the advertised bridge between coordination theory and nonlocal games is not yet established. If the CHSH discussion is restricted to the constant-α case, which is within the theorem domain, the qualitative conclusions about Bell-violation thresholds survive, but the general parameterized formulas must be removed or corrected.","major_comments":[{"comment":"The parameterized CHSH example is outside the domain of the quoted broadcast-coordination theorems. In the broadcast model, Remark 3 requires the target state to obey non-signaling constraints: Alice's marginal of the source-output state may depend on x but not on y, and Bob's marginal may depend on y but not on x. For the state in Eq. (34), the reduced states on A and B are both diagonal with conditional probabilities α_{x,y} and 1−α_{x,y}; hence independence of y for Alice and independence of x for Bob force α_{x,y} to be constant in both arguments. Consequently, the rate formulas preceding Remark 1, which average different α values per question pair, do not follow from Theorems 1 and 7, and neither does Remark 1's assertion that strong and empirical rates coincide for the general parameterized family. The special case α_{x,y}=α, yielding Q_{i→j} ≥ h_2(α), is valid, and the threshold discussion can be stated for that case; as written, the general formulas and the threshold condition α_{x,y}>0.04491 are unsupported.","section":"Sec. III.E, Remark 3, Theorems 1 and 7"}],"minor_comments":[{"comment":"Figure 7 swaps the strong-coordination entries for CR and no-CR relative to the text in Section I.C.1: the text says that with CR the rate is I(X;Y) and without CR it is C(X;Y), while the table lists C(X;Y) under CR and I(X;Y) under no CR. Please correct the table.","section":"Fig. 7 / Sec. I.C.1"},{"comment":"The displayed formula for π_CHSH(P) appears garbled in typesetting; as printed, it does not evaluate to 0.8535 for α_{x,y}=1/2. Please check the expression and ensure that the stated numerical values follow.","section":"Eq. (35)"},{"comment":"Section III.D states that S is null and A and B are classical, but Section III.E immediately treats qubit states on A and B; please clarify that Section III.E considers the quantum-resource target state for the broadcast network rather than the final classical answer registers.","section":"Sec. III.D–III.E"},{"comment":"The claim that empirical coordination of a bipartite pure state requires the same rate H(ω_B) as strong coordination is presented as a recent result from [55] without any intuitive explanation; a short remark on why the quantum case differs from the classical case would improve readability.","section":"Sec. I.C.2"},{"comment":"In the DI-QKD example, the depolarized state in Eq. (63) appears to satisfy the broadcast network's non-signaling constraints because α is constant; I recommend stating this explicitly when applying Theorem 1 in Eq. (69).","section":"Sec. VII.B"}],"recommendation":"major_revision","confidential_remarks":"The manuscript relies heavily on the authors' own prior papers for all technical statements, and the only new application, the CHSH coordination-rate calculation, falls outside the theorem domain as shown in the major comment. This makes the incremental contribution of the review limited in its present form. The editor may wish to consider whether a focused correction of the CHSH section, restricting it to the constant-α case and removing the unsupported general formulas, would be sufficient, or whether the paper should be redirected as a corrigendum to the authors' earlier work rather than a standalone review."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First thing you should know: this is a review, not a new-results paper. Its value is organizational—it collects rate characterizations for strong and empirical coordination across two-node, broadcast, cascade, multiple-access, and no-communication networks, and connects them to nonlocal games, DI-QKD, and repeaters. The writing is clear and the attributions are explicit. For someone wanting a map of this subfield, it could serve as a decent entry point.\n\nThe paper does several things well. The distinction between strong and empirical coordination is explained carefully, the broadcast/cascade/MAC theorems are stated cleanly with pointers to prior work, and the DI-QKD and repeater sections give a useful sense of where coordination rates enter applications. The reader's strongest claim—that for empirical coordination of a bipartite quantum state the rate is also H(ω_B)—is indeed a sharp contrast with the classical case, and it is properly attributed to [55].\n\nNow the soft spots. The smaller one: Figure 7 swaps the CR and no-CR entries for strong coordination relative to the text in Section I.C.1. The text says strong coordination with common randomness costs I(X;Y) and without it costs C(X;Y); the table has it backwards. That is a minor fix, but in a review that people will use as a reference, it matters.\n\nThe larger one is in the CHSH example of Section III.E. The paper applies Theorems 1 and 7 to states |ω^(x,y)> whose amplitudes depend on x and y, while those theorems explicitly assume Remark 3's condition (37), that the source system S is uncorrelated with the classical inputs XY, and the associated no-signaling constraints. In the phased game, the source acts before the referee draws the questions, so it cannot condition its state on (x,y). Unless α_{x,y} is constant, the rate formulas and the threshold α*>0.04491 do not follow from Theorems 1 and 7. I checked whether this might be harmless shorthand, but the formulas themselves are averaged quantities that do not match the stated state (34). This is a genuine gap in the paper's central application to nonlocal games, not a cosmetic slip.\n\nThere is also a notational tension: Section III.D says A and B are classical registers and S is null, then Section III.E treats A and B as qubits. That makes the CHSH model harder to pin down.\n\nNet: the review is honest and the quoted theorems come from peer-reviewed sources, so the heavy self-citation is not itself a problem. But the CHSH application needs to be reworked—either restrict to constant α or extend the theorems to a model where the source knows the inputs, which would be a different network. After that fix and the table correction, this deserves a serious referee. I would send it out.","headline":"A clear, useful review of quantum coordination whose main game-theoretic example oversteps the theorems it quotes; fix the CHSH section and the table swap and it deserves refereeing.","tokens_in":32855,"tokens_out":5706,"would_cite":true,"duration_ms":51679,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":["03.67.Hk","03.65.Ud","03.67.Dd"],"model":"deepseek-v4-flash","headline":"Empirical quantum coordination costs the full entropy rate.","keywords":["quantum coordination","empirical coordination","strong coordination","nonlocal games","quantum networks","entanglement simulation","device-independent quantum key distribution","quantum repeaters"],"falsifier":"Search for a protocol that achieves empirical coordination of the pure bipartite state $|\\omega\\rangle_{AB}$ with a quantum communication rate strictly below $H(\\omega_B)$ while keeping the average state within vanishing trace distance of the target; existence of even one asymptotic protocol would falsify the theorem's claimed optimality. The same check can be done numerically by optimizing over all blocklength-$n$ encodings and verifying whether the $n\\to\\infty$ rate can dip below the entropy.","tokens_in":31828,"feed_emoji":"🔗","tokens_out":8086,"duration_ms":73996,"temperature":0.7,"pith_summary":"This review makes the case that coordination—having distributed users generate correlated behavior rather than exchange messages—is the right lens for quantum networks, from nonlocal games to quantum cryptography. Its central message is that in the quantum setting, demanding only the empirical average of a bipartite state is not cheaper than reproducing the full sequence: the optimal rate remains the von Neumann entropy $H(\\omega_B)$, in sharp contrast to classical coordination. The review backs this with rate theorems for two-node, broadcast, cascade, multiple-access, and no-communication networks, and shows how the same rates govern winning probabilities in the CHSH game and secret-key rates in device-independent QKD. The reader should take away that entanglement changes the resource accounting of coordination fundamentally, sometimes even letting downstream users need more communication than upstream ones.","feed_headline":"Quantum coordination: matching averages costs the full entropy","feed_subtitle":"A review shows that in quantum networks, weaker coordination goals still demand lossless-compression rates.","key_machinery":"The machinery is a set of exact coordination rate regions expressed in conditional von Neumann entropies, computed for classical–quantum target states of the form $\\omega_{XYSAB}$ and for pure states $|\\omega\\rangle_{ABC}$. The main proof tools are quantum channel resolvability and random binning for classical links, and quantum state redistribution, Schumacher compression, and the decoupling theorem for quantum links. Negative conditional entropy—the phenomenon the paper calls 'knowing less than nothing'—is what permits cascade rates to reverse ordering, and the independence assumption $\\omega_{XYS}=\\omega_{XY}\\otimes\\omega_S$ is what keeps the broadcast formulas simple.","core_discovery":"The paper's most consequential claim is that, for a two-node quantum network, weak 'empirical' coordination—matching only the average statistics of a repeated experiment—does not reduce the communication cost below that of strong coordination. For a pure bipartite target $|\\omega\\rangle_{AB}$, both tasks require the source to send qubits at rate at least $H(\\omega_B)$, the von Neumann entropy of Bob's reduced state, so lossless compression stays optimal even when only averages matter. In the broadcast network with classical inputs $X,Y$ and quantum outputs $A,B$, the paper states necessary and sufficient conditions $Q_{1\\to2}\\ge H(A|X)_\\omega$ and $Q_{1\\to3}\\ge H(B|Y)_\\omega$ for both strong and empirical coordination. The cascade results show the reverse of classical intuition: for entangled targets the Alice–Bob link can carry fewer qubits than the Bob–Charlie link. The review also derives classical-link results that restrict achievable correlations to separable states, and connects the rate formulas to CHSH-winning thresholds and DI-QKD key rates.","pith_inferences":["This inference goes beyond the paper: if the equality of strong and empirical rates holds for arbitrary network topologies, then finite blocklength and noisy-channel models are where any discount for empirical coordination would have to appear, making those regimes the natural next test.","The cascade rate reversal suggests a routing principle the paper does not state: in quantum networks, link-rate requirements are not monotone along a path, so intermediate nodes may need more capacity than upstream ones whenever entanglement is being generated.","A testable extension would be to run CHSH-type games with protocols that only enforce empirical coordination—without round-wise independence—and measure whether the winning probability still reaches $0.8535$ at the predicted rate."],"forward_implications":["In the two-node case, empirical coordination of a pure bipartite state demands the same qubit rate $H(\\omega_B)$ as strong coordination, so no asymptotic protocol saves communication by settling for average statistics.","In quantum-linked broadcast networks, the strong and empirical coordination rate regions coincide, so game strategies based on repeated rounds are not cheaper than those that reproduce the full i.i.d. sequence.","In cascade networks with entangled targets, the Alice-to-Bob link may require fewer qubits than Bob-to-Charlie, because conditional entropy can be negative.","Classical links can only coordinate separable correlations, so entanglement targets are impossible without quantum links or pre-shared entanglement.","The coordination rates set the exact threshold for Bell violation in the CHSH game and for a positive device-independent key rate under depolarizing noise."],"supporting_citations":[{"why":"Supplies the strong-coordination rate theorems for broadcast, cascade, multiple-access, and no-communication networks that the review builds on.","marker":"[21]"},{"why":"Proves that empirical coordination in the quantum broadcast network has the same rates as strong coordination, the paper's headline quantum-classical contrast.","marker":"[55]"},{"why":"Establishes the empirical-coordination rate region for separable correlations over the classical-link cascade network.","marker":"[86]"},{"why":"Defines the classical coordination-capacity framework and the baseline rates that quantum results are compared against.","marker":"[1]"},{"why":"Gives the classical two-node empirical and strong coordination rate requirements with and without common randomness.","marker":"[48]"},{"why":"Introduces Wyner's common information, the classical strong-coordination cost that quantum entropy rates replace.","marker":"[47]"},{"why":"Provides the quantum reverse Shannon theorem used for entanglement-assisted simulation and the one-half mutual information bound.","marker":"[56]"},{"why":"Schumacher compression supplies the lossless-compression rate $H(\\omega_B)$ that remains optimal for empirical coordination.","marker":"[54]"},{"why":"State redistribution is the core technique for quantum-link coordination protocols in the broadcast and cascade networks.","marker":"[62]"}],"fun_headline_variants":["Weak quantum coordination still needs maximum qubit rate","Empirical coordination: no cheaper than strong in quantum nets","Matching averages costs full entropy in quantum coordination","Quantum coordination: weaker goal, same high communication cost","Entropy limit persists for empirical quantum coordination"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The broadcast-network rate formulas hold only while the source register $S$ stays uncorrelated with the classical inputs $X$ and $Y$ (Remark 3, Eq. (37)); when that independence fails, the simple bounds $H(A|X)$ and $H(B|Y)$ cease to apply.","fun_headline_variants_meta":{"raw":{"variants":["Weak quantum coordination still needs maximum qubit rate","Empirical coordination: no cheaper than strong in quantum nets","Matching averages costs full entropy in quantum coordination","Quantum coordination: weaker goal, same high communication cost","Entropy limit persists for empirical quantum coordination"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000211,"raw_usage":{"total_tokens":1446,"prompt_tokens":1011,"completion_tokens":435,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":627,"completion_tokens_details":{"reasoning_tokens":362}},"tokens_in":627,"tokens_out":435,"duration_ms":4502,"temperature":1.0,"reasoning_tokens":362,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T15:25:20.279205+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Search for a protocol that achieves empirical coordination of the pure bipartite state $|\\omega\\rangle_{AB}$ with a quantum communication rate strictly below $H(\\omega_B)$ while keeping the average state within vanishing trace distance of the target; existence of even one asymptotic protocol would falsify the theorem's claimed optimality. The same check can be done numerically by optimizing over all blocklength-$n$ encodings and verifying whether the $n\\to\\infty$ rate can dip below the entropy.","supporting_citations":[{"cited_title":"Empirical coordination of quantum correlations,","cited_arxiv_id":null,"evidence_quote":"Proves that empirical coordination in the quantum broadcast network has the same rates as strong coordination, the paper's headline quantum-classical contrast."},{"cited_title":"Empirical coordination of separable quantum correlations,","cited_arxiv_id":null,"evidence_quote":"Establishes the empirical-coordination rate region for separable correlations over the classical-link cascade network."},{"cited_title":"The quantum reverse Shannon theorem and resource tradeoffs for simulating quantum channels,","cited_arxiv_id":null,"evidence_quote":"Provides the quantum reverse Shannon theorem used for entanglement-assisted simulation and the one-half mutual information bound."},{"cited_title":"Exact cost of redistributing multipartite quantum states,","cited_arxiv_id":null,"evidence_quote":"State redistribution is the core technique for quantum-link coordination protocols in the broadcast and cascade networks."}],"review_version":1}