Data processing for the sandwiched Rényi divergence: a condition for equality
From MaRDI portal
Publication:2361095
conditional entropydata processing inequalityentanglement of formationequality conditionrelative entropiesRényi entropies
Applications of operator theory in the physical sciences (47N50) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)
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 inequality, we deduce conditions for equality in various entropic inequalities. We formulate a R'enyi version of the Araki-Lieb inequality and analyze the case of equality, generalizing a result by Carlen and Lieb [Lett. Math. Phys. 101.1 (2012), pp. 1-11] about equality in the original Araki-Lieb inequality. Furthermore, we prove a general lower bound on a R'enyi version of the entanglement of formation, and observe that it is attained by states saturating the R'enyi 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.
Recommendations
- Revisiting the equality conditions of the data-processing inequality for the sandwiched Rényi divergence
- Inequalities for quantum divergences and the Audenaert-Datta conjecture
- Sandwiched Rényi divergence satisfies data processing inequality
- Equality conditions of data processing inequality for -z Rényi relative entropies
- Equality conditions for the quantum f-relative entropy and generalized data processing inequalities
Cites work
- α-z-Rényi relative entropies
- A limit of the quantum Rényi divergence
- Bounds for entanglement via an extension of strong subadditivity of entropy
- Concavity of certain matrix trace and norm functions
- Convex trace functions and the Wigner-Yanase-Dyson conjecture
- Different quantum f-divergences and the reversibility of quantum operations
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Min- and Max-Relative Entropies and a New Entanglement Monotone
- Mixed-state entanglement and quantum error correction
- Monotonicity of a relative Rényi entropy
- On conjectures of classical and quantum correlations in bipartite states
- On quantum Rényi entropies: a new generalization and some properties
- On the Quantum Rényi Relative Entropies and Related Capacity Formulas
- On variational expressions for quantum relative entropies
- Polar Codes in Network Quantum Information Theory
- Positive Functions on C ∗ -Algebras
- Preservation of a quantum Rényi relative entropy implies existence of a recovery map
- Quantum f-divergences and error correction
- Quantum conditional mutual information and approximate Markov chains
- Quantum hypothesis testing and the operational interpretation of the quantum Rényi relative entropies
- Quantum Markov chains, sufficiency of quantum channels, and Rényi information measures
- Quasi-entropies for finite quantum systems
- Recoverability in quantum information theory
- Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory
- Reversibility conditions for quantum operations
- Rényi squashed entanglement, discord, and relative entropy differences
- Sandwiched Rényi divergence satisfies data processing inequality
- Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map
- Strong converse and Stein's lemma in quantum hypothesis testing
- Strong converse exponent for classical-quantum channel coding
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Structure of sufficient quantum coarse-grainings
- Sufficiency in quantum statistical inference
- SUFFICIENCY OF CHANNELS OVER VON NEUMANN ALGEBRAS
- Sufficient subalgebras and the relative entropy of states of a von Neumann algebra
- The transition probability in the state space of a \(^*\)-algebra
- The asymptotic entanglement cost of preparing a quantum state
- The Fidelity of Recovery Is Multiplicative
- The proper formula for relative entropy and its asymptotics in quantum probability
- Trace inequalities and quantum entropy: an introductory course
- Universal recovery map for approximate Markov chains
- Universal recovery maps and approximate sufficiency of quantum relative entropy
Cited in
(21)- Convexity of a certain operator trace functional
- Approximate Petz recovery from the geometry of density operators
- Quantum divergences with p-power means
- Entanglement, quantum randomness, and complexity beyond scrambling
- Preservation of a quantum Rényi relative entropy implies existence of a recovery map
- Equality conditions for the quantum f-relative entropy and generalized data processing inequalities
- Matrix analysis and quantum information
- Sandwiched Rényi relative entropy on density operators
- Geometric conditions for saturating the data processing inequality
- A strengthened data processing inequality for the Belavkin-Staszewski relative entropy
- Some notes on quantum Hellinger divergences with Heinz means
- Equality conditions of data processing inequality for -z Rényi relative entropies
- Monotonicity of the quantum relative entropy under positive maps
- Different quantum f-divergences and the reversibility of quantum operations
- Sandwiched Rényi divergence satisfies data processing inequality
- Recoverability for optimized quantum f-divergences
- Revisiting the equality conditions of the data-processing inequality for the sandwiched Rényi divergence
- Equality cases in monotonicity of quasi-entropies, Lieb’s concavity and Ando’s convexity
- Recoverability of quantum channels via hypothesis testing
- \(\alpha\)-\(z\)-Rényi divergences in von Neumann algebras: data processing inequality, reversibility, and monotonicity properties in \(\alpha\), \(z\)
- Continuity inequalities for sandwiched Rényi and Tsallis conditional entropies with application to the channel entropy continuity
This page was built for publication: Data processing for the sandwiched Rényi divergence: a condition for equality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361095)
