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:1505.04678 · Journal of Mathematical Physics

Entropy production of doubly stochastic quantum channels

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

Published Feb 1, 2016• 40 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1063/1.4941136

Related papers

Quantum Entropy Contraction and Factorization from Hypercontractivity

Li Gao, Lijun Wang

We prove that hypercontractivity implies entropy contraction for a single quantum channel, without a detailed balance condition. For primitive quantum Markov semigroups that are KMS-symmetric with respect to a faithful invariant state \(σ\), we obtain the modified Log-Sobolev bound $α_1\geq \fracλ{(2+\log\|σ^{-1}\|_\infty)}$ where $λ$ is the spectral gap. This removes the assumption of \(L_p\)-regularity for the comparison through the log-Sobolev constant. As an application, we show that the hypercontractivity of an average of two conditional expectations implies the approximate tensorization of relative entropy.

quant-pharXiv:2609.20753•Sep 18, 2026

Quantum Capacities and Entropy Production of Quantum Markov Chains

Alexander Müller‐Hermes

A basic question in quantum information theory is to quantify the optimal rate of transmitting quantum information via a given quantum channel using certain coding schemes. We study this question for discrete- and continuous-time quantum Markov processes. For continuous-time processes modeling a quantum memory we introduce new capacities where coding channels may be applied during the storage time. We prove upper bounds on these quantities by studying the entropy production of quantum Markov processes.

•Jan 1, 2015•0 citations

On the nature and decay of quantum relative entropy

Nicholas D. LaRacuente

Historically at the core of thermodynamics and information theory, entropy's use in quantum information extends to diverse topics including high-energy physics and operator algebras. Entropy can gauge the extent to which a quantum system departs from classicality, including by measuring entanglement and coherence, and in the form of entropic uncertainty relations between incompatible measurements. The theme of this dissertation is the quantum nature of entropy, and how exposure to a noisy environment limits and degrades non-classical features. An especially useful and general form of entropy is the quantum relative entropy, of which special cases include the von Neumann and Shannon entropies, coherent and mutual information, and a broad range of resource-theoretic measures. We use mathematical results on relative entropy to connect and unify features that distinguish quantum from classical information. We present generalizations of the strong subadditivity inequality and uncertainty-like entropy inequalities to subalgebras of operators on quantum systems for which usual independence assumptions fail. We construct new measures of non-classicality that simultaneously quantify entanglement and uncertainty, leading to a new resource theory of operations under which these forms of non-classicalty become interchangeable. Physically, our results deepen our understanding of how quantum entanglement relates to quantum uncertainty. We show how properties of entanglement limit the advantages of quantum superadditivity for information transmission through channels with high but detectable loss. Our method, based on the monogamy and faithfulness of the squashed entanglement, suggests a broader paradigm for bounding non-classical effects in lossy processes. We also propose an experiment to demonstrate superadditivity. Finally, we estimate decay rates in the form of modified logarithmic Sobolev inequalities for a variety of quantum channels, and in many cases we obtain the stronger, tensor-stable form known as a complete logarithmic Sobolev inequality. We compare these with our earlier results that bound relative entropy of the outputs of a particular class of quantum channels.

•Jun 2, 2020•0 citations

Complete Entropic Inequalities for Quantum Markov Chains

Li Gao, Cambyse Rouzé

Abstract We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional matrix algebra satisfies a modified log-Sobolev inequality. In the discrete time setting, we prove that every finite dimensional GNS-symmetric quantum channel satisfies a strong data processing inequality with respect to its decoherence free part. Moreover, we establish the first general approximate tensorization property of the relative entropy. This extends the famous strong subadditivity of the quantum entropy (SSA) of two subsystems to the general setting of two subalgebras. All three results are independent of the size of the environment and hence satisfy the tensorization property. They are obtained via a common, conceptually simple method for proving entropic inequalities via spectral or $$L_2$$ L 2 -estimates. As an application, we combine our results on the modified log-Sobolev inequality and approximate tensorization to derive tight bounds for local generators.

arXiv:2102.04146•Archive for Rational Mechanics and Analysis•May 13, 2022•64 citations

From Qubit Tensorization to Gaussian Optimizers in Bosonic Systems

Salman Beigi, Hami Mehrabi

We develop a method for deriving Gaussian optimality results for bosonic quantum systems from inequalities for qubit systems. Inspired by Gross's derivation of the Gaussian logarithmic Sobolev inequality from an inequality on the two-point space, we use qubits as quantum two-point spaces and lift bosonic Weyl operators to pseudo-Weyl operators on large qubit systems. By controlling weighted norms and relative entropy in the fluctuation limit, we establish two transfer theorems that convert tensorized qubit inequalities into inequalities for bosonic Gaussian channels. As a first application, we prove that the sharp $2$-logarithmic Sobolev inequality for the bosonic Ornstein--Uhlenbeck semigroup tensorizes without loss in the constant. We also establish a sharp output entropy inequality for tensor powers of a class of qubit channels. This includes a quantum Mrs.~Gerber's lemma determining the minimum output entropy of tensor powers of the qubit depolarizing channel at fixed input entropy. Applying our relative entropy transfer theorem, we obtain multimode constrained minimum output entropy bounds for Gaussian additive-noise channels and thermal attenuators in the heating range.

quant-pharXiv:2610.28902•Oct 22, 2026•1 citation

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 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 prove that hypercontractivity implies entropy contraction for a single quantum channel, without a detailed balance condition. For primitive quantum Markov semigroups that are KMS-symmetric with respect to a faithful invariant state σσσ, we obtain the modified Log-Sobolev bound α1≥λ(2+log⁡∥σ−1∥∞)α_1\geq \fracλ{(2+\log\|σ^{-1}\|_\infty)}α1​≥(2+log∥σ−1∥∞​)λ​ where λλλ is the spectral gap. This removes the assumption of LpL_pLp​-regularity for the comparison through the log-Sobolev constant. As an application, we show that the hypercontractivity of an average of two conditional expectations implies the approximate tensorization of relative entropy.
A basic question in quantum information theory is to quantify the optimal rate of transmitting quantum information via a given quantum channel using certain coding schemes. We study this question for discrete- and continuous-time quantum Markov processes. For continuous-time processes modeling a quantum memory we introduce new capacities where coding channels may be applied during the storage time. We prove upper bounds on these quantities by studying the entropy production of quantum Markov processes.
Historically at the core of thermodynamics and information theory, entropy's use in quantum information extends to diverse topics including high-energy physics and operator algebras. Entropy can gauge the extent to which a quantum system departs from classicality, including by measuring entanglement and coherence, and in the form of entropic uncertainty relations between incompatible measurements. The theme of this dissertation is the quantum nature of entropy, and how exposure to a noisy environment limits and degrades non-classical features. An especially useful and general form of entropy is the quantum relative entropy, of which special cases include the von Neumann and Shannon entropies, coherent and mutual information, and a broad range of resource-theoretic measures. We use mathematical results on relative entropy to connect and unify features that distinguish quantum from classical information. We present generalizations of the strong subadditivity inequality and uncertainty-like entropy inequalities to subalgebras of operators on quantum systems for which usual independence assumptions fail. We construct new measures of non-classicality that simultaneously quantify entanglement and uncertainty, leading to a new resource theory of operations under which these forms of non-classicalty become interchangeable. Physically, our results deepen our understanding of how quantum entanglement relates to quantum uncertainty. We show how properties of entanglement limit the advantages of quantum superadditivity for information transmission through channels with high but detectable loss. Our method, based on the monogamy and faithfulness of the squashed entanglement, suggests a broader paradigm for bounding non-classical effects in lossy processes. We also propose an experiment to demonstrate superadditivity. Finally, we estimate decay rates in the form of modified logarithmic Sobolev inequalities for a variety of quantum channels, and in many cases we obtain the stronger, tensor-stable form known as a complete logarithmic Sobolev inequality. We compare these with our earlier results that bound relative entropy of the outputs of a particular class of quantum channels.
Abstract We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional matrix algebra satisfies a modified log-Sobolev inequality. In the discrete time setting, we prove that every finite dimensional GNS-symmetric quantum channel satisfies a strong data processing inequality with respect to its decoherence free part. Moreover, we establish the first general approximate tensorization property of the relative entropy. This extends the famous strong subadditivity of the quantum entropy (SSA) of two subsystems to the general setting of two subalgebras. All three results are independent of the size of the environment and hence satisfy the tensorization property. They are obtained via a common, conceptually simple method for proving entropic inequalities via spectral or L2L_2L2​ L 2 -estimates. As an application, we combine our results on the modified log-Sobolev inequality and approximate tensorization to derive tight bounds for local generators.
We develop a method for deriving Gaussian optimality results for bosonic quantum systems from inequalities for qubit systems. Inspired by Gross's derivation of the Gaussian logarithmic Sobolev inequality from an inequality on the two-point space, we use qubits as quantum two-point spaces and lift bosonic Weyl operators to pseudo-Weyl operators on large qubit systems. By controlling weighted norms and relative entropy in the fluctuation limit, we establish two transfer theorems that convert tensorized qubit inequalities into inequalities for bosonic Gaussian channels. As a first application, we prove that the sharp 222-logarithmic Sobolev inequality for the bosonic Ornstein--Uhlenbeck semigroup tensorizes without loss in the constant. We also establish a sharp output entropy inequality for tensor powers of a class of qubit channels. This includes a quantum Mrs.~Gerber's lemma determining the minimum output entropy of tensor powers of the qubit depolarizing channel at fixed input entropy. Applying our relative entropy transfer theorem, we obtain multimode constrained minimum output entropy bounds for Gaussian additive-noise channels and thermal attenuators in the heating range.
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.