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

by   Christoph Hirche, et al.

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. It is the centerpiece of many results in information theory and 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 are partial orders on quantum channels. We discuss several quantum extensions of the well known less noisy ordering and then 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 regards to tensorization. We then investigate further properties of contraction coefficients and their relation to 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.


page 1

page 2

page 3

page 4


Tensorization of the strong data processing inequality for quantum chi-square divergences

Quantifying the contraction of classical and quantum states under noisy ...

Optimized quantum f-divergences

The quantum relative entropy is a measure of the distinguishability of t...

Comparison of Noisy Channels and Reverse Data-Processing Theorems

This paper considers the comparison of noisy channels from the viewpoint...

Doeblin Coefficients and Related Measures

Doeblin coefficients are a classical tool for analyzing the ergodicity a...

Recoverability for Holevo's just-as-good fidelity

Holevo's just-as-good fidelity is a similarity measure for quantum state...

Bounding quantum capacities via partial orders and complementarity

Quantum capacities are fundamental quantities that are notoriously hard ...

Information contraction in noisy binary neural networks and its implications

Neural networks have gained importance as the machine learning models th...

Please sign up or login with your details

Forgot password? Click here to reset