Chain Rules for Smooth Min- and Max-Entropies

DOI10.1109/TIT.2013.2238656zbMATHOpenAlexWikidataMaRDI QIDQ2989237FDO

Authors Alexander Vitanov, F. Dupuis, Marco Tomamichel, R. Renner

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17)

Abstract: The chain rule for the Shannon and von Neumann entropy, which relates the total entropy of a system to the entropies of its parts, is of central importance to information theory. Here we consider the chain rule for the more general smooth min- and max-entropy, used in one-shot information theory. For these entropy measures, the chain rule no longer holds as an equality, but manifests itself as a set of inequalities that reduce to the chain rule for the von Neumann entropy in the i.i.d. case.

Cited in

(13)

• Smooth min-entropy lower bounds for approximation chains
• One-shot holography
• Quantum skew divergence
• The information theoretic interpretation of the length of a curve
• Entanglement-assisted private communication over quantum broadcast channels
• Bounds for smooth min- and max-entropy
• Entropy accumulation
• Chain rules for quantum Rényi entropies
• Quasi chain rule for min-entropy
• Optimizing the decoy-state BB84 QKD protocol parameters
• Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
• A counterexample to the chain rule for conditional HILL entropy
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels

This page was built for publication: Chain Rules for Smooth Min- and Max-Entropies

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