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

arXiv:1508.07021 · Journal of Mathematical Physics

Relative entropy convergence for depolarizing channels

Alexander Müller‐Hermes, Daniel Stilck França, Michael M. Wolf

Published Jan 20, 2016• 50 citations
arXivHTMLPDF

Abstract

We study the convergence of states under continuous-time depolarizing channels with full rank fixed points in terms of the relative entropy. The optimal exponent of an upper bound on the relative entropy in this case is given by the log-Sobolev-1 constant. Our main result is the computation of this constant. As an application, we use the log-Sobolev-1 constant of the depolarizing channels to improve the concavity inequality of the von Neumann entropy. This result is compared to similar bounds obtained recently by Kim and we show a version of Pinsker’s inequality, which is optimal and tight if we fix the second argument of the relative entropy. Finally, we consider the log-Sobolev-1 constant of tensor-powers of the completely depolarizing channel and use a quantum version of Shearer’s inequality to prove a uniform lower bound.

DOI
10.1063/1.4939560

Related papers

Log-Sobolev inequality, von Neumann entropy and Entanglement of Formation

A. S. Holevo, M. E. Shirokov

We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state $ρ$ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality $\,S(ρ)-S(σ)\leq C_ρ(1-F(ρ,σ))\,$ valid for any state $σ$, where $C_ρ$ is a constant depending on the rank of $ρ$. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state $ρ$ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality $\,E_F(ρ)-E_F(σ)\leq C_ρ(1-\mathrm{Tr}ρσ)\,$ valid for any state $σ$, where $C_ρ$ is a constant depending on the Schmidt rank of $ρ$. In both cases the optimal constant $C_ρ$ is equal to the optimal constant $K_{d}$ in the log-Sobolev inequality for the complete graph with $d$ vertices: in the first case $d=\mathrm{rank}ρ$, in the second one $d=\mathrm{rank}ρ_A=\mathrm{rank}ρ_B$. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.

quant-pharXiv:2609.12667•Sep 14, 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•0 citations

Tightening Continuity Bounds for Entropies and Bounds on Quantum Capacities

Michael G. Jabbour, Nilanjana Datta

Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between probability distributions or quantum states, typically, the total variation- or trace distance. However, if an additional distance measure is known, the continuity bounds can be significantly strengthened. Here, we prove a tight uniform continuity bound for the Shannon entropy in terms of both the local- and total variation distances, sharpening an inequality in (Sason, 2013). We also obtain a uniform continuity bound for the von Neumann entropy in terms of both the operator norm- and trace distances. We then apply our results to compute upper bounds on channel capacities. We first refine the concept of approximate degradable channels by introducing$(\varepsilon ,\nu)$–degradable channels. These are$\varepsilon $–close in diamond norm and$\nu $–close in completely bounded spectral norm to their complementary channel when composed with a degrading channel. This leads to improved upper bounds to the quantum- and private classical capacities of such channels. Moreover, these bounds can be further improved by considering certain unstabilized versions of the above norms. We show that upper bounds on the latter can be efficiently expressed as semidefinite programs. As an application, we obtain a new upper bound on the quantum capacity of the qubit depolarizing channel.

arXiv:2310.17329•IEEE Journal on Selected Areas in Information Theory•Jan 1, 2024•3 citations

Relating Entropies of Quantum Channels

Dariusz Kurzyk, Łukasz Pawela, Zbigniew Puchała

In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi-Jamiołkowski state. The second one is based on the relative entropy of the output of the extended channel relative to the output of the extended completely depolarizing channel. This entropy then needs to be optimized over all possible input states. Our results first show that the former entropy provides an upper bound on the latter. Next, we show that for unital qubit channels, this bound is saturated. Finally, we conjecture and provide numerical intuitions that the bound can also be saturated for random channels as their dimension tends to infinity.

arXiv:2106.09629•Entropy•Aug 10, 2021•3 citations

Entropy production of doubly stochastic quantum channels

Alexander Müller‐Hermes, Daniel Stilck França, Michael M. Wolf

We study the entropy increase of quantum systems evolving under primitive, doubly stochastic Markovian noise and thus converging to the maximally mixed state. This entropy increase can be quantified by a logarithmic-Sobolev constant of the Liouvillian generating the noise. We prove a universal lower bound on this constant that stays invariant under taking tensor-powers. Our methods involve a new comparison method to relate logarithmic-Sobolev constants of different Liouvillians and a technique to compute logarithmic-Sobolev inequalities of Liouvillians with eigenvectors forming a projective representation of a finite abelian group. Our bounds improve upon similar results established before and as an application we prove an upper bound on continuous-time quantum capacities. In the last part of this work we study entropy production estimates of discrete-time doubly stochastic quantum channels by extending the framework of discrete-time logarithmic-Sobolev inequalities to the quantum case.

arXiv:1505.04678•Journal of Mathematical Physics•Feb 1, 2016•36 citations

Spectral methods for entropy contraction coefficients

Li Gao, Cambyse Rouzé

We propose a conceptually simple method for proving various entropic inequalities by means of spectral estimates. Our approach relies on a two-sided estimate of the relative entropy between two quantum states in terms of certain variance-type quantities. As an application of this estimate, we answer three important problems in quantum information theory and dissipative quantum systems that were left open until now: first, we prove the existence of strictly contractive constants for the strong data processing inequality for quantum channels that satisfy a notion of detailed balance. Second, we prove the existence of the complete modified logarithmic Sobolev constant which controls the exponential entropic convergence of a quantum Markov semigroup towards its equilibrium. Third, we prove a new generalization of the strong subadditivity of the entropy for the relative entropy distance to a von Neumann algebra under a specific gap condition. All the three results obtained are independent of the size of the environment.

•Feb 8, 2021•3 citations
We study the convergence of states under continuous-time depolarizing channels with full rank fixed points in terms of the relative entropy. The optimal exponent of an upper bound on the relative entropy in this case is given by the log-Sobolev-1 constant. Our main result is the computation of this constant. As an application, we use the log-Sobolev-1 constant of the depolarizing channels to improve the concavity inequality of the von Neumann entropy. This result is compared to similar bounds obtained recently by Kim and we show a version of Pinsker’s inequality, which is optimal and tight if we fix the second argument of the relative entropy. Finally, we consider the log-Sobolev-1 constant of tensor-powers of the completely depolarizing channel and use a quantum version of Shearer’s inequality to prove a uniform lower bound.
We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state ρρρ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality  S(ρ)−S(σ)≤Cρ(1−F(ρ,σ)) \,S(ρ)-S(σ)\leq C_ρ(1-F(ρ,σ))\,S(ρ)−S(σ)≤Cρ​(1−F(ρ,σ)) valid for any state σσσ, where CρC_ρCρ​ is a constant depending on the rank of ρρρ. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state ρρρ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality  EF(ρ)−EF(σ)≤Cρ(1−Trρσ) \,E_F(ρ)-E_F(σ)\leq C_ρ(1-\mathrm{Tr}ρσ)\,EF​(ρ)−EF​(σ)≤Cρ​(1−Trρσ) valid for any state σσσ, where CρC_ρCρ​ is a constant depending on the Schmidt rank of ρρρ. In both cases the optimal constant CρC_ρCρ​ is equal to the optimal constant KdK_{d}Kd​ in the log-Sobolev inequality for the complete graph with ddd vertices: in the first case d=rankρd=\mathrm{rank}ρd=rankρ, in the second one d=rankρA=rankρBd=\mathrm{rank}ρ_A=\mathrm{rank}ρ_Bd=rankρA​=rankρB​. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.
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.
Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between probability distributions or quantum states, typically, the total variation- or trace distance. However, if an additional distance measure is known, the continuity bounds can be significantly strengthened. Here, we prove a tight uniform continuity bound for the Shannon entropy in terms of both the local- and total variation distances, sharpening an inequality in (Sason, 2013). We also obtain a uniform continuity bound for the von Neumann entropy in terms of both the operator norm- and trace distances. We then apply our results to compute upper bounds on channel capacities. We first refine the concept of approximate degradable channels by introducing(ε,ν)(\varepsilon ,\nu)(ε,ν)–degradable channels. These are$\varepsilon –closeindiamondnormand–close in diamond norm and–closeindiamondnormand\nu $–close in completely bounded spectral norm to their complementary channel when composed with a degrading channel. This leads to improved upper bounds to the quantum- and private classical capacities of such channels. Moreover, these bounds can be further improved by considering certain unstabilized versions of the above norms. We show that upper bounds on the latter can be efficiently expressed as semidefinite programs. As an application, we obtain a new upper bound on the quantum capacity of the qubit depolarizing channel.
In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi-Jamiołkowski state. The second one is based on the relative entropy of the output of the extended channel relative to the output of the extended completely depolarizing channel. This entropy then needs to be optimized over all possible input states. Our results first show that the former entropy provides an upper bound on the latter. Next, we show that for unital qubit channels, this bound is saturated. Finally, we conjecture and provide numerical intuitions that the bound can also be saturated for random channels as their dimension tends to infinity.
We study the entropy increase of quantum systems evolving under primitive, doubly stochastic Markovian noise and thus converging to the maximally mixed state. This entropy increase can be quantified by a logarithmic-Sobolev constant of the Liouvillian generating the noise. We prove a universal lower bound on this constant that stays invariant under taking tensor-powers. Our methods involve a new comparison method to relate logarithmic-Sobolev constants of different Liouvillians and a technique to compute logarithmic-Sobolev inequalities of Liouvillians with eigenvectors forming a projective representation of a finite abelian group. Our bounds improve upon similar results established before and as an application we prove an upper bound on continuous-time quantum capacities. In the last part of this work we study entropy production estimates of discrete-time doubly stochastic quantum channels by extending the framework of discrete-time logarithmic-Sobolev inequalities to the quantum case.
We propose a conceptually simple method for proving various entropic inequalities by means of spectral estimates. Our approach relies on a two-sided estimate of the relative entropy between two quantum states in terms of certain variance-type quantities. As an application of this estimate, we answer three important problems in quantum information theory and dissipative quantum systems that were left open until now: first, we prove the existence of strictly contractive constants for the strong data processing inequality for quantum channels that satisfy a notion of detailed balance. Second, we prove the existence of the complete modified logarithmic Sobolev constant which controls the exponential entropic convergence of a quantum Markov semigroup towards its equilibrium. Third, we prove a new generalization of the strong subadditivity of the entropy for the relative entropy distance to a von Neumann algebra under a specific gap condition. All the three results obtained are independent of the size of the environment.