Reverse-type Data Processing Inequality

Abstract

The quantum data processing inequality asserts that two quantum states become harder to distinguish when a noisy channel is applied. On the other hand, a reverse quantum data processing inequality characterizes whether distinguishability is preserved after the application of a noisy channel. In this work, we explore these concepts through contraction and expansion coefficients of the relative entropy of quantum channels. Our first result is that quantum channels with an input dimension greater than or equal to the output dimension do not have a non-zero expansion coefficient, which means that they cannot admit a reverse data-processing inequality. We propose a comparative approach by introducing a relative expansion coefficient, to assess how one channel expands relative entropy compared to another. We show that this relative expansion coefficient is positive for three important classes of quantum channels: depolarizing channels, generalized dephasing channels, and amplitude damping channels. As an application, we give the first rigorous construction of level-1 less noisy quantum channels that are non-degradable.

32 pages. To appear in Communications in Mathematical Physics

References in corpus (23)

• $f$-divergence Inequalities
• Monotone Riemannian Metrics and Relative Entropy on Non-Commutative Probability Spaces
• Monotonicity of quantum relative entropy revisited
• A quantum version of Wielandt's inequality
• Unbounded number of channel uses are required to see quantum capacity
• Monotonicity of the Quantum Relative Entropy Under Positive Maps
• Continuity bounds on the quantum relative entropy - II
• Relative Entropy Convergence for Depolarizing Channels
• Private and Quantum Capacities of More Capable and Less Noisy Quantum Channels
• Optimized quantum f-divergences and data processing
• Complete entropic inequalities for quantum Markov chains
• Comparison of Channels: Criteria for Domination by a Symmetric Channel
• Additive Extensions of a Quantum Channel
• Computing Quantum Channel Capacities
• On contraction coefficients, partial orders and approximation of capacities for quantum channels
• Contraction coefficients for noisy quantum channels
• Families of completely positive maps associated with monotone metrics
• Quantum Rényi and $f$-divergences from integral representations
• Uniform Additivity in Classical and Quantum Information
• Integral formula for quantum relative entropy implies data processing inequality
• Fundamental Limit on the Power of Entanglement Assistance in Quantum Communication
• Non-additivity in classical-quantum wiretap channels
• Tensorization of the strong data processing inequality for quantum chi-square divergences