Entropy and Algorithmic Complexity in Quantum Information Theory: a Quantum Brudno's Theorem

Fabio Benatti, Tyll Krueger, Markus P. Mueller, Rainer Siegmund‐Schultze, Arleta Szkoła

In classical information theory, entropy rate and algorithmic complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum ver...