Relating different quantum generalizations of the conditional Renyi entropy
arXiv:1311.3887 · doi:10.1063/1.4892761
Abstract
Recently a new quantum generalization of the Renyi divergence and the corresponding conditional Renyi entropies was proposed. Here we report on a surprising relation between conditional Renyi entropies based on this new generalization and conditional Renyi entropies based on the quantum relative Renyi entropy that was used in previous literature. Our result generalizes the well-known duality relation H(A|B) + H(A|C) = 0 of the conditional von Neumann entropy for tripartite pure states to Renyi entropies of two different kinds. As a direct application, we prove a collection of inequalities that relate different conditional Renyi entropies and derive a new entropic uncertainty relation.
arXiv comment10 pages, 1 figure
References in corpus (24)
- The Uncertainty Principle in the Presence of Quantum Memory
- On quantum Renyi entropies: a new generalization and some properties
- The operational meaning of min- and max-entropy
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- The Uncertainty Relation for Smooth Entropies
- Leftover Hashing Against Quantum Side Information
- A Fully Quantum Asymptotic Equipartition Property
- Reversing quantum dynamics with near-optimal quantum and classical fidelity
- Sandwiched Rényi Divergence Satisfies Data Processing Inequality
- Exponential decreasing rate of leaked information in universal random privacy amplification
- Monotonicity of a relative Rényi entropy
- Quantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
- Uncertainty relations from simple entropic properties
- On the quantum Renyi relative entropies and related capacity formulas
- On the strong converses for the quantum channel capacity theorems
- Fundamental bound on the reliability of quantum information transmission
- Multiplicativity of completely bounded -norms implies a strong converse for entanglement-assisted capacity
- The Converse Part of The Theorem for Quantum Hoeffding Bound
- Single-shot Quantum State Merging
- An equality between entanglement and uncertainty
- Tight exponential analysis of universally composable privacy amplification and its applications
- A limit of the quantum Renyi divergence
- Large deviation analysis for quantum security via smoothing of Renyi entropy of order 2
- On the Araki-Lieb-Thirring inequality
Cited by in corpus (54)
- Entropic Uncertainty Relations and their Applications
- Entropy accumulation
- Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
- Renyi generalizations of the conditional quantum mutual information
- On Variational Expressions for Quantum Relative Entropies
- An equality between entanglement and uncertainty
- Strong converse rates for quantum communication
- Operational Interpretation of Renyi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions
- Entropy of a quantum channel
- A family of generalized quantum entropies: definition and properties
- Coherence and entanglement measures based on Rényi relative entropies
- Security analysis of epsilon-almost dual universal2 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2
- Investigating Properties of a Family of Quantum Renyi Divergences
- Uniform Random Number Generation from Markov Chains: Non-Asymptotic and Asymptotic Analyses
- Rényi generalizations of quantum information measures
- Non-Asymptotic Classical Data Compression with Quantum Side Information
- Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification
- Chain rules for quantum Rényi entropies
- Pretty good measures in quantum information theory
- Partially smoothed information measures
- Postselection-free learning of measurement-induced quantum dynamics
- Quantum reverse hypercontractivity
- Secure uniform random number extraction via incoherent strategies
- Leftover hashing from quantum error correction: Unifying the two approaches to the security proof of quantum key distribution
- Duality of channels and codes
- Bipartite separability of one parameter families of states using conditional quantum relative Tsallis entropy
- The strong converse exponent of discriminating infinite-dimensional quantum states
- Quantum realism: axiomatization and quantification
- Conditional entropic uncertainty relations for Tsallis entropies
- Finite-Length Analyses for Source and Channel Coding on Markov Chains
- Maximum one-shot dissipated work from Renyi divergences
- Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks
- Inevitability of knowing less than nothing
- Decomposition Rules for Quantum Rényi Mutual Information with an Application to Information Exclusion Relations
- Tight lower bound on the error exponent of classical-quantum channels
- Biseparability of noisy pseudopure, W and GHZ states using conditional quantum relative Tsallis entropy
- Quantum Polarization of Qudit Channels
- Generalized Rényi entropy accumulation theorem and generalized quantum probability estimation
- Geometric monotones of violations of quantum realism
- Entropically secure encryption with faster key expansion
- General framework of quantum complementarity from a measurement-based perspective
- High probability decoupling via approximate unitary designs and efficient relative thermalisation
- Adversarial quantum channel discrimination
- One-shot information-theoretical approaches to fluctuation theorems
- Random coding exponents galore via decoupling
- One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC
- Secrecy and Robustness for Active Attack in Secure Network Coding and its Application to Network Quantum Key Distribution
- Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution
- Comment on "Conditional Decoupling of Quantum Information"
- Equivalence of three classical algorithms with quantum side information: Privacy amplification, error correction, and data compression
- A fixed-point algorithm for matrix projections with applications in quantum information
- Approximate Quantum Error Correction with 1D Log-Depth Circuits
- Finite-size secret-key rates of discrete modulation continuous-variable quantum key distribution under Gaussian attacks
- Rényi divergence inequalities via interpolation, with applications to generalised entropic uncertainty relations