Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem
Benatti, Fabio ; Krueger, Tyll ; Mueller, Markus ; Siegmund-Schultze, Rainer ; Szkola, Arleta
arXiv, 0506080 / Harvested from arXiv
Text on arXiv
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.
Publié le : 2005-06-10
Classification:  Quantum Physics,  Computer Science - Information Theory,  Mathematical Physics,  Mathematics - Dynamical Systems 
@article{0506080,
     author = {Benatti, Fabio and Krueger, Tyll and Mueller, Markus and Siegmund-Schultze, Rainer and Szkola, Arleta},
     title = {Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem},
     journal = {arXiv},
     volume = {2005},
     number = {0},
     year = {2005},
     language = {en},
     url = {http://dml.mathdoc.fr/item/0506080}
}

Benatti, Fabio; Krueger, Tyll; Mueller, Markus; Siegmund-Schultze, Rainer; Szkola, Arleta. Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem. arXiv, Tome 2005 (2005) no. 0, . http://gdmltest.u-ga.fr/item/0506080/