Relations between different quantum Rényi divergences

Abstract

Quantum generalizations of Rényi'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 Rényi divergence ${\bar{D}}_{\alpha }$ and the minimal quantum Rényi divergence ${\tilde{D}}_{\alpha }$. Moreover, the maximum quantum Rényi divergence ${\hat{D}}_{\alpha }$ is of particular mathematical interest. In this Master thesis, we investigate relations between these divergences and their applications in quantum information theory. Our main result is a reverse Araki-Lieb-Thirring inequality that implies a new relation between the minimal and the Petz divergence, namely that $\alpha {\bar{D}}_{\alpha }(\rho \Vert \sigma )⩽{\tilde{D}}_{\alpha }(\rho \Vert \sigma )$ for $\alpha \in [0,1]$ and where $\rho$ 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. In addition, we provide a new proof of the inequality ${\tilde{D}}_1(\rho \Vert \sigma )⩽{\hat{D}}_1(\rho \Vert \sigma ),$ based on the Araki-Lieb-Thirring inequality. This leads to an elegant proof of the logarithmic form of the reverse Golden-Thompson inequality.

arXiv comment33 pages + 12 pages appendix. This Master thesis has some overlap with the paper that resulted from this works (arXiv:1608.08229)

References in corpus (6)

• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Leftover Hashing Against Quantum Side Information
• alpha-z-relative Renyi entropies
• On the Optimality of Square Root Measurements in Quantum State Discrimination
• Semidefinite programs for completely bounded norms
• Pretty good measures in quantum information theory