Strong converse theorems using Rényi entropies

DOI10.1063/1.4960099zbMATH Open1381.81025arXiv1506.02635OpenAlexW2758224462WikidataQ59832414 ScholiaQ59832414MaRDI QIDQ2820904FDOQ2820904

Authors: Felix Leditzky, Mark M. Wilde, Nilanjana Datta 

Publication date: 12 September 2016

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Abstract: We use a R'enyi 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 $(e,q)$-plane, where $e$ and $q$ 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'enyi 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'enyi divergence. In particular, we obtain novel bounds relating these quantities, as well as the R'enyi conditional mutual information, to the fidelity of two quantum states.

Full work available at URL: https://arxiv.org/abs/1506.02635

Recommendations

• Reversal of Rényi Entropy Inequalities Under Log-Concavity
• The structure of Rényi entropic inequalities
• Convexity and robustness of the Rényi entropy
• Rényi entropy power inequality and a reverse
• Weak entropy inequalities and entropic convergence
• The Concavity of Rényi Entropy Power
• On the Conditional Rényi Entropy
• On Rényi Entropy Power Inequalities
• Conditional Rényi Entropies
• Majorization and Rényi entropy inequalities via Sperner theory

zbMATH Keywords

data compressionquantum communicationRenyi entropyRenyi relative entropystate distribution

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)

Cites Work

• \(c_ p\)
• Rényi generalizations of the conditional quantum mutual information
• Quasi-entropies for finite quantum systems
• Privacy Amplification by Public Discussion
• A Fully Quantum Asymptotic Equipartition Property
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
• Sandwiched Rényi divergence satisfies data processing inequality
• Monotonicity of a relative Rényi entropy
• On quantum Rényi entropies: a new generalization and some properties
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• Quantum hypothesis testing and the operational interpretation of the quantum Rényi relative entropies
• The mother of all protocols: restructuring quantum information's family tree
• ``Extrinsic and ``intrinsic data in quantum measurements: asymptotic convex decomposition of positive operator valued measures
• Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity
• The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
• Entanglement Breaking Channels
• On the converse to the coding theorem for discrete memoryless channels (Corresp.)
• The quantum reverse Shannon theorem based on one-shot information theory
• Optimal Quantum Source Coding With Quantum Side Information at the Encoder and Decoder
• The apex of the family tree of protocols: optimal rates and resource inequalities
• One-Shot Classical Data Compression With Quantum Side Information and the Distillation of Common Randomness or Secret Keys
• A limit of the quantum Rényi divergence
• Duality Between Smooth Min- and Max-Entropies
• Title not available (Why is that?)
• Coding theorem and strong converse for quantum channels
• Leftover Hashing Against Quantum Side Information
• Title not available (Why is that?)
• Strong converse to the quantum channel coding theorem
• The information-theoretic costs of simulating quantum measurements
• Smooth Entropy Bounds on One-Shot Quantum State Redistribution
• Error exponents for entanglement concentration
• Duality of privacy amplification against quantum adversaries and data compression with quantum side information
• Channel Simulation With Quantum Side Information

Cited In (10)

• Relative entropy for von Neumann subalgebras
• On distinguishability distillation and dilution exponents
• Title not available (Why is that?)
• Operator-valued Schatten spaces and quantum entropies
• Rényi relative entropies of quantum Gaussian states
• Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents
• Second-order converses via reverse hypercontractivity
• Uniform continuity bound for sandwiched Rényi conditional entropy
• Properties of noncommutative Rényi and Augustin information
• Strong converse for the quantum capacity of the erasure channel for almost all codes

This page was built for publication: Strong converse theorems using Rényi entropies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820904)