Coding for quantum channels with side information at the transmitter

Abstract

We consider the problem of coding for quantum channels with side information that is available ahead of time at the transmitter but not at the receiver. We find a single-letter expression for the entanglement-assisted quantum capacity of such channels which closely parallels Gel'fand and Pinsker's solution to the classical version of the same problem. This theorem can also be used to find a lower bound on the unassisted quantum capacity of these channels.

11 pages

References in corpus (12)

• Distillation of secret key and entanglement from quantum states
• Correcting Quantum Errors with Entanglement
• Coding Theorem and Strong Converse for Quantum Channels
• Quantum state merging and negative information
• The mother of all protocols: Restructuring quantum information's family tree
• A Resource Framework for Quantum Shannon Theory
• The exact cost of redistributing multipartite quantum states
• General entanglement-assisted quantum error-correcting codes
• Catalytic quantum error correction
• Quantum broadcast channels
• A father protocol for quantum broadcast channels
• State redistribution as merging: introducing the coherent relay

Cited by in corpus (8)

• The decoupling approach to quantum information theory
• One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
• A decoupling approach to classical data transmission over quantum channels
• On the near-optimality of one-shot classical communication over quantum channels
• The Classical-Quantum Channel with Random State Parameters Known to the Sender
• Secure communication over fully quantum Gel'fand-Pinsker wiretap channel
• Entanglement-Assisted Capacity of Quantum Channels with Side Information
• Classical State Masking over a Quantum Channel