Smooth min-entropy lower bounds for approximation chains
From MaRDI portal
Cites work
- A Fully Quantum Asymptotic Equipartition Property
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- A new quantum version of f-divergence
- Approximate quantum Markov chains
- Chain Rules for Smooth Min- and Max-Entropies
- Continuity of quantum conditional information
- Continuity of quantum entropic quantities via almost convexity
- Device-Independent Quantum Information Processing
- Entropy accumulation
- Entropy Accumulation With Improved Second-Order Term
- Information Theoretical Analysis of Multivariate Correlation
- Informationally coherent quantum systems
- Leftover Hashing Against Quantum Side Information
- On quantum Rényi entropies: a new generalization and some properties
- Quantum cryptography based on Bell’s theorem
- Quantum information processing with finite resources. Mathematical foundations
- Quantum information theory
- Relative entropy bounds on quantum, private and repeater capacities
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Short Proofs of the Quantum Substate Theorem
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- The \(\alpha \rightarrow 1\) limit of the sharp quantum Rényi divergence
- Theory of Cryptography
- Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
- Unconditional Security From Noisy Quantum Storage
This page was built for publication: Smooth min-entropy lower bounds for approximation chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593165)
