Universal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
arXiv:1801.03692 · doi:10.1007/s11128-019-2358-7
Abstract
We consider the compound memoryless quantum multiple-access channel (QMAC) with two sending terminals. In this model, the transmission is governed by the memoryless extensions of a completely positive and trace preserving map which can be any element of a prescribed set of possible maps. We study a communication scenario, where one of the senders aims for transmission of classical messages while the other sender sends quantum information. Combining powerful universal random coding results for classical and quantum information transmission over point-to-point channels, we establish universal codes for the mentioned two-sender task. Conversely, we prove that the two-dimensional rate region achievable with these codes is optimal. In consequence, we obtain a multi-letter characterization of the capacity region of each compound QMAC for the considered transmission task.
arXiv comment18 pages, 0 figures
References in corpus (22)
- Coding Theorem and Strong Converse for Quantum Channels
- Evenly distributed unitaries: on the structure of unitary designs
- Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
- Quantum state merging and negative information
- Continuity of quantum conditional information
- A decoupling approach to the quantum capacity
- Ultra-high bandwidth quantum secured data transmission
- Secrecy Results for Compound Wiretap Channels
- Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions
- Entanglement-assisted communication of classical and quantum information
- The Capacity of the Quantum Multiple Access Channel
- Generalized relative entropies and the capacity of classical-quantum channels
- Universal coding for classical-quantum channel
- Approximate quantum error correction, random codes, and quantum channel capacity
- Entanglement transmission and generation under channel uncertainty: Universal quantum channel coding
- On Quantum Capacity of Compound Channels
- Coding theorems for compound problems via quantum Rényi divergences
- Polar codes in network quantum information theory
- Secrecy capacities of compound quantum wiretap channels and applications
- Capacity Theorems for Quantum Multiple Access Channels
- Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
- Universal coding for transmission of private information
Cited by in corpus (3)
- Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
- Universal tester for multiple independence testing and classical-quantum arbitrarily varying multiple access channel
- Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding