Entropy 2012, 14(7), 1259-1273; doi:10.3390/e14071259
Article

Quantum Dynamical Entropies and Gács Algorithmic Entropy

Fabio Benatti 1,2 email
1 Department of Physics, University of Trieste, Strada Costiera 11, I-34151 Trieste, Italy 2 INFN, Trieste, Strada Costiera 11, I-34151 Trieste, Italy
Received: 13 April 2012; in revised form: 8 June 2012 / Accepted: 3 July 2012 / Published: 12 July 2012
(This article belongs to the Special Issue Concepts of Entropy and Their Applications)
PDF Full-text Download PDF Full-Text [123 KB, uploaded 12 July 2012 08:44 CEST]
Abstract: 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ács 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.
Keywords: quantum spin chains; algorithmic complexity; dynamical entropy

Article Statistics

Click here to load and display the download statistics.

Cite This Article

MDPI and ACS Style

Benatti, F. Quantum Dynamical Entropies and Gács Algorithmic Entropy. Entropy 2012, 14, 1259-1273.

AMA Style

Benatti F. Quantum Dynamical Entropies and Gács Algorithmic Entropy. Entropy. 2012; 14(7):1259-1273.

Chicago/Turabian Style

Benatti, Fabio. 2012. "Quantum Dynamical Entropies and Gács Algorithmic Entropy." Entropy 14, no. 7: 1259-1273.

Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert