Gacs Algorithmic Complexity on Hilbert Spaces and Some of its Applications
Quantum Physics
2015-11-03 v1 Information Theory
math.IT
Abstract
We extend the notion of Gacs quantum algorithmic entropy, originally formulated for finitely many qubits, to infinite dimensional quantum spin chains and investigate the relation of this extension with two quantum dynamical entropies that have been proposed in recent years. Further, we prove an extension of Brudno's theorem in quantum spin chains with shift dynamics.
Keywords
Cite
@article{arxiv.1511.00635,
title = {Gacs Algorithmic Complexity on Hilbert Spaces and Some of its Applications},
author = {Samad Khabbazi Oskouei},
journal= {arXiv preprint arXiv:1511.00635},
year = {2015}
}
Comments
102 pages, PhD Thesis