Pith. sign in

REVIEW 2 major objections 1 minor 44 references

Strategic Non-Shareability of Quantum Correlations

T0 review · 2 major / 1 minor · reviewed 2026-06-29 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Quantum correlations resist lossless copying to colluders, with their anti-collusion capacity exactly equal to total-variation distance from the collusive shadow.

desk verdict The paper frames entanglement monogamy as an anti-collusion resource via a collusive shadow and proves its game capacity equals TV distance on finite alphabets, with sharp CHSH bounds, but the shadow definition may miss some extensions. read the letter →

arxiv 2605.25516 v1 pith:TS7TE3PO submitted 2026-05-25 quant-ph

Fumin Wang This is my paper · ORCID
classification quant-ph
keywords quantumcorrelationsentanglementmonogamyanti-collusioncapacityCHSHinequalitytotalvariationdistanceBellnonlocalitystrategicgamescollusiveshadow
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper shows that for any fixed authorized correlation P12 between two parties, the maximum capacity to play games while resisting a colluding third party equals the total-variation distance between P12 and the set of all behaviors a colluder could produce in extensions that leave P12 unchanged. This distance is realized by optimizing over suitable games, and the construction turns the monogamy of entanglement into an operational quantity for private strategic tasks. In the CHSH slice the local bound S12 equals 2 marks the exact threshold where this capacity turns positive, reaching 1 over 2 root 2 for the maximally entangled strategy, while any classical hidden-variable mediator yields zero capacity. The authors supply a finite-data certification protocol based on Hoeffding bounds and a level-2 NPA relaxation that extends the certified envelopes to tilted inequalities.

What carries the argument

The collusive shadow of an authorized behavior P12, the set of all relabelled behaviors reproducible by a colluder in any admissible tripartite extension that preserves P12.

What would settle it

An explicit tripartite quantum behavior whose authorized CHSH marginal has score strictly above 2 yet whose measured anti-collusion capacity against any colluder deviates from the total-variation distance to the predicted shadow.

Watch

Extended reading notes

Core claim

For a fixed authorized behavior P12 the collusive shadow is defined as the set of all relabelled behaviors that a colluder can reproduce in any admissible tripartite extension preserving the authorized marginal. The game-optimized anti-collusion capacity is proved equal to the total-variation distance from P12 to this shadow. In the CHSH score slice, Toner-Verstraete monogamy yields the exact certified frontier: the Bell local bound S12=2 is the sharp onset of positive certified anti-collusion power, saturating at 1/(2√2) for the maximally entangled CHSH strategy, while classical hidden-variable mediators have zero capacity in the same slice.

Load-bearing premise

Every admissible tripartite extension preserving the authorized marginal P12 can be captured by relabelled behaviors whose distance is operationally meaningful, and Toner-Verstraete monogamy applies directly to the game values without further constraints on the extension.

Editorial extensions

If this is right

  • The Bell local bound S12=2 is the sharp threshold for the onset of positive certified anti-collusion capacity in the CHSH slice.
  • The capacity reaches its maximum value of 1/(2√2) precisely for the maximally entangled state under the CHSH strategy.
  • Classical hidden-variable mediators produce zero anti-collusion capacity in the CHSH slice.
  • Observed Bell scores can be converted into confidence-bounded anti-collusion certificates via a Hoeffding-based finite-data protocol.
  • Level-2 NPA semidefinite relaxations furnish certified upper envelopes on the capacity for tilted Bell inequalities.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The equality between game-optimized capacity and total-variation distance suggests that practical computation of the distance can be approximated by searching over a finite set of games rather than enumerating all possible extensions.
  • The CHSH saturation result may generalize to other Bell scenarios, providing quantitative shareability deficits for device-independent protocols that must tolerate or exclude colluding parties.
  • The finite-data certification protocol could be combined with existing Bell-test hardware to produce real-time anti-collusion guarantees in quantum network demonstrations.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 1 minor

Summary. The manuscript introduces strategic non-shareability of quantum correlations as an operational resource in private-information games. For a fixed authorized behavior P_{12}, it defines the collusive shadow as the set of relabelled behaviors a colluder can reproduce in any admissible tripartite extension preserving P_{12}. It proves that, on finite alphabets, the game-optimized anti-collusion capacity equals the total-variation distance to the shadow; a fixed game separates via a witness while optimization over relabelled games recovers the full distance. In the CHSH score slice, Toner-Verstraete monogamy yields the exact certified frontier with the Bell local bound S_{12}=2 as the sharp onset of positive capacity, saturating at 1/(2√2) for the maximally entangled CHSH strategy. Classical hidden-variable mediators have zero capacity. The work also provides a Hoeffding-based finite-data certification protocol and a level-2 NPA semidefinite relaxation for tilted Bell inequalities.

Significance. If the results hold, the paper recasts entanglement monogamy as a measurable shareability deficit with direct application to adversarial quantum networks, supplying an exact equality to TV distance and a sharp CHSH frontier. Credit is given for the direct use of the Toner-Verstraete monogamy theorem to obtain a parameter-free certified bound, the finite-sample Hoeffding protocol, and the NPA extension to tilted inequalities. These elements strengthen the operational utility if the shadow definition is shown to be complete.

major comments (2)
  1. [Definition of collusive shadow] Definition of collusive shadow (abstract and the section introducing the shadow): The equality between game-optimized anti-collusion capacity and total-variation distance to the shadow is presented as a proved theorem. This equality rests on the claim that the shadow—defined exclusively via relabelled behaviors in admissible extensions—exhausts all operationally relevant colluder behaviors. No explicit argument is given that extensions with non-relabelable measurement choices or additional hidden variables cannot produce behaviors outside the shadow; if such extensions exist, the TV distance underestimates true shareability and the equality fails for general P_{12}.
  2. [CHSH slice] CHSH slice argument (abstract and the CHSH section): The direct invocation of Toner-Verstraete monogamy on game values to certify that S_{12}=2 is the sharp onset and that saturation occurs at 1/(2√2) assumes the monogamy bound applies without further constraints imposed by the tripartite extension. A concrete justification that relabelling captures the worst-case extension (or an explicit check that non-relabelled extensions cannot exceed the bound) is required to confirm the frontier is exact rather than an upper bound under the relabelling restriction.
minor comments (1)
  1. [Notation] Notation for the authorized marginal is introduced as P_{12} without an explicit statement of the alphabet sizes or whether the finite-alphabet assumption is used only for the equality or also for the CHSH slice.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments, which help clarify the operational scope of the collusive shadow. We address the two major comments point by point below, indicating the revisions that will be incorporated.

read point-by-point responses

  1. Referee: Definition of collusive shadow (abstract and the section introducing the shadow): The equality between game-optimized anti-collusion capacity and total-variation distance to the shadow is presented as a proved theorem. This equality rests on the claim that the shadow—defined exclusively via relabelled behaviors in admissible extensions—exhausts all operationally relevant colluder behaviors. No explicit argument is given that extensions with non-relabelable measurement choices or additional hidden variables cannot produce behaviors outside the shadow; if such extensions exist, the TV distance underestimates true shareability and the equality fails for general P_{12}.

    Authors: We agree that an explicit argument is required to confirm completeness. In the revised manuscript we will insert a new paragraph immediately after the formal definition of the collusive shadow. The paragraph will state that, because output alphabets are finite and labels are conventional, every marginal produced by a colluder in any admissible tripartite extension (including those with extra hidden variables) can be expressed, without loss of generality, as a relabelled behavior inside the authorized alphabet. Consequently, the set of all such relabelled behaviors already enumerates the operationally relevant colluder strategies, and the equality between game-optimized capacity and total-variation distance continues to hold for arbitrary finite-alphabet P_{12}. revision: yes

  2. Referee: CHSH slice argument (abstract and the CHSH section): The direct invocation of Toner-Verstraete monogamy on game values to certify that S_{12}=2 is the sharp onset and that saturation occurs at 1/(2√2) assumes the monogamy bound applies without further constraints imposed by the tripartite extension. A concrete justification that relabelling captures the worst-case extension (or an explicit check that non-relabelled extensions cannot exceed the bound) is required to confirm the frontier is exact rather than an upper bound under the relabelling restriction.

    Authors: The CHSH-section proof already invokes Toner–Verstraete directly on the game values attained inside the relabelled shadow. Because the general theorem shows that optimization over relabelled games recovers the full total-variation distance, the monogamy bound obtained within this framework is tight for the defined capacity. We will add one clarifying sentence in the CHSH section: any hypothetical non-relabelled extension yields a marginal that is equivalent, after output relabelling, to a behavior already considered in the shadow; the monogamy inequality therefore continues to apply and the certified frontier (onset at S_{12}=2, saturation at 1/(2√2)) remains exact. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity detected

full rationale

The paper defines the collusive shadow operationally via relabelled behaviors in tripartite extensions and proves (rather than defines) that game-optimized anti-collusion capacity equals TV distance to that shadow on finite alphabets; this is presented as a theorem with separating witnesses, not a tautology. The CHSH-slice frontier invokes the external Toner-Verstraete monogamy result with no author overlap. No self-citation chains, fitted-input renamings, or self-definitional reductions appear in the derivation; the central claims rest on independent proof steps and external benchmarks.

Assumptions & free parameters 0 free parameters · 1 assumptions · 1 invented entities

The central claims rest on standard quantum theory and one external monogamy theorem; the paper introduces new definitions rather than new physical postulates or fitted constants.

assumptions (1)
  • domain assumption Toner-Verstraete monogamy bound for CHSH correlations
    Invoked to obtain the exact frontier in the CHSH score slice.
invented entities (1)
  • collusive shadow
    purpose: Set of all relabelled behaviors reproducible by a colluder in any tripartite extension that preserves the authorized marginal P12
    Newly introduced set whose distance defines strategic non-shareability; no independent physical evidence supplied.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Strategic Non-Shareability of Quantum Correlations." pith.science (2026). https://pith.science/paper/TS7TE3PO

@misc{pith2026260525516,
  author       = {Pith},
  title        = {Pith review of: Strategic Non-Shareability of Quantum Correlations},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TS7TE3PO}},
  note         = {Machine review of arXiv:2605.25516}
}
abstract

Correlations distributed by a mediator are usually valued for the coordination they enable between authorized agents, but in adversarial settings a more decisive property is whether the same coordination can be inherited by an outside colluder without disturbing the authorized marginal. Classical shared randomness is freely copyable, so a hidden seed coordinating two agents can be duplicated for a third; entanglement is constrained by monogamy, which can forbid such lossless extensions in strongly nonlocal regimes. We turn this asymmetry into an operational resource for private-information games. For a fixed authorized behavior $P_{12}$, we define its \emph{collusive shadow} as the set of relabelled behaviors a colluder can reproduce in any admissible tripartite extension preserving $P_{12}$, and we identify \emph{strategic non-shareability} with the distance from this shadow. We prove that, on finite alphabets, the game-optimized anti-collusion capacity equals the total-variation distance to the shadow; a fixed game provides a task-specific separating witness, while optimization over relabelled games recovers the full distance. In the CHSH score slice, Toner--Verstraete monogamy yields the exact certified frontier, so the Bell local bound $S_{12}=2$ is the sharp onset of positive certified anti-collusion power, saturating at $1/(2\sqrt{2})$ for the maximally entangled CHSH strategy. Classical hidden-variable mediators have zero capacity in this slice. We complement these results with two operational tools: a Hoeffding-based finite-data certification protocol that turns observed Bell scores into confidence-bounded anti-collusion certificates, and a level-2 NPA semidefinite relaxation that extends certified upper envelopes to tilted Bell inequalities. These results recast entanglement monogamy as a measurable shareability deficit for quantum-mediated strategic networks.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

44 extracted references · 1 canonical work pages

  1. [1]

    Bell, J. S. On the Einstein Podolsky Rosen paradox.Physics1, 195–200 (1964)

    1964

  2. [2]

    F., Horne, M

    Clauser, J. F., Horne, M. A., Shimony, A. & Holt, R. A. Proposed experiment to test local hidden-variable theories.Phys. Rev. Lett.23, 880–884 (1969)

    1969

  3. [3]

    Tsirelson, B. S. Quantum generalizations of Bell’s inequality.Lett. Math. Phys. 4, 93–100 (1980)

    1980

  4. [4]

    & Wehner, S

    Brunner, N., Cavalcanti, D., Pironio, S., Scarani, V. & Wehner, S. Bell nonlocality. Rev. Mod. Phys.86, 419–478 (2014)

    2014

  5. [5]

    & Horodecki, K

    Horodecki, R., Horodecki, P., Horodecki, M. & Horodecki, K. Quantum entangle- ment.Rev. Mod. Phys.81, 865–942 (2009)

    2009

  6. [6]

    & Kent, A

    Barrett, J., Hardy, L. & Kent, A. No signalling and quantum key distribution. Phys. Rev. Lett.95, 010503 (2005)

    2005

  7. [7]

    Arnon-Friedman, R. et al. Practical device-independent quantum cryptography via entropy accumulation.Nat. Commun.9, 459 (2018)

    2018

  8. [8]

    & Renner, R

    Portmann, C. & Renner, R. Security in quantum cryptography.Rev. Mod. Phys. 94, 025008 (2022)

    2022

Show all 44 references
  1. [9]

    Pironio, S. et al. Device-independent quantum key distribution secure against collective attacks.New J. Phys.11, 045021 (2009)

    2009

  2. [10]

    Ac´ ın, A. et al. Device-independent security of quantum cryptography against collective attacks.Phys. Rev. Lett.98, 230501 (2007)

    2007

  3. [11]

    & Ac´ ın, A

    Masanes, L., Pironio, S. & Ac´ ın, A. Secure device-independent quantum key dis- tribution with causally independent measurement devices.Nat. Commun.2, 238 (2011)

    2011

  4. [12]

    Ekert, A. K. Quantum cryptography based on Bell’s theorem.Phys. Rev. Lett. 67, 661–663 (1991). 17

    1991

  5. [13]

    Zapatero, V. et al. Advances in device-independent quantum key distribution.npj Quantum Inf.9, 10 (2023)

    2023

  6. [14]

    Nadlinger, D. P. et al. Experimental quantum key distribution certified by Bell’s theorem.Nature607, 682–686 (2022)

    2022

  7. [15]

    Zhang, W. et al. A device-independent quantum key distribution system for distant users.Nature607, 687–691 (2022)

    2022

  8. [16]

    Liu, W.-Z. et al. Toward a photonic demonstration of device-independent quantum key distribution.Phys. Rev. Lett.129, 050502 (2022)

    2022

  9. [17]

    & Hanson, R

    Wehner, S., Elkouss, D. & Hanson, R. Quantum internet: A vision for the road ahead.Science362, eaam9288 (2018)

    2018

  10. [18]

    & Renou, M.-O

    Tavakoli, A., Pozas-Kerstjens, A., Luo, M.-X. & Renou, M.-O. Bell nonlocality in networks.Rep. Prog. Phys.85, 056001 (2022)

    2022

  11. [19]

    Terhal, B. M. Is entanglement monogamous?IBM J. Res. Dev.48, 71–78 (2004)

    2004

  12. [20]

    & Verstraete, F

    Toner, B. & Verstraete, F. Monogamy of Bell correlations and Tsirelson’s bound. Preprint at arXiv:quant-ph/0611001(2006)

    2006 arXiv

  13. [21]

    & Wootters, W

    Coffman, V., Kundu, J. & Wootters, W. K. Distributed entanglement.Phys. Rev. A61, 052306 (2000)

    2000

  14. [22]

    Osborne, T. J. & Verstraete, F. General monogamy inequality for bipartite qubit entanglement.Phys. Rev. Lett.96, 220503 (2006)

    2006

  15. [23]

    & Gisin, N

    Scarani, V. & Gisin, N. Quantum communication betweenNpartners and Bell’s inequalities.Phys. Rev. Lett.87, 117901 (2001)

    2001

  16. [24]

    Aumann, R. J. Subjectivity and correlation in randomized strategies.J. Math. Econ.1, 67–96 (1974)

    1974

  17. [25]

    & Watrous, J

    Cleve, R., Hoyer, P., Toner, B. & Watrous, J. Consequences and limits of nonlocal strategies. InProc. 19th IEEE Conference on Computational Complexity, 236–249 (IEEE, 2004)

    2004

  18. [26]

    Werner, R. F. Quantum states with Einstein-Podolsky-Rosen correlations admit- ting a hidden-variable model.Phys. Rev. A40, 4277–4281 (1989)

    1989

  19. [27]

    & Ac´ ın, A

    Navascu´ es, M., Pironio, S. & Ac´ ın, A. Bounding the set of quantum correlations. Phys. Rev. Lett.98, 010401 (2007)

    2007

  20. [28]

    & Ac´ ın, A

    Navascu´ es, M., Pironio, S. & Ac´ ın, A. A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations.New J. Phys.10, 073013 (2008). 18

    2008

  21. [29]

    C., Parrilo, P

    Doherty, A. C., Parrilo, P. A. & Spedalieri, F. M. Distinguishing separable and entangled states.Phys. Rev. Lett.88, 187904 (2002)

    2002

  22. [30]

    C., Parrilo, P

    Doherty, A. C., Parrilo, P. A. & Spedalieri, F. M. Complete family of separability criteria.Phys. Rev. A69, 022308 (2004)

    2004

  23. [31]

    Analytic and nearly optimal self-testing bounds for the cloned- CHSH and Bell inequalities.Phys

    Kaniewski, J. Analytic and nearly optimal self-testing bounds for the cloned- CHSH and Bell inequalities.Phys. Rev. Lett.117, 070402 (2016)

    2016

  24. [32]

    & Pironio, S

    Ac´ ın, A., Massar, S. & Pironio, S. Randomness versus nonlocality and entangle- ment.Phys. Rev. Lett.108, 100402 (2012)

    2012

  25. [33]

    & Pironio, S

    Bamps, C. & Pironio, S. Sum-of-squares decompositions for a family of Clauser- Horne-Shimony-Holt-like inequalities and their application to self-testing.Phys. Rev. A91, 052111 (2015)

    2015

  26. [34]

    Yang, T. H. & Navascu´ es, M. Robust self-testing of unknown quantum systems into any entangled two-qubit states.Phys. Rev. A87, 050102(R) (2013)

    2013

  27. [35]

    The transition probability in the state space of a∗-algebra.Rep

    Uhlmann, A. The transition probability in the state space of a∗-algebra.Rep. Math. Phys.9, 273–279 (1976)

    1976

  28. [36]

    Fuchs, C. A. & van de Graaf, J. Cryptographic distinguishability measures for quantum-mechanical states.IEEE Trans. Inf. Theory45, 1216–1227 (1999)

    1999

  29. [37]

    & Renner, R

    Dupuis, F., Fawzi, O. & Renner, R. Entropy accumulation.Commun. Math. Phys. 379, 867–913 (2020)

    2020

  30. [38]

    & Massar, S

    Pironio, S. & Massar, S. Security of practical private randomness generation. Phys. Rev. A87, 012336 (2013)

    2013

  31. [39]

    Wootters, W. K. & Zurek, W. H. A single quantum cannot be cloned.Nature 299, 802–803 (1982). 19 Supplementary Information Strategic Non-Shareability of Quantum Correlations This Supplementary Information contains the mathematical details behind the theorem chain in the main te...

    1982

  32. [40]

    All trace norms are full trace norms

    For a pure stateϕ=|ψ⟩ ⟨ψ| this givesF(ρ, ϕ) 2 =⟨ψ|ρ|ψ⟩. All trace norms are full trace norms. The CHSH signed correlator is normalized as SAB =⟨A 0B0⟩+⟨A 0B1⟩+⟨A 1B0⟩ − ⟨A1B1⟩,(28) where all observables are self-adjoint contractions with spectrum in [−1,1]. For a fixed CHSH or...

  33. [41]

    Hence⟨A 0B0⟩= 1√ 2(sinθ+ 0) = sinθ√ 2

    A direct evaluation of the expectation values yields⟨σ x ⊗σ x ⊗I⟩= sinθand⟨σ x ⊗σ y ⊗I⟩= 0 (the cross terms cancel by orthogonality). Hence⟨A 0B0⟩= 1√ 2(sinθ+ 0) = sinθ√ 2 . The remaining three correlators evaluate to⟨A 0B1⟩= sinθ√ 2 ,⟨A 1B0⟩= sinθ√ 2 , and⟨A 1B1⟩=− sinθ√ 2 . ...

  34. [42]

    Proof.From Theorem 9, any collusive extension satisfiesS 13 ≤ √ 8−s 2

    = 1/(2 √ 2). Proof.From Theorem 9, any collusive extension satisfiesS 13 ≤ √ 8−s 2. Converting to winning probabilities givesω 12(s)−ω max 13 (s) = (s− √ 8−s 2)/8. The positive part yields the formula. Positivity requiress >2. 12 Minimal game separation Supplementary Theorem 1...

  35. [43]

    By CHSH monogamy, the maximal collusive winning probability for any tripartite extension is bounded byC max 13 (η)≤ 1 2 + √ 1−η2 2 √ 2 . Therefore the score-certified anti-collusion power satisfies Γscore CHSH(η)≡Γ + CHSH(2 √ 2η) = " η− p 1−η 2 2 √ 2 # + .(36) This is a score-...

  36. [44]

    certificate = yes

    We ran the NPA level-2 upper envelope on a grid of 60 points and compared with the analytic curve. On certified grid points, the maximum abso- lute deviation is 5.5×10 −4 and the mean absolute deviation is 2.7×10 −5. The single non-certified point is the Tsirelson endpoints= 2...

Pith tools

Reviewed June 29, 2026 · model on record in the stance chip above.