Pretty Good Measures in Quantum Information Theory

Quantum generalizations of Renyi’s entropies are a useful tool to describe a variety of operational tasks in quantum information processing. Two families of such generalizations turn out to be particularly useful: the Petz quantum Renyi divergence $\overline {D}_{\alpha }$ and the minimal quantum Renyi divergence $\widetilde {D}_{\alpha }$ . In this paper, we prove a reverse Araki–Lieb–Thirring inequality that implies a new relation between these two families of divergences, namely, $\alpha \overline {D}_{\alpha }( \varrho \| \sigma ) \leq \widetilde {D}_{\alpha }( \varrho \| \sigma )$ for $\alpha \in [{0,1}]$ and where $ \varrho $ and $\sigma $ are density operators. This bound suggests defining a ”pretty good fidelity,” whose relation to the usual fidelity implies the known relations between the optimal and pretty good measurement as well as the optimal and pretty good singlet fraction. We also find a new necessary and sufficient condition for optimality of the pretty good measurement and singlet fraction.