Bounds for smooth min- and max-entropy
From MaRDI portal
Publication:6098282
DOI10.1007/S11128-023-03971-WOpenAlexW4377090375MaRDI QIDQ6098282FDOQ6098282
Authors:
Publication date: 13 June 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-023-03971-w
Recommendations
Cites Work
- Title not available (Why is that?)
- The capacity of the quantum channel with general signal states
- Theory of Cryptography
- The Operational Meaning of Min- and Max-Entropy
- A Fully Quantum Asymptotic Equipartition Property
- Min- and Max-Relative Entropies and a New Entanglement Monotone
- SECURITY OF QUANTUM KEY DISTRIBUTION
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- Min- and max-entropy in infinite dimensions
- Chain Rules for Smooth Min- and Max-Entropies
- A New Proof of the Quantum Noiseless Coding Theorem
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Fundamentals of quantum information. Quantum computation, communication, decoherence and all that
- Duality Between Smooth Min- and Max-Entropies
- Leftover Hashing Against Quantum Side Information
- Smooth Max-Information as One-Shot Generalization for Mutual Information
- Quantum Channel Simulation and the Channel’s Smooth Max-Information
- Partially Smoothed Information Measures
- Operational Interpretation of Rényi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions
- Communication Over Quantum Channels With Parameter Estimation
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)
