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:1111.1364 · Journal of Mathematical Physics

Quantal effects and MaxEnt

Federico Holik, Angelo Plastino

Published Jul 1, 2012• 7 citations
arXivHTMLPDF

Abstract

Convex operational models (COMs) are considered as great extrapolations to larger settings of any statistical theory. In this article, we generalize the maximum entropy principle (MaxEnt) of Jaynes’ to any COM. After expressing MaxEnt in a geometrical and lattice theoretical setting, we are able to cast it for any COM. This scope-amplification opens the door to a new systematization of the principle and sheds light into its geometrical structure.

DOI
10.1063/1.4731769

Related papers

FROM THERMODYNAMICS TO MAXENT

Angelo Plastino, Evaldo M. F. Curado

The maximum entropy principle (MaxEnt) is one of the most powerful approaches in the theorist arsenal. It has been used in many areas of science, and, in particular, in both statistical mechanics and the quantum many body problem. Here we show how to derive MaxEnt from the laws of thermodynamics.

•Sep 1, 2007•0 citations

Geometric probability theory and Jaynes’s methodology

Federico Holik, César Massri, Angel Ricardo Plastino

We provide a generalization of the approach to geometric probability advanced by the great mathematician Gian Carlo Rota, in order to apply it to generalized probabilistic physical theories. In particular, we use this generalization to provide an improvement of the Jaynes’ MaxEnt method. The improvement consists in providing a framework for the introduction of symmetry constraints. This allows us to include group theory within MaxEnt. Some examples are provided.

arXiv:1501.00074•International Journal of Geometric Methods in Modern Physics•Dec 2, 2015•9 citations

Dual representations of classical and quantum entropies: Theory and perspectives: Invited keynote

Olivier Rioul

The MAXENT (maximum entropy) principle gives a natural correspondance between (classical and quantum) statistical mechanics and information theory. Its general formulation leverages on log-concavity (or Klein's inequality) and the celebrated information inequality, which is equivalent to Gibbs' inequality. The resulting convex optimization allows one to relate entropy to the log-canonical partition function by Legendre-Fenchel duality. This can be further generalized to dual variational characterization of relative entropy or Kullback-Leibler divergence, relating Gibbs variationnal principle to Donsker-Vardhan variational representations.From an information theoretical point of view, the Gibbs principle and its associated evidence lower bound serves as the basis of modern machine learning algorithms, such as the expectation-maximization (EM) algorithm and its restriction to parameters output by a neural network. Interestingly, a large class of alternating optimization algorithms including EM and Blahut-Arimoto for computing channel capacity and source rate-distortion functions can be cast in a generic information geometric alternating projections on convex sets of measures. On the other hand, Donsker-Vardhan representations, when restricted to the output of a neural network, allows one to efficiently estimate information measures, and when applied to parametric estimators with quadratic risk, provide HCR-like and CRB-like statistical lower bounds. An alternative derivation on such lower bounds in the Bayesian setting makes use of the Weyl-Heisenberg uncertainty principle, which opens up new perspectives.In this keynote, I will select and review several of the aforementioned topics, and discuss the interactions between classical and quantum interpretations.

•Jul 1, 2026•0 citations

Maximum Entropy on the Complex Probability Framework

Francisco Javier Tapiador

Jaynes' maximum entropy (MaxEnt) principle selects, from all probability distributions consistent with a set of constraints, the one that maximizes the Shannon entropy. The principle is well-defined for classical, real-valued probabilities, but extending it to complex-valued probability theories requires care. Youssef's complex probability framework, in which quantum mechanics is reformulated as a Bayesian theory with complex amplitudes and the observable probability is the squared modulus (Born rule), does not admit a natural MaxEnt extension: the L2 normalization of that framework is incompatible with the L1 normalization assumed by Shannon entropy, and the resulting complex-valued entropy functional cannot be maximized without additional structure absent from Youssef's axioms. The present paper proposes a different extension of Kolmogorov's axioms to the complex domain, replacing non-negativity with the condition that the real part of every probability be non-negative. This framework, which retains L1 normalization and recovers classical probability when the imaginary part vanishes, admits a natural MaxEnt principle: the real part of the complex Shannon entropy is a well-posed real functional, its Euler-Lagrange equations produce an explicit complex Gibbs distribution with complex Lagrange multipliers, and the classical Gibbs distribution is recovered as the special case of real multipliers. The die problem (Jaynes' Brandeis dice example) is worked out in detail for both the fair and the loaded cases, illustrating how imaginary constraints redistribute the observable probability mass in a way that has no counterpart in classical MaxEnt.

Entropy•Sep 25, 2026•0 citations

The Temporal Foundation of the Principle of Maximal Entropy

Vasil Dinev Penchev

The principle of maximal entropy (further abbreviated as “MaxEnt”) can be founded on the formal mechanism, in which future transforms into past by the mediation of present. This allows of MaxEnt to be investigated by the theory of quantum information.MaxEnt can be considered as an inductive analog or generalization of “Occam’s razor”. It depends crucially on choice and thus on information just as all inductive methods of reasoning. The essence shared by Occam’s razor and MaxEnt is for the relevant data known till now to be postulated as an enough fundament of conclusion. That axiom is the kind of choice grounding both principles. Popper’s falsifiability (1935) can be discussed as a complement to them: That axiom (or axiom scheme) is always sufficient but never necessary condition of conclusion therefore postulating the choice in the base of MaxEnt. Furthermore, the abstraction axiom (or axiom scheme) relevant to set theory (e.g. the axiom scheme of specification in ZFC) involves choice analogically.

•Jan 1, 2020•0 citations

A Proposito del Principio di Massima Entropia

Carlo Sempi

The maximum-entropy principle has recently been discussed in this journal by R. Rosa. The present note stresses a few points made or touched upon there. First it is shown how to derive, by means of the principle under discussion, the quantal statistics, along with the intermediate ones. Then the point is made that the correct application of the principle and its ultimate acceptance by the scientific community require that one uses an appropriate representation for the entropy. Thus great importance is attributed to the characterizations of the various entropies.

•Jan 1, 1986•0 citations
Convex operational models (COMs) are considered as great extrapolations to larger settings of any statistical theory. In this article, we generalize the maximum entropy principle (MaxEnt) of Jaynes’ to any COM. After expressing MaxEnt in a geometrical and lattice theoretical setting, we are able to cast it for any COM. This scope-amplification opens the door to a new systematization of the principle and sheds light into its geometrical structure.
The MAXENT (maximum entropy) principle gives a natural correspondance between (classical and quantum) statistical mechanics and information theory. Its general formulation leverages on log-concavity (or Klein's inequality) and the celebrated information inequality, which is equivalent to Gibbs' inequality. The resulting convex optimization allows one to relate entropy to the log-canonical partition function by Legendre-Fenchel duality. This can be further generalized to dual variational characterization of relative entropy or Kullback-Leibler divergence, relating Gibbs variationnal principle to Donsker-Vardhan variational representations.From an information theoretical point of view, the Gibbs principle and its associated evidence lower bound serves as the basis of modern machine learning algorithms, such as the expectation-maximization (EM) algorithm and its restriction to parameters output by a neural network. Interestingly, a large class of alternating optimization algorithms including EM and Blahut-Arimoto for computing channel capacity and source rate-distortion functions can be cast in a generic information geometric alternating projections on convex sets of measures. On the other hand, Donsker-Vardhan representations, when restricted to the output of a neural network, allows one to efficiently estimate information measures, and when applied to parametric estimators with quadratic risk, provide HCR-like and CRB-like statistical lower bounds. An alternative derivation on such lower bounds in the Bayesian setting makes use of the Weyl-Heisenberg uncertainty principle, which opens up new perspectives.In this keynote, I will select and review several of the aforementioned topics, and discuss the interactions between classical and quantum interpretations.
Jaynes' maximum entropy (MaxEnt) principle selects, from all probability distributions consistent with a set of constraints, the one that maximizes the Shannon entropy. The principle is well-defined for classical, real-valued probabilities, but extending it to complex-valued probability theories requires care. Youssef's complex probability framework, in which quantum mechanics is reformulated as a Bayesian theory with complex amplitudes and the observable probability is the squared modulus (Born rule), does not admit a natural MaxEnt extension: the L2 normalization of that framework is incompatible with the L1 normalization assumed by Shannon entropy, and the resulting complex-valued entropy functional cannot be maximized without additional structure absent from Youssef's axioms. The present paper proposes a different extension of Kolmogorov's axioms to the complex domain, replacing non-negativity with the condition that the real part of every probability be non-negative. This framework, which retains L1 normalization and recovers classical probability when the imaginary part vanishes, admits a natural MaxEnt principle: the real part of the complex Shannon entropy is a well-posed real functional, its Euler-Lagrange equations produce an explicit complex Gibbs distribution with complex Lagrange multipliers, and the classical Gibbs distribution is recovered as the special case of real multipliers. The die problem (Jaynes' Brandeis dice example) is worked out in detail for both the fair and the loaded cases, illustrating how imaginary constraints redistribute the observable probability mass in a way that has no counterpart in classical MaxEnt.
The principle of maximal entropy (further abbreviated as “MaxEnt”) can be founded on the formal mechanism, in which future transforms into past by the mediation of present. This allows of MaxEnt to be investigated by the theory of quantum information.MaxEnt can be considered as an inductive analog or generalization of “Occam’s razor”. It depends crucially on choice and thus on information just as all inductive methods of reasoning. The essence shared by Occam’s razor and MaxEnt is for the relevant data known till now to be postulated as an enough fundament of conclusion. That axiom is the kind of choice grounding both principles. Popper’s falsifiability (1935) can be discussed as a complement to them: That axiom (or axiom scheme) is always sufficient but never necessary condition of conclusion therefore postulating the choice in the base of MaxEnt. Furthermore, the abstraction axiom (or axiom scheme) relevant to set theory (e.g. the axiom scheme of specification in ZFC) involves choice analogically.
The maximum-entropy principle has recently been discussed in this journal by R. Rosa. The present note stresses a few points made or touched upon there. First it is shown how to derive, by means of the principle under discussion, the quantal statistics, along with the intermediate ones. Then the point is made that the correct application of the principle and its ultimate acceptance by the scientific community require that one uses an appropriate representation for the entropy. Thus great importance is attributed to the characterizations of the various entropies.