.png){kind=icon}
.png){kind=icon}
Return
Playing games with multiple access channels
.png){kind=icon}
OA
AI
DOI：10.1038/s41467-020-15240-w.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. Multiple access channels model communication from multiple independent senders to a common receiver. By drawing a connection to the study of classical and quantum correlations using nonlocal games, Leditzky et al. reveal remarkably complex behaviour of the entanglement-assisted and unassisted information transmission capabilities of a multiple access channel.
Keywords:
QUANTUM
ENTANGLEMENT
CAPACITY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
15.7
Papers:
9.3W
Citations:
91.2W
