The Multiple-Access Channel with Entangled Transmitters

• URL: http://arxiv.org/abs/2303.10456v6
• Date: Wed, 10 Apr 2024 18:29:12 GMT
• Title: The Multiple-Access Channel with Entangled Transmitters
• Authors: Uzi Pereg, Christian Deppe, Holger Boche,
• Abstract summary: 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.
• Score: 67.92544792239086
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Communication over a classical multiple-access channel (MAC) with entanglement resources is considered, whereby two transmitters share entanglement resources a priori before communication begins. Leditzky et al. (2020) presented an example of a classical MAC, defined in terms of a pseudo telepathy game, such that the sum rate with entangled transmitters is strictly higher than the best achievable sum rate without such resources. Here, we establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters, and show that the previous result can be obtained as a special case. It has long been known that the capacity region of the classical MAC under a message-average error criterion can be strictly larger than with a maximal error criterion (Dueck, 1978). We observe that given entanglement resources, the regions coincide. Furthermore, we address the combined setting of entanglement resources and conferencing, where the transmitters can also communicate with each other over rate-limited links. Using superdense coding, entanglement can double the conferencing rate.

Related papers

• Coordination Capacity for Classical-Quantum Correlations [16.025002076222002]
  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.
  arXiv  Detail & Related papers  (2024-04-28T19:47:24Z)
• Learning Resilient Radio Resource Management Policies with Graph Neural Networks [124.89036526192268]
  We formulate a resilient radio resource management problem with per-user minimum-capacity constraints. We show that we can parameterize the user selection and power control policies using a finite set of parameters. Thanks to such adaptation, our proposed method achieves a superior tradeoff between the average rate and the 5th percentile rate.
  arXiv  Detail & Related papers  (2022-03-07T19:40:39Z)
• The Quantum Multiple-Access Channel with Cribbing Encoders [78.7611537027573]
  Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered. Based on the no-cloning theorem, perfect cribbing is impossible. A partial decode-forward region is derived for a quantum MAC with non-robust cribbing.
  arXiv  Detail & Related papers  (2021-11-30T17:31:48Z)
• Computable limits of optical multiple-access communications [1.14219428942199]
  Communication rates over quantum channels can be boosted by entanglement. Superadditivity refers to the capacity improvement from entangling inputs across multiple channel uses. We show that entanglement-assisted capacity of a single-sender and single-receiver channel is additive.
  arXiv  Detail & Related papers  (2021-10-04T19:27:59Z)
• 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)
• Entanglement-Assisted Communication Surpassing the Ultimate Classical Capacity [2.8453697351728438]
  Entanglement-assisted communication (EACOMM) leverages entanglement pre-shared by communication parties to boost the rate of classical information transmission. We show that EACOMM beats the Holevo-Schumacher-Westmoreland capacity of classical communication by up to 14.6%. Our work opens a route to provable quantum advantages in a wide range of quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-01-19T06:41:09Z)
• Capacities of Gaussian Quantum Channels with Passive Environment Assistance [0.0]
  Passive environment assisted communication takes place via a quantum channel modeled as a unitary interaction between the information carrying system and an environment. We consider both quantum communication and classical communication with helper, as well as classical communication with free classical coordination between sender and helper.
  arXiv  Detail & Related papers  (2021-01-03T10:33:43Z)
• Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters [78.7611537027573]
  Communication over a quantum broadcast channel with cooperation between the receivers is considered. We develop lower and upper bounds on the capacity region in each setting.
  arXiv  Detail & Related papers  (2020-11-18T11:58: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.