Trace- and improved data processing inequalities for von Neumann algebras

Abstract

We prove a version of the data-processing inequality for the relative entropy for general von Neumann algebras with an explicit lower bound involving the measured relative entropy. The inequality, which generalizes previous work by Sutter et al. on finite dimensional density matrices, yields a bound how well a quantum state can be recovered after it has been passed through a channel. The natural applications of our results are in quantum field theory where the von Neumann algebras are known to be of type III. Along the way we generalize various multi-trace inequalities to general von Neumann algebras.

28 pages, latex, v2: references added, minor improvements in lem. 1

References in corpus (15)

• 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
• Recoverability in quantum information theory
• Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map
• The fast track to Löwner's theorem
• Rényi divergences as weighted non-commutative vector valued $L_p$-spaces
• Rényi relative entropies and noncommutative $L_p$-spaces
• Preservation of a quantum Renyi relative entropy implies existence of a recovery map
• Rényi relative entropies and noncommutative $L_p$-spaces II
• Recoverability for optimized quantum $f$-divergences
• Multivariate Trace Inequalities, p-Fidelity, and Universal Recovery Beyond Tracial Settings
• Approximate recoverability and relative entropy II: 2-positive channels of general v. Neumann algebras
• The Hölder Inequality for KMS States
• Monotonicity of $p$-norms of multiple operators via unitary swivels

Cited by in corpus (1)

• Multivariate Trace Inequalities, p-Fidelity, and Universal Recovery Beyond Tracial Settings