Gacs Algorithmic Complexity on Hilbert Spaces and Some of its Applications.
2015
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:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
33
References
2
Citations
NaN
KQI