Contraction coefficients quantify the loss of distinguishability induced by a channel and provide a strong form of the data-processing inequality. While standard contraction coefficients ignore auxiliary quantum systems, existing extensions based on complete contraction coefficients require the compared states to have identical reference marginals. In this work, we introduce conditional contraction coefficients, a novel family that incorporates arbitrary quantum reference systems by subtracting the distinguishability already present in the reference system. We develop a general framework for contraction coefficients with such quantum side information, including the corresponding strong-data-processing-inequality (SDPI) constants, expansion coefficients, and relative contraction coefficients. For the trace distance, we show that the optimization can be restricted to orthogonal input states. For the quantum relative entropy, we prove that its conditional contraction coefficient is exactly equal to the contraction coefficient of the conditional mutual information, extending the classical correspondence between relative-entropy contraction and mutual-information contraction to the setting with quantum side information. More generally, we identify structural properties of divergences required for these results and discuss extensions beyond the relative entropy. These results establish a unified framework for analyzing information contraction in quantum network settings, where quantum side information and distributed correlations are intrinsic features of the information-processing task. Applications include an extension of the Polyanskiy-Wu bounds on mutual information contraction, new perspectives on mixing times, and fundamental limits on quantum memories.
Contraction coefficients quantify the loss of distinguishability induced by a channel and provide a strong form of the data-processing inequality. While standard contraction coefficients ignore auxiliary quantum systems, existing extensions based on complete contraction coefficients require the compared states to have identical reference marginals. In this work, we introduce conditional contraction coefficients, a novel family that incorporates arbitrary quantum reference systems by subtracting the distinguishability already present in the reference system. We develop a general framework for contraction coefficients with such quantum side information, including the corresponding strong-data-processing-inequality (SDPI) constants, expansion coefficients, and relative contraction coefficients. For the trace distance, we show that the optimization can be restricted to orthogonal input states. For the quantum relative entropy, we prove that its conditional contraction coefficient is exactly equal to the contraction coefficient of the conditional mutual information, extending the classical correspondence between relative-entropy contraction and mutual-information contraction to the setting with quantum side information. More generally, we identify structural properties of divergences required for these results and discuss extensions beyond the relative entropy. These results establish a unified framework for analyzing information contraction in quantum network settings, where quantum side information and distributed correlations are intrinsic features of the information-processing task. Applications include an extension of the Polyanskiy-Wu bounds on mutual information contraction, new perspectives on mixing times, and fundamental limits on quantum memories.
We compare three quantum information contraction coefficients and determine when contraction close to its optimum can retain nonvanishing input divergence. Using the exact complete coefficient and complex inverse-pencil inequality of SR-012, we prove that conditional relative-entropy contraction, conditional mutual-information contraction, and complete equal-reference contraction have the same coefficient for every finite quantum channel. For a depolarizing qubit with parameter −1/3 ≤ λ ≤ 1, the ordinary mutual-information coefficient is 2λ²/(1+λ), whereas the complete and conditional coefficients are 3λ²/(1+2λ). These differ strictly except at λ = 0, 1; at half-depolarization the values are 1/3 and 3/8. For a general channel with input dimension at least two, let P project onto the largest output subspace whose tensor product with the input space lies in the Choi support, and put b = ‖N*(I−P)‖op. A maximizing sequence with input divergence bounded away from zero exists exactly when b = ηc. In this case every positive limiting divergence is possible with reference dimension at most the square of the input dimension. Otherwise an explicit nonlinear deficit is uniform over all finite references, including growing ones. The proof gives an eighteenth-power trace-distance deficit in general and a fourth-power bound for faithful Choi matrices. Product criteria and logarithmic copy bounds follow. The mutual-information lower family converges pointwise with vanishing input information; the positive-divergence construction has vanishing trace distance. Neither construction establishes a fixed-error or capacity statement, and the resource constants are not claimed optimal. A visual guide records the mathematical routes, joint proof dependencies, and provenance of the results.
The maximal correlation coefficient measures the linear correlation in a bipartite distribution and contraction coefficients measure how much information is lost under a noisy channel. Remarkably, Raginsky established a close relation between these two concepts by showing that the χ2 contraction coefficient equals the maximal correlation coefficient of the joint input/output distribution of the channel. In quantum theory, several generalizations of these concepts have been proposed, but none recover all the classical properties. Here we construct a framework in which the classical theory extends to the quantum setting. We introduce families of quantum maximal correlation coefficients and show that many impose limits on converting quantum states under local operations. We establish a family of quantum contraction coefficients are efficiently computable, yielding a generic efficient algorithm for mixing times of quantum channels with a full rank fixed point. Furthermore, we establish a quantum analogue of Raginsky's classical correspondence that relates these two families of quantities. To do this, we develop the operator-theoretic approach to Petz's family of non-commutative L2(p) spaces that extend the data processing inequality for variance to quantum theory.
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.
The data-processing inequality ensures quantum channels reduce state distinguishability, with contraction coefficients quantifying optimal bounds. However, these can be overly optimistic and not representative of the usual behavior. We study how noise contracts distinguishability of `typical' states, beyond the worst-case. To that end, we introduce and study a family of moments of contraction for quantum divergences, which interpolate between the worst-case contraction coefficient of a channel and its average behavior under a chosen ensemble of input states. We establish general properties of these moments, relate moments for different divergences, and derive bounds in terms of channel parameters like the entropy or purity of its Choi state. Focusing on the trace distance, we obtain upper and lower bounds on its average contraction under tensor-product noise channels, and prove that, depending on the local noise strength, there is a phase transition in the limit of many channel uses: below a critical error rate the average contraction remains near unity, whereas above it decays exponentially with system size. We extend these phase-transition phenomena to random quantum circuits with unital noise, showing that constant-depth noisy circuits do not shrink the trace distance on average, even when given highly entangled states as input. In contrast, even at loglogn depth, the average trace distance can become superpolynomially small. Finally, we explore moments of contraction for f-divergences and discuss applications to local differential privacy, demonstrating that noise regimes ensuring privacy can render outputs essentially indistinguishable on average. Thus, our results provide a fine-grained framework to quantify typical channel noise in quantum information and computation and unveil new phenomena in contraction coefficients, such as phase transitions for average contraction.
How much distinguishability can a noisy quantum channel preserve when its input is correlated with an untouched quantum memory? This paper gives an exact finite semidefinite program for that question for every finite-dimensional completely positive, trace-preserving channel. The complete coefficient compares joint states with the same memory marginal. The conditional coefficient instead subtracts the distinguishability already present in the memory. Both coefficients, and conditional mutual-information contraction with a separate conditioning system, equal one minus the reciprocal of an optimization in the channel’s unnormalized Choi matrix. The equivalent inverse formula retains an essential range condition, including for singular channels. The proof solves a centered matrix-Gram problem, shows that its optimization center can be positive, and constructs a signed observable lift through an erasure channel. Two weighted quadratic inequalities give the universal entropy bound. A rare coherent memory sector proves sharpness while preserving both local marginals exactly. A memory of bounded dimension suffices, including with prescribed faithful input marginals. The same program gives exact coefficients for regular modular Petz divergences whose generators have finite endpoint value and recession slope, every fixed Petz Rényi order strictly between zero and one, and quantum Chernoff divergence. Further results include a harmonic dual, an exact tensor-product law, a strict-contraction criterion, a sharp comparison with positive quantum Doeblin minorization, and explicit classical, depolarizing and orthogonal-unitary-noise formulas. Ordinary quantum mutual-information contraction is a different optimization. For qubit depolarization the paper determines its exact value on the full completely positive parameter interval. At shrinkage one half, ordinary relative-entropy, ordinary mutual-information and complete entropy contraction are respectively 1/4, 1/3 and 3/8. In higher dimension, bounds and a strict separation are proved without asserting an exact ordinary-MI formula. A discontinuity between nearly complete amplitude damping and pure reset rules out uniformly bounded-use estimation of the exact coefficient from an unknown channel, even with adaptive experiments and quantum ancillas. Thus evaluation from exact supplied Choi data does not imply stable experimental acquisition. Rare sharpness witnesses can carry vanishing absolute information; the results do not assert a communication rate, physical simulator, general recovery map or polynomial cost in physical qubit count.
We determine the complete equal-reference Umegaki relative-entropy contraction coefficient of every finite-dimensional quantum channel. For its unnormalized Choi matrix J, let H be the largest output subspace with ℂⁿ ⊗ H ⊆ supp J, and let M(ρ) be the compression to H of Tr_A[(ρᵀ ⊗ I)J⁺]. The coefficient is 1 − min_ρ Tr_H M(ρ)⁻¹, with the minimum set to zero when H = {0}. A Kraus cancellation inequality gives the upper bound, and a weighted trace-zero operator basis gives matching faithful pairs with both marginals equal and reference dimension n². The complementary coefficient has a reciprocal radius formula, a finite semidefinite representation, and an exact product law. Strict contraction is equivalent to a nonzero completely positive replacer minorant. The formula also gives the exact coefficient of depolarizing channels throughout their physical parameter range. The general matching family has vanishing input divergence; its logarithmic rate is pointwise for a fixed faithful input density, with separate finite-accuracy bounds for optimization and conditioning. A different construction retains any prescribed positive limiting divergence when the coefficient is one. This cannot hold universally: a complete nonlinear bound for binary symmetric channels forces every maximizing sequence to lose input divergence, regardless of reference dimension. The positive construction still has vanishing trace distance and exponentially small regularization; no fixed-error or capacity conclusion follows. A visual guide records the mathematical routes, proof dependencies, and provenance of the result.