On the strong converses for the quantum channel capacity theorems

Abstract

A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum information transfer with error exponents and novel explicit upper bounds on the fidelity measures reminiscent of the Wolfowitz strong converse for the classical channel capacity theorems. We provide a new proof for the error exponents for the classical information transfer. A long standing problem in quantum information theory has been to find out the strong converse for the channel capacity theorem when quantum information is sent across the channel. We give the quantum error exponent thereby giving a one-shot exponential upper bound on the fidelity. We then apply our results to show that the strong converse holds for the quantum information transfer across an erasure channel for maximally entangled channel inputs.

Added the strong converse for the erasure channel for maximally entangled inputs and corrected minor typos

References in corpus (18)

• Mixed State Entanglement and Quantum Error Correction
• The capacity of the noisy quantum channel
• Quantum data processing and error correction
• Superadditivity of communication capacity using entangled inputs
• The Quantum Chernoff Bound
• Coding Theorem and Strong Converse for Quantum Channels
• Information transmission through a noisy quantum channel
• Codes for the Quantum Erasure Channel
• Capacities of Quantum Erasure Channels
• On Quantum Fidelities and Channel Capacities
• Strong Converse to the Quantum Channel Coding Theorem
• Quantum f-divergences and error correction
• Monotone Riemannian Metrics and Relative Entropy on Non-Commutative Probability Spaces
• A strong converse for classical channel coding using entangled inputs
• Extreme points of the set of density matrices with positive partial transpose
• Random quantum codes from Gaussian ensembles and an uncertainty relation
• The invalidity of a strong capacity for a quantum channel with memory
• Extensions of the quantum Fano inequality

Cited by in corpus (55)

• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• Sandwiched Rényi Divergence Satisfies Data Processing Inequality
• Approaches for approximate additivity of the Holevo information of quantum channels
• Finite blocklength converse bounds for quantum channels
• Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
• Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
• Strong converse exponent for classical-quantum channel coding
• Relating different quantum generalizations of the conditional Renyi entropy
• Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity
• Renyi generalizations of the conditional quantum mutual information
• Universal Limitations on Quantum Key Distribution over a Network
• Principles of Quantum Communication Theory: A Modern Approach
• Entanglement Cost of Quantum Channels
• Quantum Sphere-Packing Bounds with Polynomial Prefactors
• Extendibility limits the performance of quantum processors
• Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
• Rényi squashed entanglement, discord, and relative entropy differences
• Estimating distinguishability measures on quantum computers
• On Composite Quantum Hypothesis Testing
• The Renyi Capacity and Center
• Rényi generalizations of quantum information measures
• "Pretty strong" converse for the quantum capacity of degradable channels
• Non-Asymptotic Classical Data Compression with Quantum Side Information
• Bregman divergence based em algorithm and its application to classical and quantum rate distortion theory
• Optimal estimation and discrimination of excess noise in thermal and amplifier channels
• Resource theory of unextendibility and non-asymptotic quantum capacity
• Properties of Noncommutative Renyi and Augustin Information
• Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
• Quantum realism: axiomatization and quantification
• Communication Cost of Quantum Processes
• Refined Strong Converse for the Constant Composition Codes
• Reliability Function of Classical-Quantum Channels
• A hierarchy of efficient bounds on quantum capacities exploiting symmetry
• Strong Converse for Classical-Quantum Degraded Broadcast Channels
• Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing
• Tight lower bound on the error exponent of classical-quantum channels
• Quantum Network Discrimination
• Inevitability of knowing less than nothing
• Achievable error exponents of data compression with quantum side information and communication over symmetric classical-quantum channels
• Equivocations, Exponents and Second-Order Coding Rates under Various Rényi Information Measures
• Generalized Holevo theorem and distinguishability notions
• Strong converse for the quantum capacity of the erasure channel for almost all codes
• A strong converse for the quantum state merging protocol
• Local Invariance of Divergence-based Quantum Information Measures
• An upper bound on quantum capacity of unital channels
• Classical communication cost of a bipartite quantum channel assisted by non-signalling correlations
• Squashed quantum non-Markovianity: a measure of genuine quantum non-Markovianity in states
• Universal tester for multiple independence testing and classical-quantum arbitrarily varying multiple access channel
• A fixed-point algorithm for matrix projections with applications in quantum information
• Information storage and transmission under Markovian noise
• Permutation Enhances Classical Communication Assisted by Entangled States
• An additive refinement of quantum channel capacities