Facets of Non-locality and Advantage in Entanglement-Assisted Classical Communication Tasks

• URL: http://arxiv.org/abs/2507.10830v1
• Date: Mon, 14 Jul 2025 21:58:07 GMT
• Title: Facets of Non-locality and Advantage in Entanglement-Assisted Classical Communication Tasks
• Authors: Sumit Rout, Anubhav Chaturvedi, Some Sankar Bhattacharya, Paweł Horodecki,
• Abstract summary: We reveal key connections between non-locality and advantage in correlation-assisted classical communication.<n>We introduce wire-reading, which leverages the readability of classical messages to demonstrate advantageous assistance of non-local correlations.<n>We reveal quantum advantage in these tasks, including qutrit over qubit entanglement advantage.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We reveal key connections between non-locality and advantage in correlation-assisted classical communication. First, using the wire-cutting technique, we provide a Bell inequality tailored to any correlation-assisted bounded classical communication task. The violation of this inequality by a quantum correlation is equivalent to its quantum-assisted advantage in the corresponding communication task. Next, we introduce wire-reading, which leverages the readability of classical messages to demonstrate advantageous assistance of non-local correlations in setups where no such advantage can be otherwise observed. Building on this, we introduce families of classical communication tasks in a Bob-without-input prepare-and-measure scenario, where non-local correlation enhances bounded classical communication while shared randomness assistance yields strictly suboptimal payoff. For the first family of tasks, assistance from any non-local facet leads to optimal payoff, while each task in the second family is tailored to a non-local facet. We reveal quantum advantage in these tasks, including qutrit over qubit entanglement advantage.

Related papers

• eQMARL: Entangled Quantum Multi-Agent Reinforcement Learning for Distributed Cooperation over Quantum Channels [98.314893665023]
  Quantum computing has sparked a potential synergy between quantum entanglement and cooperation in multi-agent environments.<n>Current state-of-the-art quantum MARL (QMARL) implementations rely on classical information sharing.<n>eQMARL is a distributed actor-critic framework that facilitates cooperation over a quantum channel.
  arXiv  Detail & Related papers  (2024-05-24T18:43:05Z)
• 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)
• Communication Complexity of Common Randomness Generation with Isotropic States [5.312109949216557]
  The paper considers two communication models -- one-way classical communication and one-way quantum communication. We show that in the case of classical communication, quantum isotropic states have no advantage over noisy classical correlation. In the case of quantum communication, we demonstrate that the common randomness rate can be increased by using superdense coding on quantum isotropic states.
  arXiv  Detail & Related papers  (2023-11-08T14:48:15Z)
• Hierarchical certification of nonclassical network correlations [50.32788626697182]
  We derive linear and nonlinear Bell-like inequalities for networks, whose violation certifies the absence of a minimum number of classical sources in them. We insert this assumption, which leads to results more amenable to certification in experiments.
  arXiv  Detail & Related papers  (2023-06-27T18:00:01Z)
• Advantage of Hardy's Nonlocal Correlation in Reverse Zero-Error Channel Coding [0.0]
  Hardy's argument constitutes an elegant proof of quantum nonlocality. We apply Hardy's nonlocal correlations in two-party communication setup.
  arXiv  Detail & Related papers  (2023-03-13T04:36:46Z)
• Entangled Rendezvous: A Possible Application of Bell Non-Locality For Mobile Agents on Networks [0.0]
  We analyze, how Bell non-locality can be used by asymmetric location-aware agents trying to rendezvous on a finite network with a limited number of steps. Our results show that for cubic graphs and cycles it is possible to gain an advantage by allowing the agents to use assistance of entangled quantum states.
  arXiv  Detail & Related papers  (2022-07-28T23:04:48Z)
• Communication Efficient Distributed Learning for Kernelized Contextual Bandits [58.78878127799718]
  We tackle the communication efficiency challenge of learning kernelized contextual bandits in a distributed setting. We consider non-linear reward mappings, by letting agents collaboratively search in a reproducing kernel Hilbert space. We rigorously proved that our algorithm can attain sub-linear rate in both regret and communication cost.
  arXiv  Detail & Related papers  (2022-06-10T01:39:15Z)
• Classical analogue of quantum superdense coding and communication advantage of a single quantum system [0.0]
  We show that a qubit communication without any assistance of classical shared randomness can achieve the goal. We also study communication utility of a class of non-classical toy systems described by symmetric polygonal state spaces.
  arXiv  Detail & Related papers  (2022-02-14T15:29:59Z)
• Finite-Time Consensus Learning for Decentralized Optimization with Nonlinear Gossiping [77.53019031244908]
  We present a novel decentralized learning framework based on nonlinear gossiping (NGO), that enjoys an appealing finite-time consensus property to achieve better synchronization. Our analysis on how communication delay and randomized chats affect learning further enables the derivation of practical variants.
  arXiv  Detail & Related papers  (2021-11-04T15:36:25Z)
• 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)
• Information Causality without concatenation [0.5043455303941253]
  Information Causality is a physical principle which states that the amount of randomly accessible data over a classical communication channel cannot exceed its capacity. We show that concatenation can be successfully replaced by limits on the communication channel capacity.
  arXiv  Detail & Related papers  (2021-01-29T18:05:40Z)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

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.