2000 character limit reached
Equality conditions of Data Processing Inequality for $α$-$z$ Rényi relative entropies (2007.06644v2)
Published 13 Jul 2020 in math-ph, math.FA, math.MP, and quant-ph
Abstract: The $\alpha$-$z$ R\'enyi relative entropies are a two-parameter family of R\'enyi relative entropies that are quantum generalizations of the classical $\alpha$-R\'enyi relative entropies. In \cite{zhang20CFL} we decided the full range of $(\alpha,z)$ for which the Data Processing Inequality (DPI) is valid. In this paper we give algebraic conditions for the equality in DPI. For the full range of parameters $(\alpha,z)$, we give necessary conditions and sufficient conditions. For most parameters we give equivalent conditions. This generalizes and strengthens the results of Leditzky, Rouz{\'e} and Datta in \cite{LRD17DPI}.