On Quantum Capacity of Compound Channels

Abstract

In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical information theory. We determine the quantum capacity of finite compound channels and arbitrary compound channels with informed decoder. Our approach in the finite case is based on the observation that perfect channel knowledge at the decoder does not increase the capacity of finite quantum compound channels. As a consequence we obtain coding theorem for finite quantum averaged channels, the simplest class of channels with long-term memory. The extension of these results to quantum compound channels with uninformed encoder and decoder, and infinitely many constituents remains an open problem.

16 pages, no figures

References in corpus (10)

• The capacity of the noisy quantum channel
• Coding Theorem and Strong Converse for Quantum Channels
• Information transmission through a noisy quantum channel
• On Quantum Fidelities and Channel Capacities
• Strong Converse to the Quantum Channel Coding Theorem
• A decoupling approach to the quantum capacity
• On entanglement-assisted classical capacity
• Universal Quantum Information Compression
• Coding Theorem for a Class of Quantum Channels with Long-Term Memory
• Approximate quantum error correction, random codes, and quantum channel capacity

Cited by in corpus (19)

• One-shot entanglement-assisted quantum and classical communication
• Private information via the Unruh effect
• Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
• Entanglement transmission and generation under channel uncertainty: Universal quantum channel coding
• Polar codes in network quantum information theory
• Hypothesis Testing on Invariant Subspaces of the Symmetric Group, Part I - Quantum Sanov's Theorem and Arbitrarily Varying Sources
• Quantum capacity of an amplitude-damping channel with memory
• Universal quantum state merging
• Polar codes in quantum information theory
• Entanglement-assisted capacities of compound quantum channels
• 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
• Universal coding for transmission of private information
• Universal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
• Heralded Channel Holevo Superadditivity Bounds from Entanglement Monogamy
• Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
• Entanglement Transmission Capacity of Compound Channels
• Classical capacities of memoryless but not identical quantum channels
• Entanglement Transmission over Arbitrarily Varying Quantum Channels