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:2001.07981 · Annales Henri Poincaré

Approximate Tensorization of the Relative Entropy for Noncommuting Conditional Expectations

Ivan Bardet, Ángela Capel, Cambyse Rouzé

Published Jul 31, 2021• 16 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1007/s00023-021-01088-3

Related papers

Adjusted Subadditivity of Relative Entropy for Non-commuting Conditional Expectations

Nicholas D. LaRacuente

If a set of von Neumann subalgebras has a trivial intersection in finite dimension, then the sum of relative entropies of a given density to its projection in each such algebra is larger than a multiple of its relative entropy to its projection in the trivial intersection. This results in a subadditivity of relative entropy with a dimension and algebra-dependent, multiplicative constant. As a primary application, this inequality lets us derive relative entropy decay estimates in the form of modified logarithmic-Sobolev inequalities for complicated quantum Markov semigroups from those of simpler constituents.

•Dec 2, 2019•1 citation

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•39 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

Approximate Recovery and Relative Entropy I: General von Neumann Subalgebras

Thomas Faulkner, Stefan Hollands, Brian G. Swingle +1 more

Abstract We prove the existence of a universal recovery channel that approximately recovers states on a von Neumann subalgebra when the change in relative entropy, with respect to a fixed reference state, is small. Our result is a generalization of previous results that applied to type-I von Neumann algebras by Junge at al. [ arXiv:1509.07127 ]. We broadly follow their proof strategy but consider here arbitrary von Neumann algebras, where qualitatively new issues arise. Our results hinge on the construction of certain analytic vectors and computations/estimations of their Araki–Masuda $$L_p$$ L p norms. We comment on applications to the quantum null energy condition.

arXiv:2006.08002•Communications in Mathematical Physics•Jan 1, 2022•25 citations

Weak Quasi-Factorization for the Belavkin-Staszewski Relative Entropy

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

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

arXiv:2101.10312•IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•6 citations

Conditioning on Subalgebras - Entropy Duality and Generalized Quantum Stein's Lemma in von Neumann Algebras

Bjarne Bergh, Li Gao, Mizanur Rahaman

We establish duality relations for conditional entropies relative to subalgebras of arbitrary von Neumann algebras, including the Umegaki relative entropy as well as the sandwiched- and Petz-Rényi divergences. Even in finite dimensions, these results extend the familiar dualities for conditional entropies from tensor-product subsystems to general subalgebras, while also lifting the framework to the fully infinite-dimensional setting. As an application, we establish an infinite-dimensional extension of quantum Stein's lemma when the alternative hypothesis is the state space of a finite-index subalgebra, which gives an operational interpretation of the relative entropy to a subalgebra as the optimal asymptotic error exponent in composite quantum hypothesis testing-the first beyond finite dimensions.

quant-pharXiv:2610.00772•Oct 2, 2026•0 citations
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.
If a set of von Neumann subalgebras has a trivial intersection in finite dimension, then the sum of relative entropies of a given density to its projection in each such algebra is larger than a multiple of its relative entropy to its projection in the trivial intersection. This results in a subadditivity of relative entropy with a dimension and algebra-dependent, multiplicative constant. As a primary application, this inequality lets us derive relative entropy decay estimates in the form of modified logarithmic-Sobolev inequalities for complicated quantum Markov semigroups from those of simpler constituents.
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.
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.
Abstract We prove the existence of a universal recovery channel that approximately recovers states on a von Neumann subalgebra when the change in relative entropy, with respect to a fixed reference state, is small. Our result is a generalization of previous results that applied to type-I von Neumann algebras by Junge at al. [ arXiv:1509.07127 ]. We broadly follow their proof strategy but consider here arbitrary von Neumann algebras, where qualitatively new issues arise. Our results hinge on the construction of certain analytic vectors and computations/estimations of their Araki–Masuda LpL_pLp​ L p norms. We comment on applications to the quantum null energy condition.
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
We establish duality relations for conditional entropies relative to subalgebras of arbitrary von Neumann algebras, including the Umegaki relative entropy as well as the sandwiched- and Petz-Rényi divergences. Even in finite dimensions, these results extend the familiar dualities for conditional entropies from tensor-product subsystems to general subalgebras, while also lifting the framework to the fully infinite-dimensional setting. As an application, we establish an infinite-dimensional extension of quantum Stein's lemma when the alternative hypothesis is the state space of a finite-index subalgebra, which gives an operational interpretation of the relative entropy to a subalgebra as the optimal asymptotic error exponent in composite quantum hypothesis testing-the first beyond finite dimensions.