Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Exact Complete Relative-Entropy Contraction of Finite Classical Channels

Ying Xie

Published Nov 6, 2026• 0 citations
Publisher

Abstract

We determine the complete equal-reference Umegaki relative-entropy contraction coefficient of every finite classical channel. For a column-stochastic matrix K with n ≥ 2 inputs, let J consist of the output rows positive in every column. The coefficient is η_c(K) = 1 − min_{p ∈ Δ_n} ∑{y ∈ J} (∑{i=1}^n p_i/K_{yi})⁻¹. The upper bound follows from a dimension-independent residual inequality and the integral representation of the Bogoliubov–Kubo–Mori metric. A weighted simplex construction gives matching faithful state pairs with equal classical and reference marginals; reference dimension n suffices for the supremum. The convergence is pointwise in the channel and weight parameters, with input relative entropy tending to zero. The construction gives no capacity or fixed-error operational guarantee. The complementary loss is the exponential of the negative left order-two Rényi radius of the channel columns. It therefore obeys an exact product law, giving η_c(K ⊗ L) = 1 − (1 − η_c(K))(1 − η_c(L)) even when the optimizing hypotheses may be correlated across uses. We also prove the sharp comparison η_D(K) ≤ η_c(K) ≤ min{1, (n − 1)η_D(K)} with ordinary classical contraction. Exact rational bounds and finite state-pair certificates accompany the analytic proofs. An accompanying three-view visualization guides the reader through the discovery route, proof dependencies, and provenance.

DOI
10.5281/zenodo.23996417

Related papers

Exact Complete Relative-Entropy Contraction of Finite Classical-to-Quantum Channels

Ying Xie

We determine the complete equal-reference Umegaki relative-entropy contraction coefficient of every finite preparation channel after input dephasing. For prepared states ρ₁, …, ρₙ, let H be the intersection of their supports and let Aᵢ be the compression of ρᵢ⁺ to H. If H is nonzero, the coefficient is 1 − min over p in Δₙ of Tr_H[(Σᵢ pᵢAᵢ)⁻¹]; it equals one when H is zero. A noncommutative metric inequality gives the upper bound, and a weighted operator-simplex construction gives matching faithful classical–quantum input pairs with equal classical and reference marginals. Reference dimension n suffices for the supremum. The complementary coefficient is the reciprocal of an exponential left order-two Petz–Rényi radius and is multiplicative under Cartesian products. Faithful binary-input qubit-output channels can consequently have complete coefficient tending to one while their ordinary coefficient tends to zero, with reference dimension two sufficient throughout. An exact rational example has complete coefficient 9/41. The matching input family converges pointwise, has input relative entropy tending to zero, and can converge logarithmically slowly; it provides no fixed-error or capacity conclusion. A visual guide records the mathematical routes, proof dependencies, and provenance of the result.

•Nov 7, 2026•0 citations

Exact Complete Relative-Entropy Contraction of Finite Quantum Channels

Ying Xie

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.

•Nov 8, 2026•0 citations

Tight Entropy Contraction of Generalized Quantum Depolarization

Li Gao, Long Zhao

We establish upper and lower bounds for relative entropy contraction of generalized quantum depolarizing channels and semigroups. Our bound provides tight first order asymptotic of the contraction rate in terms of the dimension constant. One side estimate are based on sharp reverse ratio and convexity of relative entropy of two states, which can be derived from the recently introduced Hockey-Stick quantum $f$-divergence, and also independently, Bogoliubov--Kubo--Mori quantum Fisher information metric. The other side follows from the existence of index achieving pure state with respect to a general conditional expectation. Our results extend to the complete entropy contraction rate, tensor stable estimates for product dynamics. Examples include quantum depolarization, dephasing, and compact group symmetrization, with consequences for the decay rate of coherence and asymmetry.

quant-pharXiv:2608.19685•Aug 21, 2026•5 citations

Exact Information Contraction and Nonvanishing Divergence for Finite Quantum Channels

Ying Xie

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.

•Nov 9, 2026•0 citations

A Generalized Stein Lemma for Quantum Channels

Minbo Gao, Zhengfeng Ji, Chenghua Liu

We prove a generalized quantum Stein lemma for parallel discrimination of an arbitrary finite-dimensional channel against families of alternative channels. The alternatives are compact and convex, closed under tensor products, and contain a faithful replacer. At every fixed type-I error tolerance, the optimal type-II error exponent equals the regularized Umegaki channel relative entropy minimized over the alternatives, and both defining limits exist. Inputs may be entangled across channel uses and with a reference system. The main technical result constructs exactly trace-preserving approximations with exponentially small diamond error, dominated in completely positive order by free channels at every rate above the common exponent. The proof combines uniform auxiliary map approximation, iterative reduction of the domination rate, and tensor amplification. It yields asymptotic equipartition with trace-preserving smoothing at every subexponentially vanishing error, an exponential strong converse, and stability under vanishing diamond-norm perturbations. Under additional permutation invariance and closure under insertion of a fixed faithful input state and discarding of its output, we also prove an explicit finite-block completion bound. This quantitative construction uses weighted discarding, local operator corrections, and comparison with auxiliary extensions. Applications include state-preserving, coherence-restricted, covariant, entanglement-breaking, and positive-partial-transpose channels. For isometric targets against entanglement-breaking or positive-partial-transpose alternatives, we obtain exact finite-block testing and smoothing formulas.

quant-pharXiv:2609.30762•Sep 28, 2026•1 citation

Exact Reference-Assisted Entropy Contraction from the Choi Matrix

Harjas Sandhu

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.

•Nov 14, 2026•0 citations
We determine the complete equal-reference Umegaki relative-entropy contraction coefficient of every finite classical channel. For a column-stochastic matrix K with n ≥ 2 inputs, let J consist of the output rows positive in every column. The coefficient is η_c(K) = 1 − min_{p ∈ Δ_n} ∑{y ∈ J} (∑{i=1}^n p_i/K_{yi})⁻¹. The upper bound follows from a dimension-independent residual inequality and the integral representation of the Bogoliubov–Kubo–Mori metric. A weighted simplex construction gives matching faithful state pairs with equal classical and reference marginals; reference dimension n suffices for the supremum. The convergence is pointwise in the channel and weight parameters, with input relative entropy tending to zero. The construction gives no capacity or fixed-error operational guarantee. The complementary loss is the exponential of the negative left order-two Rényi radius of the channel columns. It therefore obeys an exact product law, giving η_c(K ⊗ L) = 1 − (1 − η_c(K))(1 − η_c(L)) even when the optimizing hypotheses may be correlated across uses. We also prove the sharp comparison η_D(K) ≤ η_c(K) ≤ min{1, (n − 1)η_D(K)} with ordinary classical contraction. Exact rational bounds and finite state-pair certificates accompany the analytic proofs. An accompanying three-view visualization guides the reader through the discovery route, proof dependencies, and provenance.
We determine the complete equal-reference Umegaki relative-entropy contraction coefficient of every finite preparation channel after input dephasing. For prepared states ρ₁, …, ρₙ, let H be the intersection of their supports and let Aᵢ be the compression of ρᵢ⁺ to H. If H is nonzero, the coefficient is 1 − min over p in Δₙ of Tr_H[(Σᵢ pᵢAᵢ)⁻¹]; it equals one when H is zero. A noncommutative metric inequality gives the upper bound, and a weighted operator-simplex construction gives matching faithful classical–quantum input pairs with equal classical and reference marginals. Reference dimension n suffices for the supremum. The complementary coefficient is the reciprocal of an exponential left order-two Petz–Rényi radius and is multiplicative under Cartesian products. Faithful binary-input qubit-output channels can consequently have complete coefficient tending to one while their ordinary coefficient tends to zero, with reference dimension two sufficient throughout. An exact rational example has complete coefficient 9/41. The matching input family converges pointwise, has input relative entropy tending to zero, and can converge logarithmically slowly; it provides no fixed-error or capacity conclusion. A visual guide records the mathematical routes, proof dependencies, and provenance of the result.
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.
We establish upper and lower bounds for relative entropy contraction of generalized quantum depolarizing channels and semigroups. Our bound provides tight first order asymptotic of the contraction rate in terms of the dimension constant. One side estimate are based on sharp reverse ratio and convexity of relative entropy of two states, which can be derived from the recently introduced Hockey-Stick quantum fff-divergence, and also independently, Bogoliubov--Kubo--Mori quantum Fisher information metric. The other side follows from the existence of index achieving pure state with respect to a general conditional expectation. Our results extend to the complete entropy contraction rate, tensor stable estimates for product dynamics. Examples include quantum depolarization, dephasing, and compact group symmetrization, with consequences for the decay rate of coherence and asymmetry.
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.
We prove a generalized quantum Stein lemma for parallel discrimination of an arbitrary finite-dimensional channel against families of alternative channels. The alternatives are compact and convex, closed under tensor products, and contain a faithful replacer. At every fixed type-I error tolerance, the optimal type-II error exponent equals the regularized Umegaki channel relative entropy minimized over the alternatives, and both defining limits exist. Inputs may be entangled across channel uses and with a reference system. The main technical result constructs exactly trace-preserving approximations with exponentially small diamond error, dominated in completely positive order by free channels at every rate above the common exponent. The proof combines uniform auxiliary map approximation, iterative reduction of the domination rate, and tensor amplification. It yields asymptotic equipartition with trace-preserving smoothing at every subexponentially vanishing error, an exponential strong converse, and stability under vanishing diamond-norm perturbations. Under additional permutation invariance and closure under insertion of a fixed faithful input state and discarding of its output, we also prove an explicit finite-block completion bound. This quantitative construction uses weighted discarding, local operator corrections, and comparison with auxiliary extensions. Applications include state-preserving, coherence-restricted, covariant, entanglement-breaking, and positive-partial-transpose channels. For isometric targets against entanglement-breaking or positive-partial-transpose alternatives, we obtain exact finite-block testing and smoothing formulas.
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.