Quantum Dynamical Entropies and G'acs Algorithmic Entropy.
In: Entropy, Jg. 14 (2012-07-01), Heft 7, S. 1259-1273
Online
academicJournal
Zugriff:
Several quantum dynamical entropies have been proposed that extend the classical Kolmogorov-Sinai (dynamical) entropy. The same scenario appears in relation to the extension of algorithmic complexity theory to the quantum realm. A theorem of Brudno establishes that the complexity per unit time step along typical trajectories of a classical ergodic system equals the KS-entropy. In the following, we establish a similar relation between the Connes-Narnhofer-Thirring quantum dynamical entropy for the shift on quantum spin chains and the G'acs algorithmic entropy. We further provide, for the same system, a weaker linkage between the latter algorithmic complexity and a different quantum dynamical entropy proposed by Alicki and Fannes. [ABSTRACT FROM AUTHOR]
Titel: |
Quantum Dynamical Entropies and G'acs Algorithmic Entropy.
|
---|---|
Autor/in / Beteiligte Person: | Benatti, Fabio |
Link: | |
Zeitschrift: | Entropy, Jg. 14 (2012-07-01), Heft 7, S. 1259-1273 |
Veröffentlichung: | 2012 |
Medientyp: | academicJournal |
ISSN: | 1099-4300 (print) |
DOI: | 10.3390/e14071259 |
Schlagwort: |
|
Sonstiges: |
|