Related papers: Quantum entropy and complexity
We develop a theory of the algorithmic information in bits contained in an individual pure quantum state. This extends classical Kolmogorov complexity to the quantum domain retaining classical descriptions. Quantum Kolmogorov complexity…
Complex systems are often inherently non-ergodic and non-Markovian for which Shannon entropy loses its applicability. In particular accelerating, path-dependent, and aging random walks offer an intuitive picture for these non-ergodic and…
We show that the main difference between classical and quantum systems can be understood in terms of information entropy. Classical systems can be considered the ones where the internal dynamics can be known with arbitrary precision while…
The quantum ergotropy quantifies the maximal amount of work that can be extracted from a quantum state without changing its entropy. Given that the ergotropy can be expressed as the difference of quantum and classical relative entropies of…
Aim of this short note is to study Shannon's entropy power along entropic interpolations, thus generalizing Costa's concavity theorem. We shall provide two proofs of independent interest: the former by $\Gamma$-calculus, hence applicable to…
We present a classical probability model appropriate to the description of quantum randomness. This tool, that we have called stochastic gauge system, constitutes a contextual scheme in which the Kolmogorov probability space depends upon…
Some aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize how a…
We trace the history of empirical entropy, touching briefly on its relation to Markov processes, normal numbers, Shannon entropy, the Chomsky hierarchy, Kolmogorov complexity, Ziv-Lempel compression, de Bruijn sequences and stochastic…
We construct the equation of a state of the classical QGP valid for all values of Gamma=V/K, the ratio of the mean Coulomb to kinetic energy. By enforcing the Gibbs relations, we derive the pertinent pressure and entropy densities for all…
We explore a recently introduced quantum thermodynamic entropy $S^Q_{univ}$ of a pure state of a composite system-environment computational "universe" with a simple system $\mathcal{S}$ coupled to a constant temperature bath $\mathcal{E}$.…
A direct connection of information entropy $S$ and kinetic energy $T$ is obtained for nuclei and atomic clusters, which establishes $T$ as a measure of the information in a distribution. It is conjectured that this is a universal property…
It is shown that quantum mechanics is a plausible statistical description of an ontology described by classical electrodynamics. The reason that no contradiction arises with various no-go theorems regarding the compatibility of QM with a…
The interplay of non-classical volume, von Neumann entropy, entropy production, and ergotropy is investigated in various open quantum systems. Two categories of open quantum system models are utilized: spin-spin and spin-boson interaction…
If we start from certain functional relations as definition of a quantum integrable theory, then we can derive from them a linear integral equation. It can be extended, by introducing dynamical variables, to become an equation with the form…
It is by now well known that the Boltzmann-Gibbs-von Neumann-Shannon logarithmic entropic functional ($S_{BG}$) is inadequate for wide classes of strongly correlated systems: see for instance the 2001 Brukner and Zeilinger's {\it Conceptual…
We propose a compression-based version of the empirical entropy of a finite string over a finite alphabet. Whereas previously one considers the naked entropy of (possibly higher order) Markov processes, we consider the sum of the…
The aim of this paper is studying from an alternative point of view the integrability of the spin chain with long-range elliptic interactions introduced by Inozemtsev. Our analysis relies on some well-established conjectures characterizing…
G\'acs' coarse-grained algorithmic entropy leverages universal computation to quantify the information content of any given physical state. Unlike the Boltzmann and Gibbs-Shannon entropies, it requires no prior commitment to macrovariables…
The computational challenges posed by many-particle quantum systems are often overcome by mixed quantum-classical (MQC) models in which certain degrees of freedom are treated as classical while others are retained as quantum. One of the…
Many statements from the classic information theory (the theory of Shannon's entropy) have natural counterparts in the algorithmic information theory (in the framework of Kolmogorov complexity). In this paper we discuss one simple instance…