Strategic Non-Shareability of Quantum Correlations

• URL: http://arxiv.org/abs/2605.25516v1
• Date: Mon, 25 May 2026 07:19:53 GMT
• Title: Strategic Non-Shareability of Quantum Correlations
• Abstract summary: We prove that on finite alphabets, the game-optimized anti-collusion capacity equals the total-variation distance to the shadow.<n>We recast entanglement monogamy as a measurable shareability deficit for quantum-mediated strategic networks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Making two action heads agree: coordination mechanisms and a runtime collapse certificate for flow-matching policies [13.05465000489116]
  Flow-matching policy decodes each predicted motion into joint and end-effector spaces.<n>On multimodal tasks, independently sampled branches may choose different valid modes, causing false alarms.<n>We study how to coordinate the two branches and at what cost.
  arXiv  Detail & Related papers  (2026-08-16T13:57:36Z)
• ECO/CPO-DAG: A Contradiction-Based Accountability Layer for Adversarial Supply Chains [0.0]
  ECO/CPO-DAG is a domain-specific accountability protocol for adversarial supply chains.<n>It formalizes contradiction detection as a supplemental validation layer.<n>The protocol's boundary is explicit: it detects provable contradictions, not consistent lies.
  arXiv  Detail & Related papers  (2026-07-07T21:03:26Z)
• Quotient Semivalues for False-Name-Resistant Data Attribution [1.253312107729806]
  We formalize false-name manipulation in ML data attribution.<n>We compute Shapley-, Banzhaf-, or Beta-style values over evidence-backed attribution clusters.<n>We instantiate the mechanisms in DataMarket-Gym, a benchmark for attribution under strategic provider attacks.
  arXiv  Detail & Related papers  (2026-05-08T12:34:20Z)
• TwinGate: Stateful Defense against Decompositional Jailbreaks in Untraceable Traffic via Asymmetric Contrastive Learning [60.68349524623048]
  Decompositional jailbreaks pose a critical threat to large language models.<n>We present TwinGate, a stateful dual-encoder defense framework.<n>We construct a comprehensive dataset of over 3.62 million instructions spanning 8,600 distinct malicious intents.
  arXiv  Detail & Related papers  (2026-04-30T13:44:01Z)
• Convergence of Byzantine-Resilient Gradient Tracking via Probabilistic Edge Dropout [1.3902537392439644]
  We study distributed optimization over networks with Byzantine agents that may send arbitrary adversarial messages.<n>We propose emphGradient Tracking with Probabilistic Edge Dropout and Leaky Integration (GT-PD-L)<n>GT-PD-L outperforms coordinate-wise mean by up to 4.3 percentage points under stealth attacks.
  arXiv  Detail & Related papers  (2026-04-01T03:55:42Z)
• Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions [89.52532304099522]
  Federated Learning (FL) enables clients to collaboratively train a shared model without centralizing their raw data, offering an inherent level of privacy.<n> gradients and model updates can still leak sensitive information, while malicious servers may mount adversarial attacks such as Byzantine manipulation.<n>These vulnerabilities highlight the need to address differential privacy (DP) and Byzantine robustness within a unified framework.<n>We propose Byz-Clip21-SGD2M, a new algorithm that integrates robust aggregation with double momentum and carefully designed clipping.
  arXiv  Detail & Related papers  (2026-03-24T17:39:09Z)
• Core Safety Values for Provably Corrigible Agents [2.6451153531057985]
  We introduce the first implementable framework for corrigibility, with provable guarantees in multi-step, partially observed environments.<n>Our framework replaces a single reward with five *structurally separate* utility heads.<n>For open-ended settings where adversaries can modify the agent, we prove that deciding whether an arbitrary post-hack agent will ever violate corrigibility is undecidable.
  arXiv  Detail & Related papers  (2025-07-28T16:19:25Z)
• Cloning Games, Black Holes and Cryptography [50.022147589030304]
  We introduce a new toolkit for analyzing cloning games.<n>This framework allows us to analyze a new cloning game based on binary phase states.<n>We show that the binary phase variantally optimal bound offers quantitative insights into information scrambling in idealized models of black holes.
  arXiv  Detail & Related papers  (2024-11-07T14:09:32Z)
• Exploiting hidden structures in non-convex games for convergence to Nash equilibrium [62.88214569402201]
  A wide array of modern machine learning applications can be formulated as non-cooperative Nashlibria. We provide explicit convergence guarantees for both deterministic and deterministic environments.
  arXiv  Detail & Related papers  (2023-12-27T15:21:25Z)
• Device independent security of quantum key distribution from monogamy-of-entanglement games [8.97780713904412]
  We propose a general device independent quantum key distribution protocol for non-local games.<n>We numerically optimize the finite and tripartite secret key rates of our protocol.<n>We show that our protocol is robust for depolarizing noise up to about $2.2%$, providing the first such bound for general attacks for magic square based quantum key distribution.
  arXiv  Detail & Related papers  (2023-12-07T06:48:38Z)
• Collective Robustness Certificates: Exploiting Interdependence in Graph Neural Networks [71.78900818931847]
  In tasks like node classification, image segmentation, and named-entity recognition we have a classifier that simultaneously outputs multiple predictions. Existing adversarial robustness certificates consider each prediction independently and are thus overly pessimistic for such tasks. We propose the first collective robustness certificate which computes the number of predictions that are simultaneously guaranteed to remain stable under perturbation.
  arXiv  Detail & Related papers  (2023-02-06T14:46:51Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.