© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Entropy

Pseudo-Additive Tsallis Entropy and Non-Factorizing Joint Statistics in Product Sheffer Stroke Basic Algebras

İbrahim Şentürk, Metin Bilge, Tahsin Öner

Published Aug 21, 2026• 0 citations

Abstract

This paper addresses the problem of formulating generalized, non-extensive information-theoretic measures on finite non-distributive algebraic structures equipped with Riečan states, with particular emphasis on product Sheffer stroke basic algebras. Our approach formalizes finite summations, admissible partitions, refinement relations, and Sheffer stroke joint refinement candidates by using the primitive Sheffer stroke operation, with partition and marginalization properties imposed under the stated product and admissibility assumptions. By leveraging the state-theoretic properties of Riečan states, we construct baseline Shannon and logical entropies alongside algorithmic procedures for their computational evaluation. As the main result, we introduce and analytically characterize a parametric Tsallis entropy functional over these basic algebras. We prove its fundamental properties, including bounding inequalities, state concavity, monotonicity under refinement, subadditivity (for α>1), conditional chain-type identities under the relevant joint refinement marginalization assumptions, and exact analytical convergence to the classical Shannon limit as the entropic index α→1. Furthermore, under a state-dependent statistical independence condition, we show that the joint Tsallis entropy satisfies a pseudo-additive relation. By defining the Tsallis mutual information and the associated pseudo-additive residual, we isolate the deviation of a joint Sheffer stroke refinement from the factorized model determined by its marginal Riečan-state distributions. This residual is intended as a state-dependent algebraic indicator of deviations from the factorized Tsallis pseudo-additive model; it is not claimed to be an operational contextuality witness, a contextuality inequality, an entanglement measure, or a physical implementation criterion.

DOI: 10.3390/e28080940

Related papers

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•3 citations

Quantum Entropy and Correlations in Quantum Information

Reinhold A. Bertlmann, Nicolai Friis

Abstract Chapter 20 provides a discussion of entropies and entropic quantities in quantum information theory, briefly considering the generalizations of the Rényi entropy to the quantum regime, but mainly focusing on the von Neumann entropy and its properties such as concavity, the Araki-Lieb inequality, and subadditivity. We introduce the quantum relative entropy, quantum joint entropy, quantum conditional entropy, and quantum mutual information, and prove key properties and results for these quantities, including Klein’s inequality, joint convexity, additivity, and monotonicity under completely positive and trace-preserving maps of the relative entropy, as well as weak monotonicity and strong subadditivity of the von Neumann entropy. We then analyse the relation of (negative) conditional entropy and entanglement. In this context we discuss the conditional amplitude operator and the mutual amplitude operator, as well as conditional Rényi entropies and their role for entanglement detection.

•Sep 7, 2023•0 citations

Analyzing causal structures using Tsallis entropies

V. Vilasini, Roger Colbeck

Understanding cause-effect relationships is a crucial part of the scientific process. As Bell's theorem shows, within a given causal structure, classical and quantum physics impose different constraints on the correlations that are realizable, a fundamental feature that has technological applications. However, in general it is difficult to distinguish the set of classical and quantum correlations within a causal structure. Here we investigate a method to do this based on using entropy vectors for Tsallis entropies. We derive constraints on the Tsallis entropies that are implied by (conditional) independence between classical random variables and apply these to causal structures. We find that the number of independent constraints needed to characterize the causal structure is prohibitively high such that the computations required for the standard entropy vector method cannot be employed even for small causal structures. Instead, without solving the whole problem, we find new Tsallis entropic constraints for the triangle causal structure by generalizing known Shannon constraints. Our results reveal mathematical properties of classical and quantum Tsallis entropies and highlight difficulties of using Tsallis entropies for analyzing causal structures.

arXiv:1907.02551•Physical Review A•Dec 5, 2019•7 citations

Polygon relations and subadditivity of entropic measures for discrete and continuous multipartite entanglement

Lijun Liu, Xiaozhen Ge, Shuming Cheng

Abstract In a recent work by us Ge et al [Phys. Rev. A 110, L010402 (2024)], we have derived a series of polygon relations of bipartite entanglement measures that is useful to reveal entanglement properties of discrete, continuous, and even hybrid multipartite quantum systems. In this work, with the information-theoretical measures of Rényi and Tsallis entropies, we study the relationship between the polygon relation and the subadditivity of entropy. In particular, the entropy-polygon relations are derived for pure multi-qubit states and then generalized to multi-mode Gaussian states, by utilizing the known results from the quantum marginal problem. Then the equivalence between the polygon relation and subadditivity is established, in the sense that for all discrete or continuous multipartite states, the polygon relation holds if and only if the underlying entropy is subadditive. As a byproduct, the subadditivity of Rényi and Tsallis entropies is proven for all bipartite Gaussian states. Finally, the difference between polygon relations and monogamy relations is clarified, and generalizations of our results are discussed. Our work provides a better understanding of the rich structure of multipartite states, and hence is expected to be helpful for the study of multipartite entanglement.

arXiv:2401.02066•Physica Scripta•Aug 6, 2024•1 citation

The structure of Rényi entropic inequalities

Noah Linden, Milán Mosonyi, Andreas Winter

We investigate the universal inequalities relating the α -Rényi entropies of the marginals of a multi-partite quantum state. This is in analogy to the same question for the Shannon and von Neumann entropies ( α =1), which are known to satisfy several non-trivial inequalities such as strong subadditivity. Somewhat surprisingly, we find for 0< α <1 that the only inequality is non-negativity: in other words, any collection of non-negative numbers assigned to the non-empty subsets of n parties can be arbitrarily well approximated by the α -entropies of the 2 n −1 marginals of a quantum state. For α >1, we show analogously that there are no non-trivial homogeneous (in particular, no linear) inequalities. On the other hand, it is known that there are further, nonlinear and indeed non-homogeneous, inequalities delimiting the α -entropies of a general quantum state. Finally, we also treat the case of Rényi entropies restricted to classical states (i.e. probability distributions), which, in addition to non-negativity, are also subject to monotonicity. For α ≠0,1, we show that this is the only other homogeneous relation.

arXiv:1212.0248•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Aug 21, 2013•76 citations

Fundamental properties of Tsallis relative entropy

Shigeru Furuichi, Kenjiro Yanagi, Ken Kuriyama

Fundamental properties for the Tsallis relative entropy in both classical and quantum systems are studied. As one of our main results, we give the parametric extension of the trace inequality between the quantum relative entropy and the minus of the trace of the relative operator entropy given by Hiai and Petz. The monotonicity of the quantum Tsallis relative entropy for the trace preserving completely positive linear map is also shown without the assumption that the density operators are invertible. The generalized Tsallis relative entropy is defined and its subadditivity is shown by its joint convexity. Moreover, the generalized Peierls–Bogoliubov inequality is also proven.

arXiv:cond-mat/0406178•Journal of Mathematical Physics•Nov 29, 2004•178 citations

This paper addresses the problem of formulating generalized, non-extensive information-theoretic measures on finite non-distributive algebraic structures equipped with Riečan states, with particular emphasis on product Sheffer stroke basic algebras. Our approach formalizes finite summations, admissible partitions, refinement relations, and Sheffer stroke joint refinement candidates by using the primitive Sheffer stroke operation, with partition and marginalization properties imposed under the stated product and admissibility assumptions. By leveraging the state-theoretic properties of Riečan states, we construct baseline Shannon and logical entropies alongside algorithmic procedures for their computational evaluation. As the main result, we introduce and analytically characterize a parametric Tsallis entropy functional over these basic algebras. We prove its fundamental properties, including bounding inequalities, state concavity, monotonicity under refinement, subadditivity (for α>1), conditional chain-type identities under the relevant joint refinement marginalization assumptions, and exact analytical convergence to the classical Shannon limit as the entropic index α→1. Furthermore, under a state-dependent statistical independence condition, we show that the joint Tsallis entropy satisfies a pseudo-additive relation. By defining the Tsallis mutual information and the associated pseudo-additive residual, we isolate the deviation of a joint Sheffer stroke refinement from the factorized model determined by its marginal Riečan-state distributions. This residual is intended as a state-dependent algebraic indicator of deviations from the factorized Tsallis pseudo-additive model; it is not claimed to be an operational contextuality witness, a contextuality inequality, an entanglement measure, or a physical implementation criterion.

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.

Abstract Chapter 20 provides a discussion of entropies and entropic quantities in quantum information theory, briefly considering the generalizations of the Rényi entropy to the quantum regime, but mainly focusing on the von Neumann entropy and its properties such as concavity, the Araki-Lieb inequality, and subadditivity. We introduce the quantum relative entropy, quantum joint entropy, quantum conditional entropy, and quantum mutual information, and prove key properties and results for these quantities, including Klein’s inequality, joint convexity, additivity, and monotonicity under completely positive and trace-preserving maps of the relative entropy, as well as weak monotonicity and strong subadditivity of the von Neumann entropy. We then analyse the relation of (negative) conditional entropy and entanglement. In this context we discuss the conditional amplitude operator and the mutual amplitude operator, as well as conditional Rényi entropies and their role for entanglement detection.

Understanding cause-effect relationships is a crucial part of the scientific process. As Bell's theorem shows, within a given causal structure, classical and quantum physics impose different constraints on the correlations that are realizable, a fundamental feature that has technological applications. However, in general it is difficult to distinguish the set of classical and quantum correlations within a causal structure. Here we investigate a method to do this based on using entropy vectors for Tsallis entropies. We derive constraints on the Tsallis entropies that are implied by (conditional) independence between classical random variables and apply these to causal structures. We find that the number of independent constraints needed to characterize the causal structure is prohibitively high such that the computations required for the standard entropy vector method cannot be employed even for small causal structures. Instead, without solving the whole problem, we find new Tsallis entropic constraints for the triangle causal structure by generalizing known Shannon constraints. Our results reveal mathematical properties of classical and quantum Tsallis entropies and highlight difficulties of using Tsallis entropies for analyzing causal structures.

Abstract In a recent work by us Ge et al [Phys. Rev. A 110, L010402 (2024)], we have derived a series of polygon relations of bipartite entanglement measures that is useful to reveal entanglement properties of discrete, continuous, and even hybrid multipartite quantum systems. In this work, with the information-theoretical measures of Rényi and Tsallis entropies, we study the relationship between the polygon relation and the subadditivity of entropy. In particular, the entropy-polygon relations are derived for pure multi-qubit states and then generalized to multi-mode Gaussian states, by utilizing the known results from the quantum marginal problem. Then the equivalence between the polygon relation and subadditivity is established, in the sense that for all discrete or continuous multipartite states, the polygon relation holds if and only if the underlying entropy is subadditive. As a byproduct, the subadditivity of Rényi and Tsallis entropies is proven for all bipartite Gaussian states. Finally, the difference between polygon relations and monogamy relations is clarified, and generalizations of our results are discussed. Our work provides a better understanding of the rich structure of multipartite states, and hence is expected to be helpful for the study of multipartite entanglement.

We investigate the universal inequalities relating the α -Rényi entropies of the marginals of a multi-partite quantum state. This is in analogy to the same question for the Shannon and von Neumann entropies ( α =1), which are known to satisfy several non-trivial inequalities such as strong subadditivity. Somewhat surprisingly, we find for 0< α <1 that the only inequality is non-negativity: in other words, any collection of non-negative numbers assigned to the non-empty subsets of n parties can be arbitrarily well approximated by the α -entropies of the 2 n −1 marginals of a quantum state. For α >1, we show analogously that there are no non-trivial homogeneous (in particular, no linear) inequalities. On the other hand, it is known that there are further, nonlinear and indeed non-homogeneous, inequalities delimiting the α -entropies of a general quantum state. Finally, we also treat the case of Rényi entropies restricted to classical states (i.e. probability distributions), which, in addition to non-negativity, are also subject to monotonicity. For α ≠0,1, we show that this is the only other homogeneous relation.

Fundamental properties for the Tsallis relative entropy in both classical and quantum systems are studied. As one of our main results, we give the parametric extension of the trace inequality between the quantum relative entropy and the minus of the trace of the relative operator entropy given by Hiai and Petz. The monotonicity of the quantum Tsallis relative entropy for the trace preserving completely positive linear map is also shown without the assumption that the density operators are invertible. The generalized Tsallis relative entropy is defined and its subadditivity is shown by its joint convexity. Moreover, the generalized Peierls–Bogoliubov inequality is also proven.