Strong converse exponent for classical-quantum channel coding

Abstract

We determine the exact strong converse exponent of classical-quantum channel coding, for every rate above the Holevo capacity. Our form of the exponent is an exact analogue of Arimoto's, given as a transform of the Renyi capacities with parameters alpha>1. It is important to note that, unlike in the classical case, there are many inequivalent ways to define the Renyi divergence of states, and hence the Rényi capacities of channels. Our exponent is in terms of the Renyi capacities corresponding to a version of the Renyi divergences that has been introduced recently in [Müller-Lennert, Dupuis, Szehr, Fehr and Tomamichel, J. Math. Phys. 54, 122203, (2013)], and [Wilde, Winter, Yang, Commun. Math. Phys. 331, (2014)]. Our result adds to the growing body of evidence that this new version is the natural definition for the purposes of strong converse problems.

v6: New section on entanglement breaking, and covariant channels. v7: Added Appendix B on the concavity of various versions of the auxiliary function. v8: Updated references

References in corpus (12)

• Coding Theorem and Strong Converse for Quantum Channels
• Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
• Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
• Fundamental bound on the reliability of quantum information transmission
• On the strong converses for the quantum channel capacity theorems
• Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
• Strong converse exponent for classical-quantum channel coding
• On Variational Expressions for Quantum Relative Entropies
• The Converse Part of The Theorem for Quantum Hoeffding Bound
• Two approaches to obtain the strong converse exponent of quantum hypothesis testing for general sequences of quantum states
• On the Concavity of Auxiliary Function in Classical-Quantum Channels
• Beyond i.i.d. in Quantum Information Theory

Cited by in corpus (48)

• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
• Strong converse exponent for classical-quantum channel coding
• Quantum secure direct communication with private dense coding using general preshared quantum state
• Rényi divergences as weighted non-commutative vector valued $L_p$-spaces
• Rényi relative entropies and noncommutative $L_p$-spaces
• Quantum Sphere-Packing Bounds with Polynomial Prefactors
• Preservation of a quantum Renyi relative entropy implies existence of a recovery map
• The Renyi Capacity and Center
• Defining quantum divergences via convex optimization
• Non-Asymptotic Classical Data Compression with Quantum Side Information
• Encoding classical information into quantum resources
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification
• Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions
• Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
• Chain rules for quantum Rényi entropies
• Computable Rényi mutual information: Area laws and correlations
• On the mass of static metrics with positive cosmological constant -- II
• Quantum reverse hypercontractivity: its tensorization and application to strong converses
• Properties of Noncommutative Renyi and Augustin Information
• Strong converse exponents for the feedback-assisted classical capacity of entanglement-breaking channels
• Moderate deviation expansion for fully quantum tasks
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
• Test-measured Rényi divergences
• On the error exponents of binary state discrimination with composite hypotheses
• Refined Strong Converse for the Constant Composition Codes
• Some continuity properties of quantum Rényi divergences
• Duality between source coding with quantum side information and c-q channel coding
• Reliability Function of Classical-Quantum Channels
• Geometric relative entropies and barycentric Rényi divergences
• An invitation to the sample complexity of quantum hypothesis testing
• Quantum Rényi divergences and the strong converse exponent of state discrimination in operator algebras
• Reliability Function of Quantum Information Decoupling via the Sandwiched Rényi Divergence
• Decomposition Rules for Quantum Rényi Mutual Information with an Application to Information Exclusion Relations
• Reliable Simulation of Quantum Channels: the Error Exponent
• Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing
• Tight lower bound on the error exponent of classical-quantum channels
• Multivariate Fidelities
• Lower Bounds on Error Exponents via a New Quantum Decoder
• Quantum Aitchison geometry
• Strong Converse Exponent for Entanglement-Assisted Communication
• Sphere-Packing Bound for Symmetric Classical-Quantum Channels
• Analytical calculation formulas for capacities of classical and classical-quantum channels
• Sufficiency of Rényi divergences
• Maps on positive operators preserving Rényi type relative entropies and maximal $f$-divergences
• Minimizing Quantum Renyi Divergences via Mirror Descent with Polyak Step Size
• Rényi divergence inequalities via interpolation, with applications to generalised entropic uncertainty relations
• Log-majorizations between quasi-geometric type means for matrices