arXiv · 2006.07726
Saturating the Data Processing Inequality for $α-z$ Renyi Relative Entropy
Abstract
It has been shown that the $α-z$ R{é}nyi relative entropy satisfies the Data Processing Inequality (DPI) for a certain range of $α$'s and $z$'s. Moreover, the range is completely characterized by Zhang in `20. We prove necessary and algebraically sufficient conditions to saturate the DPI for the $α-z$ R{é}nyi relative entropy whenever $1<α\leq 2$ and $\fracα{2}\leq z\leqα$. Moreover, these conditions coincide whenever $α=z$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sarah Chehade. 2020-10-26. Saturating the Data Processing Inequality for $α-z$ Renyi Relative Entropy. https://arxiv.org/abs/2006.07726
Cite the original work for its findings. Save a collection to share your selection of sources.