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:2603.12297

Complex-Valued Probability Measures and Their Applications in Information Theory

Siang Cheng, Hejun Xu, Tianxiao Pang

Published Mar 12, 2026• 0 citations
arXivHTMLPDF

Abstract

This paper introduces a comprehensive framework for complex-valued probability measures and explores their novel applications in information theory and statistical analysis. We define a complex probability measure as a phase-modulated extension of a classical probability measure. Building upon this foundation, we propose three fundamental information-theoretic quantities: complex entropy, which quantifies distribution uniformity through phase coherence; complex divergence, an asymmetric measure of dissimilarity between distributions; and the complex metric, a symmetric distance function satisfying the triangle inequality. We establish these concepts rigorously for both continuous and discrete probability distributions, proving key properties such as boundedness, continuity under total variation convergence, and clear extremal behaviors. A detailed comparative analysis with classical measures (Shannon entropy and Kullback-Leibler divergence) highlights the unique geometric and interpretive advantages of the proposed framework, particularly its sensitivity to distributional shape via a tunable phase parameter. We elucidate a profound formal analogy between the complex entropy integral and Feynman's path integral formulation of quantum mechanics, suggesting a deeper conceptual bridge. Finally, we demonstrate the practical utility of the complex metric through a detailed application in nonparametric two-sample hypothesis testing, outlining the testing procedure, advantages, limitations, and providing a conceptual simulation. This work opens new avenues for analyzing probability distributions through the lens of complex analysis and interference phenomena, with potential impacts across information theory, statistical inference, and machine learning.

DOI
10.48550/arxiv.2603.12297

Related papers

Information entropy of complex probability

Chan Li, Hui Xu, Zhu Cao

Probability theory is fundamental for modeling uncertainty, with traditional probabilities being real and non-negative. Complex probability extends this concept by allowing complex-valued probabilities, opening new avenues for analysis in various fields. This paper explores the information-theoretic aspects of complex probability, focusing on its definition, properties, and applications. We extend Shannon entropy to complex probability and examine key properties, including maximum entropy, joint entropy, conditional entropy, equilibration, and cross entropy. These results offer a framework for understanding entropy in complex probability spaces and have potential applications in fields such as statistical mechanics and information theory.

arXiv:2503.03759•Feb 19, 2025•0 citations

Geometric Approach to Quantum Statistical Inference

Marcin Jarzyna, Jan Kolodynski

We study quantum statistical inference tasks of hypothesis testing and their canonical variations, in order to review relations between their corresponding figures of merit-measures of statistical distance-and demonstrate the crucial differences which arise in the quantum regime in contrast to the classical setting. In our analysis, we primarily focus on the geometric approach to data inference problems, within which the aforementioned measures can be neatly interpreted as particular forms of divergences that quantify distances in the space of probability distributions or, when dealing with quantum systems, of density matrices. Moreover, with help of the standard language of Riemannian geometry we identify both the metrics such divergences must induce and the relations such metrics must then naturally inherit. Finally, we discuss exemplary applications of such a geometric approach to problems of quantum parameter estimation, “speed limits” and thermodynamics.

arXiv:2008.09129•IEEE Journal on Selected Areas in Information Theory•Aug 1, 2020•19 citations

Non-Classical Information Entropy: A Statistical Physics Perspective

Jincheng Zhang

This paper introduces a novel definition of non-classical information entropy, rooted in the principles of statistical physics, particularly quantum mechanics. The core premise is that traditional information entropy, derived from classical probability theory, is insufficient to capture the essence of information within non-classical systems exhibiting phenomena such as superposition and entanglement. We propose a definition based on the concept of accessible states and their associated probabilities, extending the notion of entropy beyond the realm of purely deterministic systems. The paper details the mathematical formulation of this non-classical information entropy, denoted as *Hnc*, and presents a method for its calculation. The method relies on identifying the set of accessible states for a given system and then applying a generalized form of Shannon's entropy formula, modified to account for the inherent uncertainties associated with quantum mechanics. The resulting *Hnc* provides a quantitative measure of the information content within non-classical systems, offering a potential framework for studying information processing and dynamics in quantum environments. The key contribution lies in bridging the gap between information theory and non-classical statistical physics, offering a new lens through which to understand information in quantum systems.

•Sep 3, 2026•0 citations

Quantum Entanglement Entropy Information Theory

Jincheng Zhang

This paper introduces a novel approach to information theory, leveraging quantum entanglement entropy as a fundamental measure of information. We propose that entanglement entropy can effectively quantify the efficiency of information transmission and provides a theoretical foundation that surpasses the limitations of classical information theory. The core of this work lies in the integration of entanglement entropy with Shannon entropy, establishing a new framework for analyzing information transfer. We explore scenarios where classical information theory struggles to adequately describe the limits of communication due to quantum mechanical effects, specifically entanglement. The paper aims to provide a theoretical underpinning for quantum communication protocols and potentially inform the development of quantum computation. We define key terms and formulate core concepts, focusing on the relationship between entanglement entropy, information content, and the constraints imposed by quantum mechanics. The central argument is that by considering the inherent interconnectedness of entangled systems, we can gain a deeper understanding of information processing at the most fundamental level. ---

•Sep 3, 2026•0 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

Limit Theorems for Quantum Entropies and Applications

Igor Bjelaković

We present our recent results on limit theorems for quantum entropies and their applications in quantum information theory. They include the full extensions of the fundamental asymptotic equipartition property (AEP) to ergodic quantum informations sources and the ergodic version of Stein's Lemma on quantum hypothesis testing. These limit theorems are then used to obtain a data compression theorem for ergodic quantum sources and a quantum version of Sanov's theorem on large deviations for uncorrelated quantum sources. Moreover, Stein's lemma clearifies the operational interpretation of the quantum Kullback-Leibler distance (relative entropy), and this operational understanding of this quantity can be employed to give a new intuitive proof of the monotonicity of this statistical distance measure relying on information-theoretic methods.

•Apr 3, 2006•0 citations
This paper introduces a comprehensive framework for complex-valued probability measures and explores their novel applications in information theory and statistical analysis. We define a complex probability measure as a phase-modulated extension of a classical probability measure. Building upon this foundation, we propose three fundamental information-theoretic quantities: complex entropy, which quantifies distribution uniformity through phase coherence; complex divergence, an asymmetric measure of dissimilarity between distributions; and the complex metric, a symmetric distance function satisfying the triangle inequality. We establish these concepts rigorously for both continuous and discrete probability distributions, proving key properties such as boundedness, continuity under total variation convergence, and clear extremal behaviors. A detailed comparative analysis with classical measures (Shannon entropy and Kullback-Leibler divergence) highlights the unique geometric and interpretive advantages of the proposed framework, particularly its sensitivity to distributional shape via a tunable phase parameter. We elucidate a profound formal analogy between the complex entropy integral and Feynman's path integral formulation of quantum mechanics, suggesting a deeper conceptual bridge. Finally, we demonstrate the practical utility of the complex metric through a detailed application in nonparametric two-sample hypothesis testing, outlining the testing procedure, advantages, limitations, and providing a conceptual simulation. This work opens new avenues for analyzing probability distributions through the lens of complex analysis and interference phenomena, with potential impacts across information theory, statistical inference, and machine learning.
Probability theory is fundamental for modeling uncertainty, with traditional probabilities being real and non-negative. Complex probability extends this concept by allowing complex-valued probabilities, opening new avenues for analysis in various fields. This paper explores the information-theoretic aspects of complex probability, focusing on its definition, properties, and applications. We extend Shannon entropy to complex probability and examine key properties, including maximum entropy, joint entropy, conditional entropy, equilibration, and cross entropy. These results offer a framework for understanding entropy in complex probability spaces and have potential applications in fields such as statistical mechanics and information theory.
We study quantum statistical inference tasks of hypothesis testing and their canonical variations, in order to review relations between their corresponding figures of merit-measures of statistical distance-and demonstrate the crucial differences which arise in the quantum regime in contrast to the classical setting. In our analysis, we primarily focus on the geometric approach to data inference problems, within which the aforementioned measures can be neatly interpreted as particular forms of divergences that quantify distances in the space of probability distributions or, when dealing with quantum systems, of density matrices. Moreover, with help of the standard language of Riemannian geometry we identify both the metrics such divergences must induce and the relations such metrics must then naturally inherit. Finally, we discuss exemplary applications of such a geometric approach to problems of quantum parameter estimation, “speed limits” and thermodynamics.
This paper introduces a novel definition of non-classical information entropy, rooted in the principles of statistical physics, particularly quantum mechanics. The core premise is that traditional information entropy, derived from classical probability theory, is insufficient to capture the essence of information within non-classical systems exhibiting phenomena such as superposition and entanglement. We propose a definition based on the concept of accessible states and their associated probabilities, extending the notion of entropy beyond the realm of purely deterministic systems. The paper details the mathematical formulation of this non-classical information entropy, denoted as *Hnc*, and presents a method for its calculation. The method relies on identifying the set of accessible states for a given system and then applying a generalized form of Shannon's entropy formula, modified to account for the inherent uncertainties associated with quantum mechanics. The resulting *Hnc* provides a quantitative measure of the information content within non-classical systems, offering a potential framework for studying information processing and dynamics in quantum environments. The key contribution lies in bridging the gap between information theory and non-classical statistical physics, offering a new lens through which to understand information in quantum systems.
This paper introduces a novel approach to information theory, leveraging quantum entanglement entropy as a fundamental measure of information. We propose that entanglement entropy can effectively quantify the efficiency of information transmission and provides a theoretical foundation that surpasses the limitations of classical information theory. The core of this work lies in the integration of entanglement entropy with Shannon entropy, establishing a new framework for analyzing information transfer. We explore scenarios where classical information theory struggles to adequately describe the limits of communication due to quantum mechanical effects, specifically entanglement. The paper aims to provide a theoretical underpinning for quantum communication protocols and potentially inform the development of quantum computation. We define key terms and formulate core concepts, focusing on the relationship between entanglement entropy, information content, and the constraints imposed by quantum mechanics. The central argument is that by considering the inherent interconnectedness of entangled systems, we can gain a deeper understanding of information processing at the most fundamental level. ---
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.
We present our recent results on limit theorems for quantum entropies and their applications in quantum information theory. They include the full extensions of the fundamental asymptotic equipartition property (AEP) to ergodic quantum informations sources and the ergodic version of Stein's Lemma on quantum hypothesis testing. These limit theorems are then used to obtain a data compression theorem for ergodic quantum sources and a quantum version of Sanov's theorem on large deviations for uncorrelated quantum sources. Moreover, Stein's lemma clearifies the operational interpretation of the quantum Kullback-Leibler distance (relative entropy), and this operational understanding of this quantity can be employed to give a new intuitive proof of the monotonicity of this statistical distance measure relying on information-theoretic methods.