Robust protocols exist for hypothesis testing, compression, and channel coding that attain optimal rates for arbitrary almost i.i.d. sources, via a new club distance and almost i.i.d. process notion.
Fisherinformationandlogarithmic sobolev inequality for matrix-valued functions.Annales Henri Poincaré, 21(11):3409– 3478, 2020
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum Shannon theory made robust: a tale of three protocols for almost i.i.d. sources
Robust protocols exist for hypothesis testing, compression, and channel coding that attain optimal rates for arbitrary almost i.i.d. sources, via a new club distance and almost i.i.d. process notion.