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

Reverse relative entropy and finite-time contraction for conditional expectations

Christoph Hartmann

Published Sep 29, 2026• 0 citations
Publisher

Abstract

This preprint proves reverse relative entropy and finite-time contraction inequalities for trace-preserving conditional expectations on finite-dimensional matrix algebras. A spectral-block reduction for an algebra-valued multiplier and a scalar boundary reduction yield explicit constants gamma_C and Lambda_p(C). Complete bounds follow from complete order bounds. For qubit depolarization, the results give 0.940046944825 <= alpha_c < 0.954706390024 in the convention exp(-2 alpha t), and 0.265671889879 < eta_c < 0.270961852526 at retained weight p=1/2. The contraction coefficient compares each state with its own conditional-expectation equilibrium. The paper also proves a stronger bound for commuting states, with sharpness in specified classes, and derives consequences for products of local channels. The exact complete qubit constants and the unrestricted sharp ensemble inequality are not determined here. The accompanying archive contains LaTeX sources, exact inputs, symbolic and interval verifiers, numerical regression checks, and reproduced outputs. Developed with AI assistance; not peer reviewed or formally verified. Companion paper: Christoph Hartmann, Sharp reverse entropy inequalities for uniform qubit ensembles (2026).

DOI
10.5281/zenodo.23035262

Related papers

Sharp reverse entropy inequalities for uniform qubit ensembles

Christoph Hartmann

This computer-assisted preprint proves a sharp reverse relative entropy inequality L >= beta_m chi for uniform ensembles of individually normalized qubit states, for every m >= 2. Here chi is the Holevo quantity and L is the non-optimized quantum lautum information. The proof combines analytic Bloch-vector and Gram-matrix reductions with four interval certificates covering 855,780 boxes. For three matrices in arbitrary finite dimension, the paper also establishes local nonnegativity near faithful pairwise-commuting equality triples, allowing unequal traces and noncommuting perturbations. Further results include normalization bridges, an angular reduction for three qubits, and certified obstructions to proposed pinching and filtering descent arguments. The unrestricted unequal-trace ensemble inequality and the general equality of complete and ordinary modified logarithmic Sobolev constants are not proved. The accompanying archive contains sources, certificate inputs, verifiers, and reproduced results. Developed with AI assistance; not peer reviewed or formally verified. Companion paper: Christoph Hartmann, Reverse relative entropy and finite-time contraction for conditional expectations (2026).

•Sep 29, 2026•0 citations

Exact Complete Relative-Entropy Contraction of Finite Classical Channels

Ying Xie

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.

•Nov 6, 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 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

Complete entropy contraction from conditional hyperboundedness

Li Gao, Lijun Wang

For finite-dimensional quantum channels compatible with a faithful conditional expectation, we show that conditional hyperboundedness and strict GNS contraction together yield a relative entropy contraction. For KMS-symmetric quantum Markov semigroups, a conditional $2\to q$ hyperboundedness at time $t_0>0$ combined with a GNS gap $λ>0$ implies a modified logarithmic Sobolev constant \[ α=\frac{λ(1-2/q)} {12(λt_0+\log M+1-2/q)},\] where $M$ is the hyperboundedness constant. As a consequence, completely bounded hyperboundedness over auxiliary systems gives complete versions of entropy contraction with the same rates.

quant-pharXiv:2610.35863•Oct 27, 2026•0 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
This preprint proves reverse relative entropy and finite-time contraction inequalities for trace-preserving conditional expectations on finite-dimensional matrix algebras. A spectral-block reduction for an algebra-valued multiplier and a scalar boundary reduction yield explicit constants gamma_C and Lambda_p(C). Complete bounds follow from complete order bounds. For qubit depolarization, the results give 0.940046944825 <= alpha_c < 0.954706390024 in the convention exp(-2 alpha t), and 0.265671889879 < eta_c < 0.270961852526 at retained weight p=1/2. The contraction coefficient compares each state with its own conditional-expectation equilibrium. The paper also proves a stronger bound for commuting states, with sharpness in specified classes, and derives consequences for products of local channels. The exact complete qubit constants and the unrestricted sharp ensemble inequality are not determined here. The accompanying archive contains LaTeX sources, exact inputs, symbolic and interval verifiers, numerical regression checks, and reproduced outputs. Developed with AI assistance; not peer reviewed or formally verified. Companion paper: Christoph Hartmann, Sharp reverse entropy inequalities for uniform qubit ensembles (2026).
This computer-assisted preprint proves a sharp reverse relative entropy inequality L >= beta_m chi for uniform ensembles of individually normalized qubit states, for every m >= 2. Here chi is the Holevo quantity and L is the non-optimized quantum lautum information. The proof combines analytic Bloch-vector and Gram-matrix reductions with four interval certificates covering 855,780 boxes. For three matrices in arbitrary finite dimension, the paper also establishes local nonnegativity near faithful pairwise-commuting equality triples, allowing unequal traces and noncommuting perturbations. Further results include normalization bridges, an angular reduction for three qubits, and certified obstructions to proposed pinching and filtering descent arguments. The unrestricted unequal-trace ensemble inequality and the general equality of complete and ordinary modified logarithmic Sobolev constants are not proved. The accompanying archive contains sources, certificate inputs, verifiers, and reproduced results. Developed with AI assistance; not peer reviewed or formally verified. Companion paper: Christoph Hartmann, Reverse relative entropy and finite-time contraction for conditional expectations (2026).
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 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 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.
For finite-dimensional quantum channels compatible with a faithful conditional expectation, we show that conditional hyperboundedness and strict GNS contraction together yield a relative entropy contraction. For KMS-symmetric quantum Markov semigroups, a conditional 2→q2\to q2→q hyperboundedness at time t0>0t_0>0t0​>0 combined with a GNS gap λ>0λ>0λ>0 implies a modified logarithmic Sobolev constant α=λ(1−2/q)12(λt0+log⁡M+1−2/q), α=\frac{λ(1-2/q)} {12(λt_0+\log M+1-2/q)},α=12(λt0​+logM+1−2/q)λ(1−2/q)​, where MMM is the hyperboundedness constant. As a consequence, completely bounded hyperboundedness over auxiliary systems gives complete versions of entropy contraction with the same rates.
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.