Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy
arXiv:1801.04572 · doi:10.1109/ISIT.2018.8437610
Abstract
We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer systems, we show, using permutation symmetry and a de Finetti reduction, how the random coding capacity (classical and quantum) of the QAVC is reduced to the capacity of a naturally associated compound channel, which is obtained by restricting the jammer to i.i.d. input states. Furthermore, we demonstrate that the shared randomness required is at most logarithmic in the block length, using a random matrix tail bound. This implies a dichotomy theorem: either the classical capacity of the QAVC is zero, and then also the quantum capacity is zero, or each capacity equals its random coding variant.
arXiv comment5 pages, ISIT format (IEEEtra.cls)
References in corpus (11)
- Randomizing quantum states: Constructions and applications
- Post-selection technique for quantum channels with applications to quantum cryptography
- Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
- Semidefinite programs for completely bounded norms
- Entanglement transmission and generation under channel uncertainty: Universal quantum channel coding
- Quantum Channel Capacities with Passive Environment Assistance
- Classical capacities of quantum channels with environment assistance
- Coding theorems for compound problems via quantum Rényi divergences
- Secure and Robust Identification via Classical-Quantum Channels
- On zero-error communication via quantum channels in the presence of noiseless feedback
- Strong Converse for Identification via Quantum Channels