Data processing for the sandwiched R\'enyi divergence: a condition for equality
Felix Leditzky, Cambyse Rouz\'e, Nilanjana Datta

TL;DR
This paper establishes a precise algebraic condition for equality in the data processing inequality of the sandwiched Re9nyi divergence for all b1 b5 b7 1/2, with applications to entropic inequalities and quantum information measures.
Contribution
It provides the first necessary and sufficient condition for equality in the data processing inequality for the sandwiched Re9nyi divergence across all b1 b5 b7 1/2, generalizing previous results.
Findings
Derived a condition for equality in the data processing inequality for b1 b5 b7 1/2.
Formulated a Re9nyi Araki-Lieb inequality and analyzed equality cases.
Proved bounds on Re9nyi entanglement of formation and fidelity saturation.
Abstract
The -sandwiched R\'enyi divergence satisfies the data processing inequality, i.e. monotonicity under quantum operations, for . In this article, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality for the -sandwiched R\'enyi divergence for all . For the range , our result provides the only condition for equality obtained thus far. To prove our result, we first consider the special case of partial trace, and derive a condition for equality based on the original proof of the data processing inequality by Frank and Lieb [J. Math. Phys. 54.12 (2013), p. 122201] using a strict convexity/concavity argument. We then generalize to arbitrary quantum operations via the Stinespring Representation Theorem. As applications of our condition for equality in the data processing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
