Coordination Capacity for Classical-Quantum Correlations

• URL: http://arxiv.org/abs/2404.18297v1
• Date: Sun, 28 Apr 2024 19:47:24 GMT
• Title: Coordination Capacity for Classical-Quantum Correlations
• Authors: Hosen Nator, Uzi Pereg,
• Abstract summary: Network coordination is considered in three basic settings. We consider the simulation of a classical-quantum state between two nodes with rate-limited common randomness (CR) and communication. At last, we consider a broadcast setting, where a sender and two receivers simulate a classical-quantum-quantum state using rate-limited CR and communication.
• Score: 16.025002076222002
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Network coordination is considered in three basic settings, characterizing the generation of separable and classical-quantum correlations among multiple parties. First, we consider the simulation of a classical-quantum state between two nodes with rate-limited common randomness (CR) and communication. Furthermore, we study the preparation of a separable state between multiple nodes with rate-limited CR and no communication. At last, we consider a broadcast setting, where a sender and two receivers simulate a classical-quantum-quantum state using rate-limited CR and communication. We establish the optimal tradeoff between communication and CR rates in each setting.

Related papers

• Bidirectional classical communication cost of a bipartite quantum channel assisted by non-signalling correlations [6.1108095842541]
  This paper investigates the bidirectional classical communication cost of simulating a bipartite quantum channel assisted by non-signalling correlations. We derive semidefinite programming (SDP) formulations for the one-shot exact bidirectional classical communication cost via non-signalling bipartite superchannels. Our results elucidate the role of non-locality in quantum communication and pave the way for exploring quantum reverse Shannon theory in bipartite scenarios.
  arXiv  Detail & Related papers  (2024-08-05T14:30:50Z)
• 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. Current state-of-the-art quantum MARL (QMARL) implementations rely on classical information sharing. eQMARL is a distributed actor-critic framework that facilitates cooperation over a quantum channel.
  arXiv  Detail & Related papers  (2024-05-24T18:43:05Z)
• Entanglement Coordination Rates in Multi-User Networks [16.025002076222002]
  The optimal coordination rates are determined in three primary settings of multi-user quantum networks. We show the implications of our results on nonlocal games with quantum strategies.
  arXiv  Detail & Related papers  (2024-03-18T15:53:30Z)
• Operational Nonclassicality in Quantum Communication Networks [9.312605205492458]
  We apply an operational framework for witnessing quantum nonclassicality in communication networks. We demonstrate nonclassicality in many basic networks such as entanglement-assisted point-to-point and multi-point channels. Our approaches could be implemented on quantum networking hardware and used to automatically establish certain protocols.
  arXiv  Detail & Related papers  (2024-03-05T14:07:37Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered. We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters. Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• 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)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Concurrence Percolation in Quantum Networks [3.52359746858894]
  We introduce a new statistical theory, concurrence percolation theory (ConPT) We find that the entanglement transmission threshold predicted by ConPT is lower than the known classical-percolation-based results. ConPT also shows a percolation-like universal critical behavior derived by finite-size analysis on the Bethe lattice.
  arXiv  Detail & Related papers  (2021-03-25T17:14:48Z)
• 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.