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

Entropy

The Homological Nature of Entropy

Pierre Baudot, Daniel Bennequin

Published May 13, 2015• 83 citations
Publisher

Abstract

We propose that entropy is a universal co-homological class in a theory associated to a family of observable quantities and a family of probability distributions. Three cases are presented: (1) classical probabilities and random variables; (2) quantum probabilities and observable operators; (3) dynamic probabilities and observation trees. This gives rise to a new kind of topology for information processes, that accounts for the main information functions: entropy, mutual-informations at all orders, and Kullback–Leibler divergence and generalizes them in several ways. The article is divided into two parts, that can be read independently. In the first part, the introduction, we provide an overview of the results, some open questions, future results and lines of research, and discuss briefly the application to complex data. In the second part we give the complete definitions and proofs of the theorems A, C and E in the introduction, which show why entropy is the first homological invariant of a structure of information in four contexts: static classical or quantum probability, dynamics of classical or quantum strategies of observation of a finite system.

DOI
10.3390/e17053253

Related papers

Topological forms of information

Pierre Baudot, Daniel Bennequin

Abstract. We propose that entropy is a universal co-homological class in a theory associated to a family of observable quantities and a family of probability distributions. Three cases are presented: 1) classical probabilities and random variables; 2) quantum probabilities and observable operators; 3) dynamic probabilities and observation trees. This gives rise to a new kind of topology for information processes. We discuss briefly its application to complex data, in particular to the structures of information flows in biological systems. This short note summarizes results obtained during the last years by the authors. The proofs are not included, but the definitions and theorems are stated with precision.

AIP conference proceedings•Jan 1, 2015•6 citations

Generalized information structures and their cohomology

Juan Pablo Vigneaux

Baudot and Bennequin introduced a cohomological construction adapted to information theory, called \emph{information cohomology}; it characterizes Shannon entropy as the only nontrivial cohomology class in degree one, for suitable coefficients. This text develops the relation between information cohomology and topos theory. To this end, we redefine information structures, as categories of random variables related by a notion of extension or refinement; classical and quantum probability spaces appear as models (or representations) of them. These generalized information structures form a category with finite products and coproducts. Information cohomology is a derived functor in the abelian category of modules over an algebra of random variables, a subcategory of the presheaf topos associated with the information structure. The cohomology is invariant under isomorphisms of generalized structures. We prove that the relatively free bar construction gives a projective object for the computation of this invariant. We provide detailed computations of $H^0$ and $H^1$ when the coefficients are functionals of classical probabilities, including the degenerate cases. In the process, we also establish the homological nature of Tsallis entropies, as the only cocycles in degree one for certain one-parameter family of modules.

Theory and applications of categories•Sep 22, 2017•4 citations

Classical and quantum relative entropy

Patrícia Szokol

The concept of entropy rst arose in the study of thermodynamics and statistical me- chanics. In information theory the so-called Shannon entropy plays a signi cant role, which measures how much information we gain, on average, when we learn the value of a random variable. An alternative interpretation is that the entropy of the random variable quanti es the amount of uncertainty about the random variable before we learn its value. The concept was introduced by Claude E. Shannon in his 1948 paper "A Mathematical Theory of Communication". In the rst part of the present work we consider this fundamental measure of information and show some of its properties, such as non-negativity. The relative entropy or the Kullback-Leibler divergence is a very useful measure of the distance between two prob- ability distributions. After introducing its de nition and other notions (joint entropy, conditional entropy or mutual information) we can prove additional assertions about the Shannon entropy and present statements about the relations between the above men- tioned quantities. In quantum information theory, there is a quantity, namely von Neumann entropy, which corresponds to Shannon entropy and originates from it. In the section Von Neu- mann entropy we will introduce this quantity which is a continuous functional on the states, or on their mathematical representatives, the density operators, and it ful ls in- equalities such as subadditivity and strong subaddititvity. Just as with the Shannon entropy, it is extremely useful to de ne a quantum version of the relative entropy, which is one of the most important numerical quantities appearing in quantum information theory. It is used as a measure of distinguishability between quantum states. Among others its properties are jointly convexity, monotonicity which are speci cally convenient. Transformations on structures which preserve operations, quantities or relations among elements appear in many areas of mathematics. These are the so-called preservers which show up also in physics and even in chemistry where they are usually called symmetries. Therefore, the study of preserver transformations is an important area of research. The third section of this work is based on a paper, in which Lajos Molnár described the structure every bijective map on the space of all density operators on a given Hilbert space, which preserves the relative entropy. This result is closely related to Wigner's famous theorem on the form of quantum mechanical symmetry transformations. The above theorem of Molnár can be extended into two directions. On the one hand, the result holds also in the case when the transformation under consideration acts on the space of all positive semide nite operators not only on density operators (i.e., we omit the condition of unit trace). On the other hand the statement remains valid even if we omit the strongly restrictive condition that the transformation is bijective. The second result is a joint work with Prof. Lajos Molnár which appeared in the journal Linear Algebra and Its Applications.

•May 6, 2010•0 citations

The Okinawa Lectures on Entropy

Klaas Landsman

After a historical introduction, the most important classical and quantum entropies are introduced as constructions in classical and quantum probability theory. Classical entropies are studied from large deviation theory, including theorems of Sanov, Cramér, Gärtner-Ellis, and Varadhan, and are illustrated in some applications to both Boltzmannian and Gibbsian statistical physics. Quantum entropies superficially connect to classical entropies at the formula level, but more deeply do so via the crucial role of entropy in statistical hypothesis testing. The classical (relative) Kullback-Leibler entropy, its quantum counterpart introduced by Umegaki, as well as their deformations proposed by Renyi all fit naturally in this context. Quantum entropy faces the new problem of defining and computing the relative entropy of a pair of states on a subsystem, here formalized as a von Neumann algebra. This requires modular (aka Tomita-Takesaki) theory, which provides the framework for the relative quantum entropies introduced by Araki and Uhlmann (these encompass both the Kullback-Leibler and Umegaki entropies as special cases). To (re)define and compute these entropies in terms of density operators and traces, further constructions are needed, namely Haagerup's noncommutative L^p spaces. Von Neumann algebras also provide the setting for the Connes-Stormer-Narnhofer-Thirring entropy, which is a quantum version of the Kolmogorov-Sinai entropy in dynamical systems and ergodic theory, to which we also provide an introduction. This course was originally inspired by, and should be relevant to, black hole thermodynamics, although we discuss neither this application nor the second law. The course tries to be both mathematically rigorous and interesting to theoretical physicists. Prerequisites are undergraduate probability theory, functional analysis, and quantum theory.

arXiv:2608.14523•Aug 14, 2026•1 citation

Mutual Information: A way to quantify correlations

Marcelo Tisoc, J. Beltrán

Within the framework of Information Theory, the existence of correlations between two random variables means that we can obtain information about one of them, just by measuring or observing the other random variable. In certain cases, this kind of relationship allows obtaining information about a variable even when the other is separated by a very large distance, that is, the process of obtaining information is non-local, an example (if not the only) is the quantum entanglement. These features of correlations make it interesting and important to study, classify and quantify them. The correlations are classified into classical correlations and quantum correlations, in addition they are quantified through the mutual information. Here we will present a natural way to define classical mutual information and then we will generalize it to the quantum case. Furthermore, every term in the definitions of mutual information will be interpreted using the concepts of classical and quantum entropy.

Revista Brasileira de Ensino de Física•Jan 1, 2022•8 citations

Information structures and their cohomology

Juan Pablo Vigneaux

We introduce the category of information structures, whose objects are suitable diagrams of measurable sets that encode the possible outputs of a given family of observables and their mutual relationships of refinement; they serve as mathematical models of contextuality in classical and quantum settings.Each information structure can be regarded as a ringed site with trivial topology; the structure ring is generated by the observables themselves and its multiplication corresponds to joint measurement.We extend Baudot and Bennequin's definition of information cohomology to this setting, as a derived functor in the category of modules over the structure ring, and show explicitly that the bar construction gives a projective resolution in that category, recovering in this way the cochain complexes previously considered in the literature.Finally, we study the particular case of a one-parameter family of coefficients made of functions of probability distributions.The only 1-cocycles are Shannon entropy or Tsallis α-entropy, depending on the value of the parameter.

arXiv:1709.07807•Theory and applications of categories•Jan 1, 2020•21 citations
We propose that entropy is a universal co-homological class in a theory associated to a family of observable quantities and a family of probability distributions. Three cases are presented: (1) classical probabilities and random variables; (2) quantum probabilities and observable operators; (3) dynamic probabilities and observation trees. This gives rise to a new kind of topology for information processes, that accounts for the main information functions: entropy, mutual-informations at all orders, and Kullback–Leibler divergence and generalizes them in several ways. The article is divided into two parts, that can be read independently. In the first part, the introduction, we provide an overview of the results, some open questions, future results and lines of research, and discuss briefly the application to complex data. In the second part we give the complete definitions and proofs of the theorems A, C and E in the introduction, which show why entropy is the first homological invariant of a structure of information in four contexts: static classical or quantum probability, dynamics of classical or quantum strategies of observation of a finite system.
Abstract. We propose that entropy is a universal co-homological class in a theory associated to a family of observable quantities and a family of probability distributions. Three cases are presented: 1) classical probabilities and random variables; 2) quantum probabilities and observable operators; 3) dynamic probabilities and observation trees. This gives rise to a new kind of topology for information processes. We discuss briefly its application to complex data, in particular to the structures of information flows in biological systems. This short note summarizes results obtained during the last years by the authors. The proofs are not included, but the definitions and theorems are stated with precision.
Baudot and Bennequin introduced a cohomological construction adapted to information theory, called \emph{information cohomology}; it characterizes Shannon entropy as the only nontrivial cohomology class in degree one, for suitable coefficients. This text develops the relation between information cohomology and topos theory. To this end, we redefine information structures, as categories of random variables related by a notion of extension or refinement; classical and quantum probability spaces appear as models (or representations) of them. These generalized information structures form a category with finite products and coproducts. Information cohomology is a derived functor in the abelian category of modules over an algebra of random variables, a subcategory of the presheaf topos associated with the information structure. The cohomology is invariant under isomorphisms of generalized structures. We prove that the relatively free bar construction gives a projective object for the computation of this invariant. We provide detailed computations of H0H^0H0 and H1H^1H1 when the coefficients are functionals of classical probabilities, including the degenerate cases. In the process, we also establish the homological nature of Tsallis entropies, as the only cocycles in degree one for certain one-parameter family of modules.
The concept of entropy rst arose in the study of thermodynamics and statistical me- chanics. In information theory the so-called Shannon entropy plays a signi cant role, which measures how much information we gain, on average, when we learn the value of a random variable. An alternative interpretation is that the entropy of the random variable quanti es the amount of uncertainty about the random variable before we learn its value. The concept was introduced by Claude E. Shannon in his 1948 paper "A Mathematical Theory of Communication". In the rst part of the present work we consider this fundamental measure of information and show some of its properties, such as non-negativity. The relative entropy or the Kullback-Leibler divergence is a very useful measure of the distance between two prob- ability distributions. After introducing its de nition and other notions (joint entropy, conditional entropy or mutual information) we can prove additional assertions about the Shannon entropy and present statements about the relations between the above men- tioned quantities. In quantum information theory, there is a quantity, namely von Neumann entropy, which corresponds to Shannon entropy and originates from it. In the section Von Neu- mann entropy we will introduce this quantity which is a continuous functional on the states, or on their mathematical representatives, the density operators, and it ful ls in- equalities such as subadditivity and strong subaddititvity. Just as with the Shannon entropy, it is extremely useful to de ne a quantum version of the relative entropy, which is one of the most important numerical quantities appearing in quantum information theory. It is used as a measure of distinguishability between quantum states. Among others its properties are jointly convexity, monotonicity which are speci cally convenient. Transformations on structures which preserve operations, quantities or relations among elements appear in many areas of mathematics. These are the so-called preservers which show up also in physics and even in chemistry where they are usually called symmetries. Therefore, the study of preserver transformations is an important area of research. The third section of this work is based on a paper, in which Lajos Molnár described the structure every bijective map on the space of all density operators on a given Hilbert space, which preserves the relative entropy. This result is closely related to Wigner's famous theorem on the form of quantum mechanical symmetry transformations. The above theorem of Molnár can be extended into two directions. On the one hand, the result holds also in the case when the transformation under consideration acts on the space of all positive semide nite operators not only on density operators (i.e., we omit the condition of unit trace). On the other hand the statement remains valid even if we omit the strongly restrictive condition that the transformation is bijective. The second result is a joint work with Prof. Lajos Molnár which appeared in the journal Linear Algebra and Its Applications.
After a historical introduction, the most important classical and quantum entropies are introduced as constructions in classical and quantum probability theory. Classical entropies are studied from large deviation theory, including theorems of Sanov, Cramér, Gärtner-Ellis, and Varadhan, and are illustrated in some applications to both Boltzmannian and Gibbsian statistical physics. Quantum entropies superficially connect to classical entropies at the formula level, but more deeply do so via the crucial role of entropy in statistical hypothesis testing. The classical (relative) Kullback-Leibler entropy, its quantum counterpart introduced by Umegaki, as well as their deformations proposed by Renyi all fit naturally in this context. Quantum entropy faces the new problem of defining and computing the relative entropy of a pair of states on a subsystem, here formalized as a von Neumann algebra. This requires modular (aka Tomita-Takesaki) theory, which provides the framework for the relative quantum entropies introduced by Araki and Uhlmann (these encompass both the Kullback-Leibler and Umegaki entropies as special cases). To (re)define and compute these entropies in terms of density operators and traces, further constructions are needed, namely Haagerup's noncommutative L^p spaces. Von Neumann algebras also provide the setting for the Connes-Stormer-Narnhofer-Thirring entropy, which is a quantum version of the Kolmogorov-Sinai entropy in dynamical systems and ergodic theory, to which we also provide an introduction. This course was originally inspired by, and should be relevant to, black hole thermodynamics, although we discuss neither this application nor the second law. The course tries to be both mathematically rigorous and interesting to theoretical physicists. Prerequisites are undergraduate probability theory, functional analysis, and quantum theory.
Within the framework of Information Theory, the existence of correlations between two random variables means that we can obtain information about one of them, just by measuring or observing the other random variable. In certain cases, this kind of relationship allows obtaining information about a variable even when the other is separated by a very large distance, that is, the process of obtaining information is non-local, an example (if not the only) is the quantum entanglement. These features of correlations make it interesting and important to study, classify and quantify them. The correlations are classified into classical correlations and quantum correlations, in addition they are quantified through the mutual information. Here we will present a natural way to define classical mutual information and then we will generalize it to the quantum case. Furthermore, every term in the definitions of mutual information will be interpreted using the concepts of classical and quantum entropy.
We introduce the category of information structures, whose objects are suitable diagrams of measurable sets that encode the possible outputs of a given family of observables and their mutual relationships of refinement; they serve as mathematical models of contextuality in classical and quantum settings.Each information structure can be regarded as a ringed site with trivial topology; the structure ring is generated by the observables themselves and its multiplication corresponds to joint measurement.We extend Baudot and Bennequin's definition of information cohomology to this setting, as a derived functor in the category of modules over the structure ring, and show explicitly that the bar construction gives a projective resolution in that category, recovering in this way the cochain complexes previously considered in the literature.Finally, we study the particular case of a one-parameter family of coefficients made of functions of probability distributions.The only 1-cocycles are Shannon entropy or Tsallis α-entropy, depending on the value of the parameter.