We formulate and prove a quantum Shannon-McMillan theorem. The theorem demonstrates the significance of the von Neumann entropy for translation invariant ergodic quantum spin systems on n-dimensional lattices: the entropy gives the logarithm of the essential number of eigenvectors of the system on large boxes. The one-dimensional case covers quantum information sources and is basic for coding theorems.
We introduce a new isomorphism-invariant notion of entropy for measure preserving actions of arbitrary countable groups on probability spaces, which we call orbital Rokhlin entropy. It employs Danilenko's orbital approach to entropy of a partition, and is motivated by Seward's recent generalization of Rokhlin entropy from amenable to general groups. A key ingredient in our approach is the use of an auxiliary probability-measure-preserving hyperfinite equivalence relation. Under the assumption of ergodicity of the auxiliary equivalence relation, our main result is a Shannon-McMillan-Breiman poi…
We give an equivalent finitary reformulation of the classical Shannon-McMillan-Breiman theorem which has an immediate translation to the case of ergodic quantum lattice systems. This version of a quantum Breiman theorem can be derived from the proof of the quantum Shannon-McMillan theorem presented in our previous work (math.DS/0207121).
Vershik and Kerov conjectured in 1985 that dimensions of irreducible representations of finite symmetric groups, after appropriate normalization, converge to a constant with respect to the Plancherel family of measures on the space of Young diagrams. The statement of the Vershik-Kerov conjecture can be seen as an analogue of the Shannon-McMillan-Breiman Theorem for the non-stationary Markov process of the growth of a Young diagram. The limiting constant is then interpreted as the entropy of the Plancherel measure. The main result of the paper is the proof of the Vershik-Kerov conjecture. The a…
For simplest colored branching processes we prove an analog to the McMillan theorem and calculate Hausdorff dimensions of random fractals defined in terms of the limit behavior of empirical measures generated by finite genetic lines. In this setting the role of Shannon's entropy is played by the Kullback--Leibler divergence and the Hausdorff dimensions are computed by means of the so-called Billingsley--Kullback entropy, defined in the paper.
We consider random walks on locally compact groups, extending the geometric criteria for the identification of their Poisson boundary previously known for discrete groups. First, we prove a version of the Shannon-McMillan-Breiman theorem, which we then use to generalize Kaimanovich's ray approximation and strip approximation criteria. We give several applications to identify the Poisson boundary of locally compact groups which act by isometries on nonpositively curved spaces, as well as on Diestel-Leader graphs and horocylic products.
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 prove that if an ergodic action of a countable group on a probability space admits a generating partition having finite Shannon entropy then it admits a finite generating partition.
We consider stationary ergodic processes indexed by $\mathbb Z$ or $\mathbb Z^n$ whose finite dimensional marginals have laws which are absolutely continuous with respect to Lebesgue measure. We define an entropy theory for these continuous processes, prove an analog of the Shannon Breiman Mac Millan theorem and study more precisely the particular example of Gaussian processes.
The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system of finite entropy the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere. In addition the measure of $n$-cylinders is in various settings known to be lognormally distributed in the limit. In this paper the logarithm of the measure of $n$-cylinder, the information function, satisfies the almost sure invariance principle in the case in which the measure is $β$-mixing. We get a similar result for the recurrence time. Previous results are due to Ph…
The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is finite). In this paper we prove that the measure of cylinder sets are lognormally distributed for strongly mixing systems and infinite partitions and show that the rate of convergence is polynomial provided the fourth moment of the information function is finite. Also, unlike previous results by Ibragimov and others which only apply to finite partitions, here we do…
For an ergodic probability-measure-preserving action $G \curvearrowright (X, μ)$ of a countable group $G$, we define the Rokhlin entropy $h_G^{\mathrm{Rok}}(X, μ)$ to be the infimum of the Shannon entropies of countable generating partitions. It is known that for free ergodic actions of amenable groups this notion coincides with classical Kolmogorov--Sinai entropy. It is thus natural to view Rokhlin entropy as a close analogue to classical entropy. Under this analogy we prove that Krieger's finite generator theorem holds for all countably infinite groups. Specifically, if $h_G^{\mathrm{Rok}}(X…
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.
We continue the study of Rokhlin entropy, an isomorphism invariant for probability-measure-preserving actions of countable groups introduced in the previous paper. We prove that every free ergodic action with finite Rokhlin entropy admits generating partitions which are almost Bernoulli, strengthening the theorem of Abért--Weiss that all free actions weakly contain Bernoulli shifts. We then use this result to study the Rokhlin entropy of Bernoulli shifts. Under the assumption that every countable group admits a free ergodic action of positive Rokhlin entropy, we prove that: (i) the Rokhlin ent…
Let $(X,μ)$ be a standard probability space. An automorphism $T$ of $(X,μ)$ has the weak Pinsker property if for every $\varepsilon > 0$ it has a splitting into a direct product of a Bernoulli shift and an automorphism of entropy less than $\varepsilon$. This property was introduced by Thouvenot, who asked whether it holds for all ergodic automorphisms. This paper proves that it does. The proof actually gives a more general result. Firstly, it gives a relative version: any factor map from one ergodic automorphism to another can be enlarged by arbitrarily little entropy to become relatively Ber…
