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.
Highlights
Several proposals have been put forward with the aim of extending the dynamical entropy of Kolmogorov and Sinai (KS-entropy) [1] to the quantum realm [2,3,4,5,6]
While the KS-entropy is related to the rate at which information is produced by the dynamics with respect to an equilibrium state, algorithmic complexity theory has been developed by Kolmogorov, Entropy 2012, 14
Probability theory cannot sort out regular from random binary strings; for instance, in the case of a fair coin tossing, all strings of N zeroes and ones have the same probability 2−N. Algorithmic complexity measures their randomness based upon the difficulty of description by means of programs that run by Universal Turing Machines (UTM) to reproduce the target string
Summary
Several proposals have been put forward with the aim of extending the dynamical entropy of Kolmogorov and Sinai (KS-entropy) [1] to the quantum realm [2,3,4,5,6]. Since in quantum mechanics there are neither phase-space nor trajectories and, observations perturb the observed system, many different non-commutative extensions can be envisaged, all of them reducing to the KS-invariant in the case of classical, that is, commutative systems. While the KS-entropy is related to the rate at which information is produced by the dynamics with respect to an equilibrium state, algorithmic complexity theory has been developed by Kolmogorov, Entropy 2012, 14.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
