2000 character limit reached
Quantum entropy and complexity (1705.09449v1)
Published 26 May 2017 in cs.IT, math.DS, math.IT, and quant-ph
Abstract: 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.