In classical information theory, entropy rate and Kolmogorov complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two notions of quantum Kolmogorov complexity, both based on the shortest qubit descriptions of qubit strings that, run by a universal quantum Turing machine, reproduce them as outputs.
We study the relations between the recently proposed machine-independent quantum complexity of P. Gacs~\cite{Gacs} and the entropy of classical and quantum systems. On one hand, by restricting Gacs complexity to ergodic classical dynamical systems, we retrieve the equality between the Kolmogorov complexity rate and the Shannon entropy rate derived by A.A. Brudno~\cite{Brudno}. On the other hand, using the quantum Shannon-Mc Millan theorem~\cite{BSM}, we show that such an equality holds densely in the case of ergodic quantum spin chains.
We extend the notion of Gacs quantum algorithmic entropy, originally formulated for finitely many qubits, to infinite dimensional quantum spin chains and investigate the relation of this extension with two quantum dynamical entropies that have been proposed in recent years. Further, we prove an extension of Brudno's theorem in quantum spin chains with shift dynamics.
Kolmogorov introduced a concept of Epsilon-entropy to analyze information in classical continuous system. The fractal dimension of geometrical sets was introduced by Mandelbrot as a new criterion to analyze the complexity of these sets. The Epsilon-entropy and the fractal dimension of a state in general quantum system were introduced by one of the present authors in order to characterize chaotic properties of general states. In this paper, we show that Epsilon-entropy of a state includes Kolmogorov Epsilon-entropy, and the fractal dimension of a state describe fractal structure of Gaussian mea…
A central concept in the connection between physics and information theory is entropy, which represents the amount of information extracted from the system by the observer performing measurements in an experiment. Indeed, Jaynes' principle of maximum entropy allows to establish the connection between entropy in statistical mechanics and information entropy. In this sense, the dissipated energy in a classical Hamiltonian process, known as the thermodynamic entropy production, is connected to the relative entropy between the forward and backward probability densities. Recently, it was revealed t…
We discuss a quantum Kolmogorov-Sinai entropy defined as the entropy production per unit time resulting from coupling the system to a weak, auxiliary bath. The expressions we obtain are fully quantum, but require that the system is such that there is a separation between the Ehrenfest and the correlation timescales. We show that they reduce to the classical definition in the semiclassical limit, one instance where this separation holds. We show a quantum (Pesin) relation between this entropy and the sum of positive eigenvalues of a matrix describing phase-space expansion. Generalizations to th…
We show that extensive thermostatistics based on Renyi entropy and Kolmogorov-Nagumo averages can be expressed in terms of Tsallis non- extensive thermostatistics. We use this correspondence to generalize thermostatistics to a large class of Kolmogorov-Nagumo means and suitably adapted definitions of entropy.
We consider free fermion systems in arbitrary dimensions and represent the occupation pattern of each eigenstate as a classical binary string. We find that the Kolmogorov complexity of the string correctly captures the scaling behavior of its entanglement entropy (EE). In particular, the logarithmically-enhanced area law for EE in the ground state and the volume law for EE in typical highly excited states are reproduced. Since our approach does not require bipartitioning the system, it allows us to distinguish typical and atypical eigenstates directly by their intrinsic complexity. We reveal t…
The rate of entropy production in a classical dynamical system is characterized by the Kolmogorov-Sinai entropy rate $h_{\mathrm{KS}}$ given by the sum of all positive Lyapunov exponents of the system. We prove a quantum version of this result valid for bosonic systems with unstable quadratic Hamiltonian. The derivation takes into account the case of time-dependent Hamiltonians with Floquet instabilities. We show that the entanglement entropy $S_A$ of a Gaussian state grows linearly for large times in unstable systems, with a rate $Λ_A \leq h_{KS}$ determined by the Lyapunov exponents and the …
Predicting Entanglement Entropy from Particle Tunneling of Interacting Fermions Using Kolmogorov-Arnold Networks
Tulane University（杜兰大学）；Akhiezer Institute for Theoretical Physics, NSC KIPT（阿赫谢泽理论物理研究所，国立哈尔科夫物理与技术研究所）；University of Arizona（亚利桑那大学）；James C. Wyant College of Optical Sciences, University of Arizona（亚利桑那大学詹姆斯·C·怀恩特光学科学学院）；Karazin Kharkiv National University（卡扎林哈尔科夫国立大学）
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (``universal probability'') as a starting point, and define complexity (an operator) as its negative logarithm. A number of properties of Kolmogorov complexity extend naturally to the new domain. Approximately, a quantum state is simple if it is within a small distance from a low-dimensional subspace of low Kolmogorov complexity. The von Neumann entropy of a computable density matrix is within an additive constant from the average complexity. Some of the theory of randomness translat…
The Kolmogorov complexity of a string is the length of its shortest description. We define a second quantised Kolmogorov complexity where the length of a description is defined to be the average length of its superposition. We discuss this complexity's basic properties. We define the corresponding prefix complexity and show that the inequalities obeyed by this prefix complexity are also obeyed by von Neumann entropy.
We describe some basic results for Quantum Stochastic Processes and present some new results about a certain class of processes which are associated to Quantum Iterated Function Systems (QIFS). We discuss questions related to the Markov property and we present a definition of entropy which is induced by a QIFS. This definition is a natural generalization of the Shannon-Kolmogorov entropy from Ergodic Theory. This definition is different from the one in the paper "A Thermodynamic Formalism for density matrices in Quantum Information" by the same authors.
Linearity of a dynamical entropy means that the dynamical entropy of the n-fold composition of a dynamical map with itself is equal to n times the dynamical entropy of the map for every positive integer n. We show that the quantum dynamical entropy introduced by Slomczynski and Zyczkowski is nonlinear in the time interval between successive measurements of a quantum dynamical system. This is in contrast to Kolmogorov-Sinai dynamical entropy for classical dynamical systems, which is linear in time. We also compute the exact values of quantum dynamical entropy for the Hadamard walk with varying …
We present an upper bound for the Kolmogorov-Sinai entropy of quantum systems having a mixing quantum phase space. The method for this estimation is based on the following ingredients: i) the graininess of quantum phase space in virtue of the Uncertainty Principle, ii) a time rescaled KS-entropy that introduces the characteristic timescale as a parameter, and iii) the factorization property of the mixing correlations. The analogy between the structures of the mixing level of the ergodic hierarchy and of its quantum counterpart is shown. Moreover, the logarithmic timescale, characteristic of qu…
It is conjectured that in the geometric formulation of quantum computing, one can study quantum complexity through classical entropy of statistical ensembles established non-relativistically in the group manifold of unitary operators. The kinetic and positional decompositions of statistical entropy are conjectured to correspond to the Kolmogorov complexity and computational complexity, respectively, of corresponding quantum circuits. In this paper, we claim that by applying the virial theorem to the group manifold, one can derive a generic relation between Kolmogorov complexity and computation…
The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity (QC), and rigorous mathematical proofs of its basic properties. The definition used here is similar to that by Berthiaume, van Dam, and Laplante. It defines the QC of some indeterminate-length qubit string ρas the minimum base length of any quantum input which makes a quantum Turing machine (QTM) halt and output ρ, up to some error tolerance. First, we prove that there is a QTM which is universal in the sense of input base length. Furthermore, we show several general properties of QTMs, including a resul…
A definition of entropy via the Kolmogorov algorithmic complexity is discussed. As examples, we show how the meanfield theory for the Ising model, and the entropy of a perfect gas can be recovered. The connection with computations are pointed out, by paraphrasing the laws of thermodynamics for computers. Also discussed is an approach that may be adopted to develop statistical mechanics using the algorithmic point of view.
We study entanglement entropy (EE) as a signature of quantum chaos in ergodic and non-ergodic systems. In particular we look at the quantum kicked top and kicked rotor as multi-qubit systems, and investigate the single qubit EE which characterizes bipartite entanglement of this qubit with the rest of the system. We study the correspondence of the Kolmogorov-Sinai entropy of the classical kicked systems with the EE of their quantum counterparts. We find that EE is a signature of global chaos in ergodic systems, and local chaos in non-ergodic systems. In particular, we show that EE can be maximi…
We show that the coarse-grained quantum baker's map exhibits a linear entropy increase at an asymptotic rate given by the Kolmogorov-Sinai entropy of the classical chaotic baker's map. The starting point of our analysis is a symbolic representation of the map on a string of $N$ qubits, i.e., an $N$-bit register of a quantum computer. To coarse-grain the quantum evolution, we make use of the decoherent histories formalism. As a byproduct, we show that the condition of medium decoherence holds asymptotically for the coarse-grained quantum baker's map.
We consider oscillators evolving subject to a periodic driving force that dynamically entangles them, and argue that this gives the linearized evolution around periodic orbits in a general chaotic Hamiltonian dynamical system. We show that the entanglement entropy, after tracing over half of the oscillators, generically asymptotes to linear growth at a rate given by the sum of the positive Lyapunov exponents of the system. These exponents give a classical entropy growth rate, in the sense of Kolmogorov, Sinai and Pesin. We also calculate the dependence of this entropy on linear mixtures of the…
We propose a broadly applicable formalism for the description of coarse grained entropy production in quantum mechanical processes. Our formalism is based on the Husimi transform of the quantum state, which encodes the notion that information about any quantum state is limited by the experimental resolution. We show in two analytically tractable cases (the decay of an unstable vacuum state and reheating after cosmic inflation) that the growth rate of the Wehrl entropy associated with the Husimi function approaches the classical Kolmogorov-Sinai entropy. We also discuss various possible applica…
