Coauthors: Matthias Christandl, Graeme Mitchison, Robert Koenig

The estimation of the entropy of permutation invariant systems plays a crucial role in various information-theoretic applications, in particular in the context of quantum cryptography.

In this talk, I will review the connections between (generalized) entropies and de Finetti type theorems (including their quantum versions). In particular, I will show how de Finetti's theorem can be used to derive bounds on entropic quantities.