Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
Strong converse theorems using Rényi entropies
Felix Leditzky
, Mark M. Wilde
, Nilanjana Datta
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Strong converse theorems using Rényi entropies'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Rnyi Entropy
100%
Strong Converse Theorem
100%
Quantum Side Information
66%
State Merging
33%
Communication Cost
33%
Quantum Communication
33%
State Redistribution
33%
Measure Compression
33%
Explicit Bounds
16%
Divergence
16%
Data Compression
16%
ArXiv
16%
Quantum State
16%
Mutual Information
16%
Information Theory
16%
Conditional Entropy
16%
Coherent States
16%
Entropy Information
16%
Two-party
16%
Achievable Rate Region
16%
Classical Communication
16%
Local Operation
16%
Optimal Rate
16%
Preprints
16%
Quant
16%
Entropy Method
16%
Strong Converse
16%
Information Compression
16%
Conditional mutual Information
16%
Weak Converse
16%
Classical Communication Cost
16%
Entanglement Cost
16%
Randomness Extraction
16%
Entropic Inequalities
16%
Strong Converse Exponent
16%
Quantum State Splitting
16%
Smooth Entropies
16%
Mathematics
Mutual Information
100%
Quantum State
100%
Conditionals
50%
Data Compression
50%
Figure of Merit
50%
Conditional Entropy
50%
Physics
Quantum Communication
100%
Data Compression
100%