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

Bulletin of the Australian Mathematical Society

TRANSFORMATIONS ON DENSITY OPERATORS PRESERVING GENERALISED ENTROPY OF A CONVEX COMBINATION

Marcell Gaál, Gergő Nagy

Published May 3, 2018• 1 citation
Publisher

Abstract

We aim to characterise those transformations on the set of density operators (which are the mathematical representatives of the states in quantum information theory) that preserve a so-called generalised entropy ofonefixed convex combination of operators. The characterisation strengthens a recent result of Karder and Petek where the preservation of the same quantity was assumed forallconvex combinations.

DOI
10.1017/s0004972718000254

Related papers

Maps on Quantum States in -algebras Preserving von Neumann Entropy or Schatten -norm of Convex Combinations

Marcell Gaál

Abstract Very recently, Karder and Petek completely described maps on density matrices (positive semidefinite matrices with unit trace) preserving certain entropy-like convex functionals of any convex combination. As a result, maps could be characterized that preserve von Neumann entropy or Schatten $p$ -norm of any convex combination of quantum states (whose mathematical representatives are the density matrices). In this note we consider these latter two problems on the set of invertible density operators, in a much more general setting, on the set of positive invertible elements with unit trace in a $C^{\ast }$ -algebra.

Canadian Mathematical Bulletin•Mar 22, 2018•3 citations

Preservers for the Tsallis Entropy of Convex Combinations of Density Operators

Xiaochun Fang, Yihui Lao

Let H be a complex separable Hilbert space; we first characterize the unitary equivalence of two density operators by use of Tsallis entropy and then obtain the form of a surjective map on density operators preserving Tsallis entropy of convex combinations.

Advances in Mathematical Physics•Jun 4, 2018•3 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

Information entropy and the space of decoherence functions in generalized quantum theory

Christopher John Isham, Noah Linden

In standard quantum theory, the ideas of information entropy and of pure states are closely linked. States are represented by density matrices \ensuremath{\rho} on a Hilbert space and the information entropy - tr(\ensuremath{\rho} ln \ensuremath{\rho}) is minimized on pure states (pure states are the vertices of the boundary of the convex set of states). The space of decoherence functions in the consistent histories approach to generalized quantum theory is also a convex set. However, by showing that every decoherence function can be written as a convex combination of two other decoherence functions, we demonstrate that there are no ``pure'' decoherence functions. The main content of the paper is a notion of information entropy in generalized quantum mechanics which is applicable in contexts in which there is no a priori notion of time. Information entropy is defined first on consistent sets and then we show that it decreases upon refinement of the consistent set. This information entropy suggests an intrinsic way of giving a consistent set selection criterion.

arXiv:quant-ph/9612035•Physical Review A•Jun 1, 1997•20 citations

Generalised Probabilistic Theories

Zujin Wen, Zihan Wang, Xiangjing Liu +1 more

We give an introduction to research associated with the generalised probabilistic theories framework, also known as the convex framework. States are real vectors representing lists of probabilities of measurement outcomes. Convex combinations of the vectors represent probabilistic combinations of different state preparations. Transformations are real matrices. Measurement outcomes are represented by functionals of the states, inner products of the state with a real vector, whose values are the probability of the measurement outcome in question. The framework generalises quantum theory. We describe the operational meaning of the framework, and how the concepts can be defined in terms of cones of states and measurement outcome vectors. We describe how the classical and quantum probability theories are represented in the framework. We describe Bell non-locality and the theory with super-quantum non-locality known as box world. We discuss generalised Hamiltonian mechanics in the discrete case and in continuous phase space, including the role of negativity of the phase space density in contextuality and tunnelling.

quant-pharXiv:2606.31097•Jul 1, 2026•1 citation

A complete characterisation of conditional entropies

Roberto Rubboli, Erkka Haapasalo, Marco Tomamichel

Entropies are fundamental measures of uncertainty with central importance in information theory and statistics and applications across all the quantitative sciences. Under a natural set of operational axioms, the most general form of entropy is captured by the family of Rényi entropies, parameterized by a real number $α$. Conditional entropy extends the notion of entropy by quantifying uncertainty from the viewpoint of an observer with access to potentially correlated side information. However, despite their significance and the emergence of various useful definitions, a complete characterisation of measures of conditional entropy that satisfy a natural set of operational axioms has remained elusive. In this work, we provide a complete characterisation of conditional entropy, defined through a set of axioms that are essential for any operationally meaningful definition: additivity for independent random variables, invariance under relabeling, and monotonicity under conditional mixing channels. We show that the most general conditional entropy is a generalized convex combination of conditional entropies defined as exponential averages of Rényi entropies of the conditioned distribution, parameterized by a real number and a probability measure on the positive reals.

arXiv:2601.23213•Jan 30, 2026•4 citations
We aim to characterise those transformations on the set of density operators (which are the mathematical representatives of the states in quantum information theory) that preserve a so-called generalised entropy ofonefixed convex combination of operators. The characterisation strengthens a recent result of Karder and Petek where the preservation of the same quantity was assumed forallconvex combinations.
Abstract Very recently, Karder and Petek completely described maps on density matrices (positive semidefinite matrices with unit trace) preserving certain entropy-like convex functionals of any convex combination. As a result, maps could be characterized that preserve von Neumann entropy or Schatten ppp -norm of any convex combination of quantum states (whose mathematical representatives are the density matrices). In this note we consider these latter two problems on the set of invertible density operators, in a much more general setting, on the set of positive invertible elements with unit trace in a C∗C^{\ast }C∗ -algebra.
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.
In standard quantum theory, the ideas of information entropy and of pure states are closely linked. States are represented by density matrices \ensuremath{\rho} on a Hilbert space and the information entropy - tr(\ensuremath{\rho} ln \ensuremath{\rho}) is minimized on pure states (pure states are the vertices of the boundary of the convex set of states). The space of decoherence functions in the consistent histories approach to generalized quantum theory is also a convex set. However, by showing that every decoherence function can be written as a convex combination of two other decoherence functions, we demonstrate that there are no ``pure'' decoherence functions. The main content of the paper is a notion of information entropy in generalized quantum mechanics which is applicable in contexts in which there is no a priori notion of time. Information entropy is defined first on consistent sets and then we show that it decreases upon refinement of the consistent set. This information entropy suggests an intrinsic way of giving a consistent set selection criterion.
We give an introduction to research associated with the generalised probabilistic theories framework, also known as the convex framework. States are real vectors representing lists of probabilities of measurement outcomes. Convex combinations of the vectors represent probabilistic combinations of different state preparations. Transformations are real matrices. Measurement outcomes are represented by functionals of the states, inner products of the state with a real vector, whose values are the probability of the measurement outcome in question. The framework generalises quantum theory. We describe the operational meaning of the framework, and how the concepts can be defined in terms of cones of states and measurement outcome vectors. We describe how the classical and quantum probability theories are represented in the framework. We describe Bell non-locality and the theory with super-quantum non-locality known as box world. We discuss generalised Hamiltonian mechanics in the discrete case and in continuous phase space, including the role of negativity of the phase space density in contextuality and tunnelling.
Entropies are fundamental measures of uncertainty with central importance in information theory and statistics and applications across all the quantitative sciences. Under a natural set of operational axioms, the most general form of entropy is captured by the family of Rényi entropies, parameterized by a real number ααα. Conditional entropy extends the notion of entropy by quantifying uncertainty from the viewpoint of an observer with access to potentially correlated side information. However, despite their significance and the emergence of various useful definitions, a complete characterisation of measures of conditional entropy that satisfy a natural set of operational axioms has remained elusive. In this work, we provide a complete characterisation of conditional entropy, defined through a set of axioms that are essential for any operationally meaningful definition: additivity for independent random variables, invariance under relabeling, and monotonicity under conditional mixing channels. We show that the most general conditional entropy is a generalized convex combination of conditional entropies defined as exponential averages of Rényi entropies of the conditioned distribution, parameterized by a real number and a probability measure on the positive reals.