The Classical-Quantum Channel with Random State Parameters Known to the Sender
arXiv:1506.06479 · doi:10.1088/1751-8113/49/19/195302
Abstract
We study an analog of the well-known Gel'fand Pinsker Channel which uses quantum states for the transmission of the data. We consider the case where both the sender's inputs to the channel and the channel states are to be taken from a finite set (cq-channel with state information at the sender). We distinguish between causal and non-causal channel state information at the sender. The receiver remains ignorant, throughout. We give a single-letter description of the capacity in the first case. In the second case we present two different regularized expressions for the capacity. It is an astonishing and unexpected result of our work that a simple change from causal to non-causal channel state information at the encoder causes the complexity of a numerical computation of the capacity formula to change from trivial to seemingly difficult. Still, even the non-single letter formula allows one to draw nontrivial conclusions, for example regarding continuity of the capacity with respect to changes in the system parameters. The direct parts of both coding theorems are based on a special class of POVMs which are derived from orthogonal projections onto certain representations of the symmetric groups. This approach supports a reasoning that is inspired by the classical method of types. In combination with the non-commutative union bound these POVMs yield an elegant method of proof for the direct part of the coding theorem in the first case.
arXiv comment26 pages, no figures. Many typos corrected. More details added to the proofs. Added proof for the direct part of capacity theorem for causal encoding
References in corpus (15)
- Superadditivity of communication capacity using entangled inputs
- Information transmission through a noisy quantum channel
- Quantum Communication With Zero-Capacity Channels
- Quantum Channels with Memory
- Estimating the spectrum of a density operator
- The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography
- Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
- Quantum channels with a finite memory
- Applications of coherent classical communication and the Schur transform to quantum information theory
- Quantum union bounds for sequential projective measurements
- Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding
- Hypothesis Testing on Invariant Subspaces of the Symmetric Group, Part I - Quantum Sanov's Theorem and Arbitrarily Varying Sources
- Classical capacity of quantum channels with general Markovian correlated noise
- Coding for quantum channels with side information at the transmitter
- A solution to two party typicality using representation theory of the symmetric group
Cited by in corpus (6)
- Union bound for quantum information processing
- Broadcast Classical-Quantum Capacity Region of Two-Phase Bidirectional Relaying Channel
- Entanglement-Assisted Capacity of Quantum Channels with Side Information
- Quantum Channel Masking
- Classical State Masking over a Quantum Channel
- A class of permutation-invariant measurements and their relation to quantum relative entropies