A strong converse for classical channel coding using entangled inputs

Abstract

A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of channel uses, even when we allow code states which are entangled across several uses of the channel. Such a statement was previously only known for classical channels and the quantum identity channel. By relating the problem to the additivity of minimum output entropies, we show that a strong converse holds for a large class of channels, including all unital qubit channels, the d-dimensional depolarizing channel and the Werner-Holevo channel. This further justifies the interpretation of the classical capacity as a sharp threshold for information-transmission.

9 pages, revtex

References in corpus (2)

• Coding Theorem and Strong Converse for Quantum Channels
• Cryptography from Noisy Storage

Cited by in corpus (60)

• Quantum Resource Theories
• On quantum Renyi entropies: a new generalization and some properties
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Quantum channels and memory effects
• Quantum Reverse Shannon Theorem
• Unconditional security from noisy quantum storage
• On the quantum Renyi relative entropies and related capacity formulas
• Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
• On the strong converses for the quantum channel capacity theorems
• Fundamental bound on the reliability of quantum information transmission
• Finite blocklength converse bounds for quantum channels
• Theory for Equivariant Quantum Neural Networks
• Strong converse exponent for classical-quantum channel coding
• Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity
• Renyi generalizations of the conditional quantum mutual information
• Principles of Quantum Communication Theory: A Modern Approach
• Entanglement Cost of Quantum Channels
• Application of the Resource Theory of Channels to Communication Scenarios
• Semidefinite programming strong converse bounds for classical capacity
• Strong converse rates for quantum communication
• The structure of Renyi entropic inequalities
• More non-locality with less entanglement
• Semidefinite programming relaxations for quantum correlations
• Implementation of two-party protocols in the noisy-storage model
• A smooth entropy approach to quantum hypothesis testing and the classical capacity of quantum channels
• Semidefinite programming converse bounds for quantum communication
• Simple Protocols for Oblivious Transfer and Secure Identification in the Noisy-Quantum-Storage Model
• Passive states optimize the output of bosonic Gaussian quantum channels
• Testing product states, quantum Merlin-Arthur games and tensor optimisation
• Strong converse theorems using Rényi entropies
• Rényi generalizations of quantum information measures
• "Pretty strong" converse for the quantum capacity of degradable channels
• The Renyi Capacity and Center
• Structure of irreducibly covariant quantum channels for finite groups
• Renyi relative entropies of quantum Gaussian states
• Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions
• Strong converse for the classical capacity of the pure-loss bosonic channel
• Coding theorems for compound problems via quantum Rényi divergences
• Sandwiched Rényi Convergence for Quantum Evolutions
• Reversibility of quantum resources through probabilistic protocols
• Strong converse exponents for the feedback-assisted classical capacity of entanglement-breaking channels
• Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
• Strong converse rates for classical communication over thermal and additive noise bosonic channels
• The platypus of the quantum channel zoo
• Achieving the physical limits of the bounded-storage model
• Quantifying quantumness of correlations using Gaussian Rényi-2 entropy in optomechanical interfaces
• The invalidity of a strong capacity for a quantum channel with memory
• Temperley-Lieb quantum channels
• Refined Strong Converse for the Constant Composition Codes
• Group-covariant extreme and quasi-extreme channels
• Reliability Function of Classical-Quantum Channels
• Error-tolerant oblivious transfer in the noisy-storage model
• Strong converse for the classical capacity of optical quantum communication channels
• Universal coding for transmission of private information
• Enhancing phase-covariant channel performance with non-unitality
• Random covariant quantum channels
• Strong converse for the quantum capacity of the erasure channel for almost all codes
• A strong converse for the quantum state merging protocol
• Entropy of quantum channel in the theory of quantum information
• The strong converse theorem for the product-state capacity of quantum channels with ergodic Markovian memory