Playing Games with Multiple Access Channels

09/05/2019
by   Felix Leditzky, et al.
0

Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station. The optimal performance of a MAC is quantified by a capacity region of simultaneously achievable communication rates. We study the two-sender classical MAC, the simplest and best-understood network, and find a surprising richness in both a classical and quantum context. First, we find that quantum entanglement shared between senders can substantially boost the capacity of a classical MAC. Second, we find that optimal performance of a MAC with bounded-size inputs may require unbounded amounts of entanglement. Third, determining whether a perfect communication rate is achievable using finite-dimensional entanglement is undecidable. Finally, we show that evaluating the capacity region of a two-sender classical MAC is in fact NP-hard.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

01/28/2021

Entanglement-assisted multiple-access channels: capacity regions and protocol designs

We solve the entanglement-assisted (EA) classical capacity region of qua...
05/30/2021

Computation-aided classical-quantum multiple access to boost network communication speeds

A multiple access channel (MAC) consists of multiple senders simultaneou...
12/08/2018

The Simultaneous Identification Capacity of the Classical--Quantum Multiple Access Channel

Here we discuss message identification, a problem formalized by Rudolf A...
05/03/2022

A Model of Random Multiple Access in Unlicensed Spectrum Systems

We consider a classical multiple access system with a single transmissio...
01/28/2022

Private Classical Communication over Quantum Multiple-Access Channels

We study private classical communication over quantum multiple-access ch...
10/24/2018

Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks

We derive universal codes for simultaneous transmission of classical mes...
06/22/2022

Beating the Sum-Rate Capacity of the Binary Adder Channel with Non-Signaling Correlations

We address the problem of coding for multiple-access channels (MACs) wit...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.