Minimal sufficient Jordan algebras characterize sufficiency for positive trace-preserving maps on quantum states, with Neyman-Pearson tests generating them and equality in data-processing inequalities implying Petz recovery.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
years
2026 3roles
background 2polarities
background 2representative citing papers
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.
The report assembles abstracts of invited talks, presentations, and posters from the FFCS conference on foundational limits and emerging paradigms in communication.
citing papers explorer
-
Sufficiency and Petz recovery for positive maps
Minimal sufficient Jordan algebras characterize sufficiency for positive trace-preserving maps on quantum states, with Neyman-Pearson tests generating them and equality in data-processing inequalities implying Petz recovery.
-
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.
-
Foundations of Future Communication Systems: Innovations in Communication - A Report
The report assembles abstracts of invited talks, presentations, and posters from the FFCS conference on foundational limits and emerging paradigms in communication.