Coding theorems for compound problems via quantum Rényi divergences

Abstract

Recently, a new notion of quantum Rényi divergences has been introduced by Müller-Lennert, Dupuis, Szehr, Fehr and Tomamichel, J.Math.Phys. 54:122203, (2013), and Wilde, Winter, Yang, Commun.Math.Phys. 331:593--622, (2014), that has found a number of applications in strong converse theorems. Here we show that these new Rényi divergences are also useful tools to obtain coding theorems in the direct domain of various problems. We demonstrate this by giving new and considerably simplified proofs for the achievability parts of Stein's lemma with composite null hypothesis, universal state compression, and the classical capacity of compound classical-quantum channels, based on single-shot error bounds already available in the literature, and simple properties of the quantum Rényi divergences. The novelty of our proofs is that the composite/compound coding theorems can be almost directly obtained from the single-shot error bounds, with essentially the same effort as for the case of simple null-hypothesis/single source/single channel.

v4: 16 pages, accepted for publication in IEEE Transactions on Information Theory

References in corpus (17)

• On quantum Renyi entropies: a new generalization and some properties
• The Quantum Chernoff Bound
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Coding Theorem and Strong Converse for Quantum Channels
• Sandwiched Rényi Divergence Satisfies Data Processing Inequality
• Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
• Quantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
• Coding Theorem for a Class of Quantum Channels with Long-Term Memory
• Generalized relative entropies and the capacity of classical-quantum channels
• A Minkowski Type Trace Inequality and Strong Subadditivity of Quantum Entropy II: Convexity and Concavity
• Error exponents in hypothesis testing for correlated states on a spin chain
• A limit of the quantum Renyi divergence
• Quantum state discrimination bounds for finite sample size
• Hypothesis testing for Gaussian states on bosonic lattices
• Typical support and Sanov large deviations of correlated states
• Hypothesis Testing on Invariant Subspaces of the Symmetric Group, Part I - Quantum Sanov's Theorem and Arbitrarily Varying Sources
• Asymptotic distinguishability measures for shift-invariant quasi-free states of fermionic lattice systems

Cited by in corpus (17)

• Strong converse exponent for classical-quantum channel coding
• Applications of position-based coding to classical communication over quantum channels
• Pretty good measures in quantum information theory
• Computable Rényi mutual information: Area laws and correlations
• Secure and Robust Identification via Classical-Quantum Channels
• Properties of Noncommutative Renyi and Augustin Information
• Two approaches to obtain the strong converse exponent of quantum hypothesis testing for general sequences of quantum states
• Classical-Quantum Arbitrarily Varying Wiretap Channel: Secret Message Transmission under Jamming Attacks
• Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy
• Fault-tolerant Coding for Quantum Communication
• On the error exponents of binary state discrimination with composite hypotheses
• A hypothesis testing approach for communication over entanglement assisted compound quantum channel
• Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks
• Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
• Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
• Universal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
• On the minimum output entropy of random orthogonal quantum channels