Bounds for smooth min- and max-entropy
From MaRDI portal
Publication:6098282
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- A Fully Quantum Asymptotic Equipartition Property
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- A New Proof of the Quantum Noiseless Coding Theorem
- Chain Rules for Smooth Min- and Max-Entropies
- Communication Over Quantum Channels With Parameter Estimation
- Duality Between Smooth Min- and Max-Entropies
- Fundamentals of quantum information. Quantum computation, communication, decoherence and all that
- Leftover Hashing Against Quantum Side Information
- Min- and Max-Relative Entropies and a New Entanglement Monotone
- Min- and max-entropy in infinite dimensions
- Operational Interpretation of Rényi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions
- Partially Smoothed Information Measures
- Quantum Channel Simulation and the Channel’s Smooth Max-Information
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Smooth Max-Information as One-Shot Generalization for Mutual Information
- The Operational Meaning of Min- and Max-Entropy
- The capacity of the quantum channel with general signal states
- Theory of Cryptography
Cited in
(2)
This page was built for publication: Bounds for smooth min- and max-entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098282)
