Strong converse theorems using Rényi entropies

DOI10.1063/1.4960099zbMath1381.81025arXiv1506.02635OpenAlexW2758224462WikidataQ59832414 ScholiaQ59832414MaRDI QIDQ2820904

Nilanjana Datta, Mark M. Wilde, Felix Leditzky

Publication date: 12 September 2016

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

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

zbMATH Keywords

data compressionRenyi entropyquantum communicationRenyi relative entropystate distribution

Mathematics Subject Classification ID

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

Related Items

Uniform continuity bound for sandwiched Rényi conditional entropy, Rényi relative entropies of quantum Gaussian states, Operator-valued Schatten spaces and quantum entropies, Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents, Relative entropy for von Neumann subalgebras

Cites Work

• Unnamed Item
• Unnamed Item
• The quantum reverse Shannon theorem based on one-shot information theory
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• Quasi-entropies for finite quantum systems
• ``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
• Quantum hypothesis testing and the operational interpretation of the quantum Rényi relative entropies
• \(c_ p\)
• Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
• Smooth Entropy Bounds on One-Shot Quantum State Redistribution
• The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
• Duality of privacy amplification against quantum adversaries and data compression with quantum side information
• The mother of all protocols: restructuring quantum information’s family tree
• Privacy Amplification by Public Discussion
• Error exponents for entanglement concentration
• Coding theorem and strong converse for quantum channels
• Strong converse to the quantum channel coding theorem
• The information-theoretic costs of simulating quantum measurements
• Optimal Quantum Source Coding With Quantum Side Information at the Encoder and Decoder
• A Fully Quantum Asymptotic Equipartition Property
• Channel Simulation With Quantum Side Information
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• The apex of the family tree of protocols: optimal rates and resource inequalities
• Rényi generalizations of the conditional quantum mutual information
• One-Shot Classical Data Compression With Quantum Side Information and the Distillation of Common Randomness or Secret Keys
• Leftover Hashing Against Quantum Side Information
• Duality Between Smooth Min- and Max-Entropies
• Entanglement Breaking Channels
• A limit of the quantum Rényi divergence
• 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
• On the converse to the coding theorem for discrete memoryless channels (Corresp.)