Geometric conditions for saturating the data processing inequality
arXiv:2011.03473 · doi:10.1088/1751-8121/ac5648
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 - Rényi relative entropies and a family of of quantum -divergences, which we compute explicitly.
arXiv comment13 pages + 2 pages appendices; v2 contains some small corrections, additional pedagogical explanations, and is published in J. Phys. A: Math. Theor (2022)
References in corpus (24)
- On quantum Renyi entropies: a new generalization and some properties
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- Quantum conditional mutual information and approximate Markov chains
- Quantum f-divergences and error correction
- Monotonicity of quantum relative entropy revisited
- alpha-z-relative Renyi entropies
- Universal recovery maps and approximate sufficiency of quantum relative entropy
- Different quantum f-divergences and the reversibility of quantum operations
- Renyi generalizations of the conditional quantum mutual information
- A Unified Treatment of Convexity of Relative Entropy and Related Trace Functions, with Conditions for Equality
- From Wigner-Yanase-Dyson conjecture to Carlen-Frank-Lieb conjecture (New title)
- Rényi relative entropies and noncommutative -spaces
- Preservation of a quantum Renyi relative entropy implies existence of a recovery map
- Rényi relative entropies and noncommutative -spaces II
- Data processing for the sandwiched Rényi divergence: a condition for equality
- Recoverability for optimized quantum -divergences
- Equality conditions of Data Processing Inequality for - Rényi relative entropies
- Reverse test and quantum analogue of classical fidelity and generalized fidelity
- Approximate Petz recovery from the geometry of density operators
- A strengthened monotonicity inequality of quantum relative entropy: A unifying approach via Rényi relative entropy
- A fidelity measure for quantum states based on the matrix geometric mean
- Enhanced surface plasmon polariton propagation induced by active dielectrics
- Certifying optimality for convex quantum channel optimization problems
- Revisiting the equality conditions of the data processing inequality for the sandwiched Rényi divergence