Communication-constrained nonlocal correlations

• URL: http://arxiv.org/abs/2603.08610v1
• Date: Mon, 09 Mar 2026 16:56:50 GMT
• Title: Communication-constrained nonlocal correlations
• Abstract summary: Communication-based proposals highlight the role of communication in ruling out unphysical theories.<n>We employ the general information-theoretic framework to derive new operational constraints preventing such unphysical behaviors.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Identifying the physical grounds distinguishing quantum theory from broader probabilistic frameworks remains an open challenge. Communication-based proposals -- most notably the principles of impossibility of superluminal signaling and information causality (IC) -- highlight the role of communication in ruling out unphysical theories and offer an operational rationale on why quantum predictions prevail over these alternative models. Nevertheless, most such developments rely on communicating parts optimizing over specific tasks, such as communication complexity problems and random access codes (RAC). In this work, we systematically extend this communication-based approach. We characterize the class of communication tasks relevant for this context, and employ the general information-theoretic framework to derive new operational constraints preventing such unphysical behaviors. Remarkably, our results reveal a broad family of previously undetected implausible behaviors, independent of any particular encoding or decoding strategy, reinforcing the role of communication as a fundamental lens through which physically meaningful theories can be identified.

Related papers

• Generalization Bounds of Emergent Communications for Agentic AI Networking [43.00939700354407]
  6G networking toward agentic AI networking (AgentNet) systems requires a shift from traditional data pipelines to task-aware, agentic AI-native communication solutions.<n>This paper introduces a novel emergent communication framework that facilitates collaborative task-solving among heterogeneous agents.
  arXiv  Detail & Related papers  (2026-05-09T02:15:34Z)
• Entanglement assisted communication complexity measured by distinguishability [0.6299766708197883]
  We investigate the quantum advantage that can arise in typical two-party communication scenarios.<n>We show that entanglement-assisted communication, both classical and quantum, can outperform classical communication.
  arXiv  Detail & Related papers  (2026-03-19T16:33:35Z)
• Communication complexity bounds from information causality [0.0]
  Communication complexity quantifies the minimum communication required for distributed computation.<n>We introduce an information-theoretic approach to study one-way communication complexity based solely on the axioms of mutual information.<n>We prove that the extended information causality principle is at least as strong as the principle of non-trivial communication complexity.
  arXiv  Detail & Related papers  (2026-02-10T19:01:02Z)
• The quantum communication power of indefinite causal order [1.8479558716666362]
  We develop a framework that can be used to rigorously assess the role of causal order.<n>In this setting, we establish a clear-cut advantage of indefinite order in the one-shot transmission of classical messages.<n>We also show that the advantage is not generic to all communication tasks.
  arXiv  Detail & Related papers  (2025-10-09T17:42:04Z)
• Rate-Distortion Optimized Communication for Collaborative Perception [47.737814518681326]
  We introduce a pragmatic rate-distortion theory for multi-agent collaboration, specifically formulated to analyze performance-communication trade-off.<n>We propose RDcomm, a communication-efficient collaborative perception framework that introduces two key innovations.<n>Experiments on 3D object detection and BEV segmentation demonstrate that RDcomm achieves state-of-the-art accuracy on DAIR-V2X and OPV2V, while reducing communication volume by up to 108 times.
  arXiv  Detail & Related papers  (2025-09-26T07:21:32Z)
• What Expressivity Theory Misses: Message Passing Complexity for GNNs [51.20749443004513]
  We argue that higher expressivity is not necessary for most real-world tasks as they rarely require expressivity beyond the basic WL test.<n>We propose Message Passing Complexity (MPC), a measure that quantifies the difficulty for a GNN architecture to solve a given task through message passing.<n>MPC captures practical limitations like over-squashing while preserving the theoretical impossibility results from expressivity theory.
  arXiv  Detail & Related papers  (2025-09-01T08:44:49Z)
• Communication Learning in Multi-Agent Systems from Graph Modeling Perspective [62.13508281188895]
  We introduce a novel approach wherein we conceptualize the communication architecture among agents as a learnable graph. We introduce a temporal gating mechanism for each agent, enabling dynamic decisions on whether to receive shared information at a given time.
  arXiv  Detail & Related papers  (2024-11-01T05:56:51Z)
• An Operational Framework for Nonclassicality in Quantum Communication Networks [9.312605205492458]
  entanglement and quantum communication offer significant advantages in distributed information processing.<n>We develop an operational framework for realizing these enhancements in resource-constrained quantum networks.<n>In all cases, we find that entanglement-assisted communication, both classical and quantum, leads to nonclassicality.
  arXiv  Detail & Related papers  (2024-03-05T14:07:37Z)
• PACE: A Pragmatic Agent for Enhancing Communication Efficiency Using Large Language Models [29.016842120305892]
  This paper proposes an image pragmatic communication framework based on a Pragmatic Agent for Communication Efficiency (PACE) using Large Language Models (LLM) PACE sequentially performs semantic perception, intention resolution, and intention-oriented coding. For experimental validation, this paper constructs an image pragmatic communication dataset along with corresponding evaluation standards.
  arXiv  Detail & Related papers  (2024-01-30T06:55:17Z)
• Unbounded quantum advantage in communication complexity measured by distinguishability [0.0]
  We measure the complexity of a task by the minimal distinguishability required to accomplish it.<n>We show that the classical-to-quantum ratio of minimal distinguishability required to achieve the same success metric escalates exponentially.
  arXiv  Detail & Related papers  (2024-01-23T16:48:59Z)
• Exchange-of-Thought: Enhancing Large Language Model Capabilities through Cross-Model Communication [76.04373033082948]
  Large Language Models (LLMs) have recently made significant strides in complex reasoning tasks through the Chain-of-Thought technique. We propose Exchange-of-Thought (EoT), a novel framework that enables cross-model communication during problem-solving.
  arXiv  Detail & Related papers  (2023-12-04T11:53:56Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Quasi-Equivalence Discovery for Zero-Shot Emergent Communication [63.175848843466845]
  We present a novel problem setting and the Quasi-Equivalence Discovery algorithm that allows for zero-shot coordination (ZSC) We show that these two factors lead to unique optimal ZSC policies in referential games. QED can iteratively discover the symmetries in this setting and converges to the optimal ZSC policy.
  arXiv  Detail & Related papers  (2021-03-14T23:42:37Z)

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.