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:2101.10312 · IEEE International Symposium on Information Theory (ISIT)

Weak Quasi-Factorization for the Belavkin-Staszewski Relative Entropy

Andreas Blühm, Ángela Capel, Antonio Pérez

Published Jul 12, 2021• 6 citations
arXivHTMLPDF

Abstract

Quasi-factorization-type inequalities for the relative entropy have recently proven to be fundamental in modern proofs of modified logarithmic Sobolev inequalities for quantum spin systems. In this paper, we show some results of weak quasi-factorization for the Belavkin-Staszewski relative entropy, i.e. upper bounds for the BS-entropy between two bipartite states in terms of the sum of two conditional BS-entropies, up to some multiplicative and additive factors. A more detailed version of this paper is accessible at: https://arxiv.org/pdf/2101.10312.pdf

DOI
10.1109/isit45174.2021.9517893

Related papers

Belavkin–Staszewski Relative Entropy, Conditional Entropy, and Mutual Information

Yuan Zhai, Bo Yang, Zhengjun Xi

Belavkin-Staszewski relative entropy can naturally characterize the effects of the possible noncommutativity of quantum states. In this paper, two new conditional entropy terms and four new mutual information terms are first defined by replacing quantum relative entropy with Belavkin-Staszewski relative entropy. Next, their basic properties are investigated, especially in classical-quantum settings. In particular, we show the weak concavity of the Belavkin-Staszewski conditional entropy and obtain the chain rule for the Belavkin-Staszewski mutual information. Finally, the subadditivity of the Belavkin-Staszewski relative entropy is established, i.e., the Belavkin-Staszewski relative entropy of a joint system is less than the sum of that of its corresponding subsystems with the help of some multiplicative and additive factors. Meanwhile, we also provide a certain subadditivity of the geometric Rényi relative entropy.

Entropy•Jun 17, 2022•8 citations

Approximate Tensorization of the Relative Entropy for Noncommuting Conditional Expectations

Ivan Bardet, Ángela Capel, Cambyse Rouzé

Abstract In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. This generalisation, referred to as approximate tensorization of the relative entropy, consists in a lower bound for the sum of relative entropies between a given density and its respective projections onto two intersecting von Neumann algebras in terms of the relative entropy between the same density and its projection onto an algebra in the intersection, up to multiplicative and additive constants. In particular, our inequality reduces to the so-called quasi-factorization of the entropy for commuting algebras, which is a key step in modern proofs of the logarithmic Sobolev inequality for classical lattice spin systems. We also provide estimates on the constants in terms of conditions of clustering of correlations in the setting of quantum lattice spin systems. Along the way, we show the equivalence between conditional expectations arising from Petz recovery maps and those of general Davies semigroups.

arXiv:2001.07981•Annales Henri Poincaré•Jul 31, 2021•16 citations

Quasi-factorization and Multiplicative Comparison of Subalgebra-Relative Entropy

Nicholas LaRacuente

Purely multiplicative comparisons of quantum relative entropy are desirable but challenging to prove. We show such comparisons for relative entropies between comparable densities, including the relative entropy of a density with respect to its subalgebraic restriction. These inequalities are asymptotically tight in approaching known, tight inequalities as perturbation size approaches zero. Based on these results, we obtain a kind of inequality known as quasi-factorization or approximate tensorization of relative entropy. Quasi-factorization lower bounds the sum of a density's relative entropies to several subalgebraic restrictions in terms of its relative entropy to their intersection's subalgebraic restriction. As applications, quasi-factorization implies uncertainty-like relations, and with an iteration trick, it yields decay estimates of optimal asymptotic order on mixing processes described by finite, connected, undirected graphs.

quant-pharXiv:1912.00983•Journal of Mathematical Physics•Dec 3, 2019•10 citations

A strengthened data processing inequality for the Belavkin–Staszewski relative entropy

Andreas Blühm, Ángela Capel

In this work, we provide a strengthening of the data processing inequality for the relative entropy introduced by Belavkin and Staszewski (BS-entropy). This extends previous results by Carlen and Vershynina for the relative entropy and other standard [Formula: see text]-divergences. To this end, we provide two new equivalent conditions for the equality case of the data processing inequality for the BS-entropy. Subsequently, we extend our result to a larger class of maximal [Formula: see text]-divergences. Here, we first focus on quantum channels which are conditional expectations onto subalgebras and use the Stinespring dilation to lift our results to arbitrary quantum channels.

arXiv:1904.10768•Reviews in Mathematical Physics•Aug 22, 2019•14 citations

Quantum conditional relative entropy and quasi-factorization of the relative entropy

Ángela Capel, Angelo Lucia, David Pérez-García

Abstract The existence of a positive log-Sobolev constant implies a bound on the mixing time of a quantum dissipative evolution under the Markov approximation. For classical spin systems, such constant was proven to exist, under the assumption of a mixing condition in the Gibbs measure associated to their dynamics, via a quasi-factorization of the entropy in terms of the conditional entropy in some sub- σ -algebras. In this work we analyze analogous quasi-factorization results in the quantum case. For that, we define the quantum conditional relative entropy and prove several quasi-factorization results for it. As an illustration of their potential, we use one of them to obtain a positive log-Sobolev constant for the heat-bath dynamics with product fixed point.

arXiv:1804.09525•Journal of Physics A Mathematical and Theoretical•Sep 27, 2018•26 citations

Modified logarithmic Sobolev inequality for 1D non-commuting Hamiltonians

Ángela Capel, David Pérez-García, Matteo Scandi

Given a finite-range, non-commuting Hamiltonian on a 1D chain of finite spins, we prove a modified logarithmic Sobolev inequality with constant $Ω(1/\log n)$ for the heat-bath dynamics, a quasi-local Gibbs sampler, and for the regularised heat-bath dynamics. This implies rapid mixing of both samplers towards the Gibbs state in relative entropy and trace norm, with mixing times of order $\mathcal{O}(\log n\cdot \log(n/ε))$. The interactions may be spatially inhomogeneous. The proof combines weak quasi-factorisation of relative entropy, decay-of-correlation estimates, a uniform conditional local gap, and a buffered comparison between conditional entropy and quadratic energy. The resulting bounded entropy defect is removed using the global gap. To the best of our knowledge, this is the first proof of MLSI in the non-commuting regime.

quant-pharXiv:2610.03683•Oct 5, 2026•0 citations
Quasi-factorization-type inequalities for the relative entropy have recently proven to be fundamental in modern proofs of modified logarithmic Sobolev inequalities for quantum spin systems. In this paper, we show some results of weak quasi-factorization for the Belavkin-Staszewski relative entropy, i.e. upper bounds for the BS-entropy between two bipartite states in terms of the sum of two conditional BS-entropies, up to some multiplicative and additive factors. A more detailed version of this paper is accessible at: https://arxiv.org/pdf/2101.10312.pdf
Belavkin-Staszewski relative entropy can naturally characterize the effects of the possible noncommutativity of quantum states. In this paper, two new conditional entropy terms and four new mutual information terms are first defined by replacing quantum relative entropy with Belavkin-Staszewski relative entropy. Next, their basic properties are investigated, especially in classical-quantum settings. In particular, we show the weak concavity of the Belavkin-Staszewski conditional entropy and obtain the chain rule for the Belavkin-Staszewski mutual information. Finally, the subadditivity of the Belavkin-Staszewski relative entropy is established, i.e., the Belavkin-Staszewski relative entropy of a joint system is less than the sum of that of its corresponding subsystems with the help of some multiplicative and additive factors. Meanwhile, we also provide a certain subadditivity of the geometric Rényi relative entropy.
Abstract In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. This generalisation, referred to as approximate tensorization of the relative entropy, consists in a lower bound for the sum of relative entropies between a given density and its respective projections onto two intersecting von Neumann algebras in terms of the relative entropy between the same density and its projection onto an algebra in the intersection, up to multiplicative and additive constants. In particular, our inequality reduces to the so-called quasi-factorization of the entropy for commuting algebras, which is a key step in modern proofs of the logarithmic Sobolev inequality for classical lattice spin systems. We also provide estimates on the constants in terms of conditions of clustering of correlations in the setting of quantum lattice spin systems. Along the way, we show the equivalence between conditional expectations arising from Petz recovery maps and those of general Davies semigroups.
Purely multiplicative comparisons of quantum relative entropy are desirable but challenging to prove. We show such comparisons for relative entropies between comparable densities, including the relative entropy of a density with respect to its subalgebraic restriction. These inequalities are asymptotically tight in approaching known, tight inequalities as perturbation size approaches zero. Based on these results, we obtain a kind of inequality known as quasi-factorization or approximate tensorization of relative entropy. Quasi-factorization lower bounds the sum of a density's relative entropies to several subalgebraic restrictions in terms of its relative entropy to their intersection's subalgebraic restriction. As applications, quasi-factorization implies uncertainty-like relations, and with an iteration trick, it yields decay estimates of optimal asymptotic order on mixing processes described by finite, connected, undirected graphs.
In this work, we provide a strengthening of the data processing inequality for the relative entropy introduced by Belavkin and Staszewski (BS-entropy). This extends previous results by Carlen and Vershynina for the relative entropy and other standard [Formula: see text]-divergences. To this end, we provide two new equivalent conditions for the equality case of the data processing inequality for the BS-entropy. Subsequently, we extend our result to a larger class of maximal [Formula: see text]-divergences. Here, we first focus on quantum channels which are conditional expectations onto subalgebras and use the Stinespring dilation to lift our results to arbitrary quantum channels.
Abstract The existence of a positive log-Sobolev constant implies a bound on the mixing time of a quantum dissipative evolution under the Markov approximation. For classical spin systems, such constant was proven to exist, under the assumption of a mixing condition in the Gibbs measure associated to their dynamics, via a quasi-factorization of the entropy in terms of the conditional entropy in some sub- σ -algebras. In this work we analyze analogous quasi-factorization results in the quantum case. For that, we define the quantum conditional relative entropy and prove several quasi-factorization results for it. As an illustration of their potential, we use one of them to obtain a positive log-Sobolev constant for the heat-bath dynamics with product fixed point.
Given a finite-range, non-commuting Hamiltonian on a 1D chain of finite spins, we prove a modified logarithmic Sobolev inequality with constant Ω(1/log⁡n)Ω(1/\log n)Ω(1/logn) for the heat-bath dynamics, a quasi-local Gibbs sampler, and for the regularised heat-bath dynamics. This implies rapid mixing of both samplers towards the Gibbs state in relative entropy and trace norm, with mixing times of order O(log⁡n⋅log⁡(n/ε))\mathcal{O}(\log n\cdot \log(n/ε))O(logn⋅log(n/ε)). The interactions may be spatially inhomogeneous. The proof combines weak quasi-factorisation of relative entropy, decay-of-correlation estimates, a uniform conditional local gap, and a buffered comparison between conditional entropy and quadratic energy. The resulting bounded entropy defect is removed using the global gap. To the best of our knowledge, this is the first proof of MLSI in the non-commuting regime.