Quantum Achievability Proof via Collision Relative Entropy
arXiv:1312.3822 · doi:10.1109/TIT.2014.2361632
Abstract
In this paper, we provide a simple framework for deriving one-shot achievable bounds for some problems in quantum information theory. Our framework is based on the joint convexity of the exponential of the collision relative entropy, and is a (partial) quantum generalization of the technique of Yassaee et al. (2013) from classical information theory. Based on this framework, we derive one-shot achievable bounds for the problems of communication over classical-quantum channels, quantum hypothesis testing, and classical data compression with quantum side information. We argue that our one-shot achievable bounds are strong enough to give the asymptotic achievable rates of these problems even up to the second order.
arXiv comment12 pages
References in corpus (17)
- 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
- Coding Theorem and Strong Converse for Quantum Channels
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- One-Shot Classical-Quantum Capacity and Hypothesis Testing
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- Sandwiched Rényi Divergence Satisfies Data Processing Inequality
- Monotonicity of a relative Rényi entropy
- Second-order asymptotics for quantum hypothesis testing
- One-shot decoupling
- Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing
- Classical data compression with quantum side information
- Entanglement sampling and applications
- A simple approach to approximate quantum error correction based on the transpose channel
- One-Shot Classical Data Compression with Quantum Side Information and the Distillation of Common Randomness or Secret Keys
- An equality between entanglement and uncertainty
- A smooth entropy approach to quantum hypothesis testing and the classical capacity of quantum channels
Cited by in corpus (20)
- Entropy accumulation with improved second-order term
- Quantum algorithm for Petz recovery channels and pretty good measurements
- On the Second-Order Asymptotics for Entanglement-Assisted Communication
- Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
- Fundamental Finite Key Limits for One-Way Information Reconciliation in Quantum Key Distribution
- Decoding quantum information via the Petz recovery map
- Renyi relative entropies of quantum Gaussian states
- Encoding classical information into quantum resources
- Communication, Dynamical Resource Theory, and Thermodynamics
- The holographic entropy zoo
- Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
- Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
- Better bounds on optimal measurement and entanglement recovery, with applications to uncertainty and monogamy relations
- Equivocations, Exponents and Second-Order Coding Rates under Various Rényi Information Measures
- Stochastic behavior of outcome of Schur-Weyl duality measurement
- Second order asymptotics of visible mixed quantum source coding via universal codes
- Wyner's Common Information under Rényi Divergence Measures
- Asymmetry activation and its relation to coherence under permutation operation
- Convexity properties of the quantum Rényi divergences, with applications to the quantum Stein's lemma
- Generalised Entropies and Metric-Invariant Optimal Countermeasures for Information Leakage under Symmetric Constraints