On contraction coefficients, partial orders and approximation of capacities for quantum channels

Abstract

The data processing inequality is the most basic requirement for any meaningful measure of information. It essentially states that distinguishability measures between states decrease if we apply a quantum channel and is the centerpiece of many results in information theory. Moreover, it justifies the operational interpretation of most entropic quantities. In this work, we revisit the notion of contraction coefficients of quantum channels, which provide sharper and specialized versions of the data processing inequality. A concept closely related to data processing is partial orders on quantum channels. First, we discuss several quantum extensions of the well-known less noisy ordering and relate them to contraction coefficients. We further define approximate versions of the partial orders and show how they can give strengthened and conceptually simple proofs of several results on approximating capacities. Moreover, we investigate the relation to other partial orders in the literature and their properties, particularly with regard to tensorization. We then examine the relation between contraction coefficients with other properties of quantum channels such as hypercontractivity. Next, we extend the framework of contraction coefficients to general f-divergences and prove several structural results. Finally, we consider two important classes of quantum channels, namely Weyl-covariant and bosonic Gaussian channels. For those, we determine new contraction coefficients and relations for various partial orders.

Updated references and added DOIs. Version accepted at Quantum journal

References in corpus (47)

• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• 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
• From Classical to Quantum Shannon Theory
• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• A Sharp Fannes-type Inequality for the von Neumann Entropy
• Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
• Sandwiched Rényi Divergence Satisfies Data Processing Inequality
• Monotone Riemannian Metrics and Relative Entropy on Non-Commutative Probability Spaces
• Minimum output entropy of bosonic channels: a conjecture
• Quantum logarithmic Sobolev inequalities and rapid mixing
• The ${\chi }^2$-divergence and Mixing times of quantum Markov processes
• Approaches for approximate additivity of the Holevo information of quantum channels
• Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
• Monotonicity of the Quantum Relative Entropy Under Positive Maps
• Approximate Degradable Quantum Channels
• Classical capacity of bosonic broadcast communication and a new minimum output entropy conjecture
• Dephrasure channel and superadditivity of coherent information
• Bipartite depolarizing channels
• 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
• Quantum flags, and new bounds on the quantum capacity of the depolarizing channel
• Comparison of Channels: Criteria for Domination by a Symmetric Channel
• Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation
• Gaussian states minimize the output entropy of one-mode quantum Gaussian channels
• Gaussian States Minimize the Output Entropy of the One-Mode Quantum Attenuator
• The conditional Entropy Power Inequality for bosonic quantum systems
• Convexity and Operational Interpretation of the Quantum Information Bottleneck Function
• Contraction coefficients for noisy quantum channels
• Families of completely positive maps associated with monotone metrics
• Pursuing the fundamental limits for quantum communication
• Sandwiched Rényi Convergence for Quantum Evolutions
• On Relations Between the Relative entropy and ${\chi }^2$-Divergence, Generalizations and Applications
• The conditional entropy power inequality for quantum additive noise channels
• Uniform Additivity in Classical and Quantum Information
• Universal Polar Codes for More Capable and Less Noisy Channels and Sources
• Quantum Brascamp-Lieb Dualities
• Linear Bounds between Contraction Coefficients for $f$-Divergences
• On Dimension Bounds for Auxiliary Quantum Systems
• New lower bounds to the output entropy of multi-mode quantum Gaussian channels
• Bounds on Information Combining With Quantum Side Information
• Non-additivity in classical-quantum wiretap channels
• Comparison of Noisy Channels and Reverse Data-Processing Theorems
• Tensorization of the strong data processing inequality for quantum chi-square divergences
• Limitations of variational quantum algorithms: a quantum optimal transport approach
• Quantum Differential Privacy: An Information Theory Perspective

Cited by in corpus (14)

• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Universal Sampling Lower Bounds for Quantum Error Mitigation
• Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
• Exponentially tighter bounds on limitations of quantum error mitigation
• Quantum Rényi and $f$-divergences from integral representations
• Resonant Multilevel Amplitude Damping Channels
• Matrix Product Density Operators: when do they have a local parent Hamiltonian?
• A game of quantum advantage: linking verification and simulation
• Simulating quantum circuits with arbitrary local noise using Pauli Propagation
• Quantum Local Differential Privacy and Quantum Statistical Query Model
• Entropic partial orderings of quantum measurements
• Additivity of quantum capacities in simple non-degradable quantum channels
• Reverse-type Data Processing Inequality
• Moments of Quantum Channel Ensembles