Strong converse theorems using Rényi entropies
arXiv:1506.02635 · doi:10.1063/1.4960099
Abstract
We use a Rényi entropy method to prove strong converse theorems for certain information-theoretic tasks which involve local operations and quantum or classical communication between two parties. These include state redistribution, coherent state merging, quantum state splitting, measurement compression with quantum side information, randomness extraction against quantum side information, and data compression with quantum side information. The method we employ in proving these results extends ideas developed by Sharma [arXiv:1404.5940], which he used to give a new proof of the strong converse theorem for state merging. For state redistribution, we prove the strong converse property for the boundary of the entire achievable rate region in the -plane, where and denote the entanglement cost and quantum communication cost, respectively. In the case of measurement compression with quantum side information, we prove a strong converse theorem for the classical communication cost, which is a new result extending the previously known weak converse. For the remaining tasks, we provide new proofs for strong converse theorems previously established using smooth entropies. For each task, we obtain the strong converse theorem from explicit bounds on the figure of merit of the task in terms of a Rényi generalization of the optimal rate. Hence, we identify candidates for the strong converse exponents for each task discussed in this paper. To prove our results, we establish various new entropic inequalities, which might be of independent interest. These involve conditional entropies and mutual information derived from the sandwiched Rényi divergence. In particular, we obtain novel bounds relating these quantities, as well as the Rényi conditional mutual information, to the fidelity of two quantum states.
arXiv comment40 pages, 5 figures; v4: Accepted for publication in Journal of Mathematical Physics
References in corpus (39)
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- On quantum Renyi entropies: a new generalization and some properties
- General Entanglement Breaking Channels
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- Min- and Max- Relative Entropies and a New Entanglement Monotone
- Coding Theorem and Strong Converse for Quantum Channels
- Leftover Hashing Against Quantum Side Information
- A Fully Quantum Asymptotic Equipartition Property
- The mother of all protocols: Restructuring quantum information's family tree
- Sandwiched Rényi Divergence Satisfies Data Processing Inequality
- Duality Between Smooth Min- and Max-Entropies
- Quantum Reverse Shannon Theorem
- Monotonicity of a relative Rényi entropy
- Quantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
- The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
- Strong Converse to the Quantum Channel Coding Theorem
- The exact cost of redistributing multipartite quantum states
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Classical data compression with quantum side information
- Optimal quantum source coding with quantum information at the encoder and decoder
- Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
- Coding Theorems of Quantum Information Theory
- A strong converse for classical channel coding using entangled inputs
- Multiplicativity of completely bounded -norms implies a strong converse for entanglement-assisted capacity
- The information-theoretic costs of simulating quantum measurements
- Renyi generalizations of the conditional quantum mutual information
- "Extrinsic" and "intrinsic" data in quantum measurements: asymptotic convex decomposition of positive operator valued measures
- One-Shot Classical Data Compression with Quantum Side Information and the Distillation of Common Randomness or Secret Keys
- Single-shot Quantum State Merging
- The apex of the family tree of protocols: Optimal rates and resource inequalities
- Exponents of quantum fixed-length pure state source coding
- A limit of the quantum Renyi divergence
- A triangle of dualities: reversibly decomposable quantum channels, source-channel duality, and time reversal
- Duality of privacy amplification against quantum adversaries and data compression with quantum side information
- Error exponents for entanglement concentration
- Smooth Entropy Bounds on One-Shot Quantum State Redistribution
- State redistribution as merging: introducing the coherent relay
- Renyi-entropic bounds on quantum communication
- A strong converse for the quantum state merging protocol
Cited by in corpus (18)
- Quantum Resource Theories
- Resource theory of asymmetric distinguishability
- Renyi relative entropies of quantum Gaussian states
- Non-Asymptotic Classical Data Compression with Quantum Side Information
- Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification
- Computable Rényi mutual information: Area laws and correlations
- Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction
- A one-shot achievability result for quantum state redistribution
- Relative entropy for von Neumann subalgebras
- Thermodynamic Constraints on Quantum Information Gain and Error Correction: A Triple Trade-Off
- Communication Complexity of One-Shot Remote State Preparation
- Relating relative Rényi entropies and Wigner-Yanase-Dyson skew information to generalized multiple quantum coherences
- One-shot quantum state redistribution and quantum Markov chains
- Operator-valued Schatten spaces and quantum entropies
- Upper Bounds on the Distillable Randomness of Bipartite Quantum States
- A simple coin for a entangled walk
- Generalized Entropic Quantum Speed Limits
- Uniform continuity bound for sandwiched Rényi conditional entropy