The $$\alpha $$ -sandwiched Rényi divergence satisfies the data processing inequality, i.e. monotonicity under quantum operations, for $$\alpha \ge 1/2$$ . In this article, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality for the $$\alpha $$ -sandwiched Rényi divergence for all $$\alpha \ge 1/2$$ . For the range $$\alpha \in [1/2,1)$$ , 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):122201, 2013) 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 inequality, we deduce conditions for equality in various entropic inequalities. We formulate a Rényi version of the Araki–Lieb inequality and analyze the case of equality, generalizing a result by Carlen and Lieb (Lett Math Phys 101(1):1–11, 2012) about equality in the original Araki–Lieb inequality. Furthermore, we prove a general lower bound on a Rényi version of the entanglement of formation and observe that it is attained by states saturating the Rényi version of the Araki–Lieb inequality. Finally, we prove that the known upper bound on the entanglement fidelity in terms of the usual fidelity is saturated only by pure states.
The α -sandwiched Rényi divergence satisfies the data processing inequality, i.e. monotonicity under quantum operations, for α≥1/2 . In this article, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality for the α -sandwiched Rényi divergence for all α≥1/2 . For the range α∈[1/2,1) , 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):122201, 2013) 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 inequality, we deduce conditions for equality in various entropic inequalities. We formulate a Rényi version of the Araki–Lieb inequality and analyze the case of equality, generalizing a result by Carlen and Lieb (Lett Math Phys 101(1):1–11, 2012) about equality in the original Araki–Lieb inequality. Furthermore, we prove a general lower bound on a Rényi version of the entanglement of formation and observe that it is attained by states saturating the Rényi version of the Araki–Lieb inequality. Finally, we prove that the known upper bound on the entanglement fidelity in terms of the usual fidelity is saturated only by pure states.
We provide a transparent, simple, and unified treatment of recent results on the equality conditions for the data-processing inequality of the sandwiched quantum Rényi divergence, including the statement that the equality in the data-processing implies recoverability via the Petz recovery map for the full range of the Rényi parameter α recently proven by Jenčová [J. Phys. A: Math. Theor. 50, 085303 (2017)]. We also obtain a new set of equality conditions, generalizing a previous result by Leditzky et al. [Lett. Math. Phys. 107, 61 (2017)].
The quantum relative entropy is a measure of the distinguishability of two quantum states, and it is a unifying concept in quantum information theory: many information measures such as entropy, conditional entropy, mutual information, and entanglement measures can be realized from it. As such, there has been broad interest in generalizing the notion to further understand its most basic properties, one of which is the data processing inequality. The quantum f-divergence of Petz is one generalization of the quantum relative entropy, and it also leads to other relative entropies, such as the Petz-Renyi relative entropies. In this contribution, I introduce the optimized quantum f-divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz's original approach. Interestingly, the sandwiched Renyi relative entropies are particular examples of the optimized f-divergence. Thus, one benefit of this approach is that there is now a single, unified approach for establishing the data processing inequality for both the Petz-Renyi and sandwiched Renyi relative entropies, for the full range of parameters for which it is known to hold. Full version of this paper is accessible at arXiv:1710.10252
The α–z Rényi relative entropies are a two-parameter family of Rényi relative entropies that are quantum generalizations of the classical α-Rényi relative entropies. In the work [Adv. Math. 365, 107053 (2020)], we decided the full range of (α, 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 (α, z), we give necessary conditions and sufficient conditions. For most parameters, we give equivalent conditions. This generalizes and strengthens the results of Leditzky et al. [Lett. Math. Phys. 107, 61–80 (2017)].
Abstract The quantum relative entropy is a measure of the distinguishability of two quantum states, and it is a unifying concept in quantum information theory: many information measures such as entropy, conditional entropy, mutual information, and entanglement measures can be realized from it. As such, there has been broad interest in generalizing the notion to further understand its most basic properties, one of which is the data processing inequality. The quantum f -divergence of Petz is one generalization of the quantum relative entropy, and it also leads to other relative entropies, such as the Petz–Rényi relative entropies. In this paper, I introduce the optimized quantum f -divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz’s original approach. Interestingly, the sandwiched Rényi relative entropies are particular examples of the optimized f -divergence. Thus, one benefit of this paper is that there is now a single, unified approach for establishing the data processing inequality for both the Petz–Rényi and sandwiched Rényi relative entropies, for the full range of parameters for which it is known to hold. This paper discusses other aspects of the optimized f -divergence, such as the classical case, the classical-quantum case, and how to construct optimized f -information measures.
Quantum information theory is built on entropic quantities; among them, the sandwiched Rényi relative entropy is a fundamental divergence with various applications, and its data processing inequality (DPI) under quantum channels is a cornerstone result. In this work, we present a Lean 4 library for quantum information, designed as a reusable formal infrastructure for theoretical analysis. As a central demonstration of the library, we formalize the DPI for the sandwiched Rényi relative entropy for positive semidefinite operators on finite-dimensional quantum systems. The library provides a basis-independent operator-theoretic framework for finite-dimensional quantum mechanics compatible with the standard mathematical library Mathlib, including reusable interfaces for finite-dimensional systems, states, channels, tensor products, partial traces, Choi operators, Kraus representations, and Stinespring representations. It also builds infrastructure for noncommutative trace inequalities, including operator monotonicity and convexity via the real continuous functional calculus, block-operator positivity, Hilbert-Schmidt operator spaces, Jensen's operator inequality, generalized perspectives, operator power means, and Lieb-Ando trace inequalities. On top of this framework, we formalize entropy-specific ingredients for the DPI: variational formulas for the sandwiched quasi-entropy via Young and reverse-Young inequalities, tensor-product compatibility of real powers, and Haar measures on unitary groups. Together, these components yield a Lean formalization of the DPI, give strong subadditivity as a corollary, and provide the last missing component needed to complete the Lean formalization of the generalized quantum Stein's lemma. More broadly, the development provides machine-checkable foundations for future formalized and AI-assisted research in quantum information theory.
Abstract The data processing inequality (DPI) is a scalar inequality satisfied by distinguishability measures on density matrices. For some distinguishability measures, saturation of the scalar DPI implies an operator equation relating the arguments of the measure. These results are typically derived using functional analytic techniques. In a complementary approach, we use geometric techniques to derive a formula that gives an operator equation from DPI saturation for any distinguishability measure; moreover, for a broad class of distinguishability measures, the derived operator equation is sufficient to imply saturation as well. Our operator equation coincides with known results for the sandwiched Rényi relative entropies, and gives new results for α - z Rényi relative entropies and a family of of quantum f -divergences, which we compute explicitly.