In the past decades, all of the efforts at quantifying systems complexity with a general tool has usually relied on using Shannon's classical information framework to address the disorder of the system through the Boltzmann–Gibbs–Shannon entropy, or one of its extensions. However, in recent years, there were some attempts to tackle the quantification of algorithmic complexities in quantum systems based on the Kolmogorov algorithmic complexity, obtaining some discrepant results against the classical approach. Therefore, an approach to the complexity measure is proposed here, using the quantum information formalism, taking advantage of the generality of the classical-based complexities, and being capable of expressing these systems' complexity on other framework than its algorithmic counterparts. To do so, the Shiner–Davison–Landsberg (SDL) complexity framework is considered jointly with linear entropy for the density operators representing the analyzed systems formalism along with the tangle for the entanglement measure. The proposed measure is then applied in a family of maximally entangled mixed state.
In the past decades, all of the efforts at quantifying systems complexity with a general tool has usually relied on using Shannon's classical information framework to address the disorder of the system through the Boltzmann–Gibbs–Shannon entropy, or one of its extensions. However, in recent years, there were some attempts to tackle the quantification of algorithmic complexities in quantum systems based on the Kolmogorov algorithmic complexity, obtaining some discrepant results against the classical approach. Therefore, an approach to the complexity measure is proposed here, using the quantum information formalism, taking advantage of the generality of the classical-based complexities, and being capable of expressing these systems' complexity on other framework than its algorithmic counterparts. To do so, the Shiner–Davison–Landsberg (SDL) complexity framework is considered jointly with linear entropy for the density operators representing the analyzed systems formalism along with the tangle for the entanglement measure. The proposed measure is then applied in a family of maximally entangled mixed state.
An extension of SDL (Shiner, Davison, Landsberg) and LMC (López-Ruiz, Mancini, Calbet) complexity measures is proposed for the quantum information context, considering that Von Neumann entropy is a natural disorder quantifier for quantum states. As a first example of application, the simple qubit was studied, presenting results similar to that obtained by applying SDL and LMC measures to a classical probability distribution. Then, for the Werner state, a mixture of Bell states, SDL and LMC measures were calculated, depending on the mixing factor γ , providing some conjectures concerning quantum systems.
The complexity measures role has become much clearer in recent years as they help to better understand complex systems dynamical behavior. Even though the large number of measures proposed to tackle this issue for classical systems, for quantum systems only Kolmogorov’s algorithm complexity extensions have been proposed. Hence, the present approach makes use of a new and mathematically well-established complexity measure for classical systems and extends it to assess quantum states complexity as well. Then the proposed extension is applied to a mixed state constructed with a W-state together with controlled white noise, showing a convex behavior of quantum state complexity. Thus, this reinforces the differences from previous known quantum complexities.
This paper introduces a generalized definition of quantum information entropy, aiming to provide a more comprehensive framework for quantifying information in complex quantum systems. The core of this work lies in extending the conventional concept of entropy, traditionally applied to classical information, to the realm of quantum mechanics. We explore various types of quantum entropy, including von Neumann entropy, relative entropy, and a newly proposed generalized entropy, denoted as *Eg*. The definition of *Eg* is based on a novel approach that considers the entanglement structure and correlations within quantum states. We establish relationships between these different entropy measures, demonstrating their interconnectedness within the broader context of quantum information theory. The paper further outlines a mathematical formalism for calculating *Eg*, providing a tool for analyzing and characterizing quantum information. Our generalized entropy provides a more flexible and potentially more accurate measure of quantum information, particularly in scenarios involving complex quantum correlations and multi-partite quantum systems. ---
This paper investigates the potential impact of quantum mechanics on Kolmogorov complexity, a fundamental concept in information theory. The core claim is that quantum phenomena, specifically entanglement and superposition, introduce limitations to the compression achievable through Kolmogorov complexity that are absent in the classical framework. We demonstrate through theoretical analysis that certain datasets exhibit compression ratios exceeding those attainable by classical methods, leveraging the unique properties of quantum states. This extends Kolmogorov complexity by incorporating quantum principles, offering a novel perspective on the nature of information and its quantification. The theoretical framework presented here highlights potential discrepancies between classical and quantum notions of information and sets the stage for future research exploring the implications of quantum mechanics for fundamental information theory. We present a novel approach to defining Kolmogorov complexity within a quantum context, focusing on the measurement problem and its effect on the ability to uniquely determine a string. This work doesn't present experimental results; it is a purely theoretical exploration.
We introduce a quantifier of phase-space complexity for discrete-variable (DV) quantum systems. Motivated by a recent framework developed for continuous-variable systems, we construct a complexity measure of quantum states based on the Husimi Q-function defined over spin coherent states. The quantifier combines into a single scalar quantity two complementary information-theoretic quantities, the Wehrl entropy, which captures phase-space spread, and the Fisher information, which captures localization. We derive fundamental properties of this measure, including its invariance under SU(2) displacements. The complexity is normalized such that coherent states have unit complexity, while the completely mixed state has zero complexity, a feature distinct from the continuous-variable case. We provide analytic expressions for several relevant families of states, including Gibbs and Dicke states, and perform a numerical analysis of spin-squeezed states, NOON states, and randomly generated states. Numerical results reveal a monotonic, but not deterministic, relationship between complexity and purity, leading us to conjecture that maximal complexity is attained by pure states, thereby connecting the problem to the optimization of Wehrl entropy via Majorana constellations. Finally, we extend the framework to quantum channels, defining measures for both the generation and breaking of complexity. We analyze the performance of common unitary gates and the amplitude damping channel, showing that while low-dimensional systems can achieve maximal complexity via spin squeezing or NOON states, this becomes impossible in higher dimensions. These results highlight dimension-dependent limitations in the generation of phase-space complexity and establish a unified phase-space approach to complexity across both continuous and discrete variable regimes.
A new canonical divergence is put forward for generalizing an information-geometric measure of complexity for both classical and quantum systems. On the simplex of probability measures, it is proved that the new divergence coincides with the Kullback-Leibler divergence, which is used to quantify how much a probability measure deviates from the non-interacting states that are modeled by exponential families of probabilities. On the space of positive density operators, we prove that the same divergence reduces to the quantum relative entropy, which quantifies many-party correlations of a quantum state from a Gibbs family.