Entanglement-assisted capacities of compound quantum channels

Abstract

We study universal quantum codes for entanglement-assisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the set that the channel is selected from. We investigate different variations of the problem: uninformed users, informed receiver, informed sender, and feedback assistance. We derive single-letter formulas for all corresponding channel capacities. Our proofs are based on one-shot decoupling bounds and properties of smooth entropies.

16 pages

References in corpus (5)

• Quantum information can be negative
• The mother of all protocols: Restructuring quantum information's family tree
• Coding Theorem for a Class of Quantum Channels with Long-Term Memory
• Tight continuity bounds for the quantum conditional mutual information, for the Holevo quantity and for capacities of quantum channels
• On Quantum Capacity of Compound Channels

Cited by in corpus (4)

• Classical-Quantum Arbitrarily Varying Wiretap Channel: Secret Message Transmission under Jamming Attacks
• Quantum-enabled communication without a phase reference
• A hypothesis testing approach for communication over entanglement assisted compound quantum channel
• Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks