The classical-quantum channel with random state parameters known to the sender

DOI10.1088/1751-8113/49/19/195302MaRDI QIDQ2991895zbMATH OpenOpenAlexFDO

Authors Holger Boche, Ning Cai, Janis Nötzel

Publication date 10 August 2016

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.06479

zbMATH Keywords

message transmissionchannel statecausal channel state knowledgenon-causal channel state knowledgestate knowledge

Mathematics Subject Classification ID

Vector-valued measures and integration (46G10) Operator spaces and completely bounded maps (46L07) Quantum measurement theory, state operations, state preparations (81P15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40) Quantum channels, fidelity (81P47)

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.

Recommendations

• A note on random coding bounds for classical-quantum channels
• Classical-Quantum Arbitrarily Varying Wiretap Channel
• Message transmission over classical quantum channels with a jammer with side information: correlation as resource, common randomness generation
• The capacity of a quantum channel for simultaneous transmission of classical and quantum information
• On Converse Bounds for Classical Communication Over Quantum Channels
• On the classical capacity of a channel with stationary quantum Gaussian noise
• Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
• Classical Capacity of Classical-Quantum Arbitrarily Varying Channels
• Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources
• Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels

Cited in

(4)

• General formulas for capacity of classical-quantum channels
• Union bound for quantum information processing
• The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel
• Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity

This page was built for publication: The classical-quantum channel with random state parameters known to the sender

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2991895)