Private Classical Communication over Quantum Multiple-Access Channels

01/28/2022
by   Remi A. Chou, et al.
0

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a single-letter expression for the best achievable sum-rate and prove that this quantity also corresponds to the best achievable sum-rate for quantum communication over degradable quantum multiple-access channels. In our achievability result, we decouple the reliability and privacy constraints, which are handled via source coding with quantum side information and universal hashing, respectively. Hence, we also establish that the multi-user coding problem under consideration can be handled solely via point-to-point coding techniques. As a by-product of independent interest, we derive a distributed leftover hash lemma against quantum side information that ensures privacy in our achievability result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2018

Universal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender

We consider the compound memoryless quantum multiple-access channel (QMA...
research
11/01/2020

Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding

We derive universal classical-quantum superposition coding and universal...
research
01/03/2021

Capacities of Gaussian Quantum Channels with Passive Environment Assistance

Passive environment assisted communication takes place via a quantum cha...
research
05/21/2021

Unified Expression of Achievable Region in Privacy-Constrained Source Coding

Privacy-constrained source coding problems have become increasingly impo...
research
07/22/2019

Achievable Rate Region for Iterative Multi-User Detection via Low-cost Gaussian Approximation

We establish a multi-user extrinsic information transfer (EXIT) chart ar...
research
09/05/2019

Playing Games with Multiple Access Channels

Communication networks have multiple users, each sending and receiving m...
research
05/30/2021

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

A multiple access channel (MAC) consists of multiple senders simultaneou...

Please sign up or login with your details

Forgot password? Click here to reset