Classification of the automorphisms of the noncommutative torus among the (chaotic and non-chaotic) shallow ones and the non-chaotic complex ones
Gavriel Segre

TL;DR
This paper classifies automorphisms of the noncommutative torus based on quantum logical depth, distinguishing between chaotic, non-chaotic shallow, and non-chaotic complex types, to understand their complexity and behavior.
Contribution
It introduces a classification of noncommutative torus automorphisms using quantum logical depth, highlighting distinctions between chaotic and non-chaotic, shallow and complex automorphisms.
Findings
Automorphisms are classified into chaotic and non-chaotic categories.
Quantum logical depth effectively differentiates automorphism complexity.
The classification reveals structural insights into noncommutative torus automorphisms.
Abstract
Adopting the measure of quantum complexity, the quantum logical depth, previously introduced by the author the automorphisms of the noncommutative torus are classified among the (chaotic and non-chaotic) shallow ones and the non-chaotic complex ones.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Quantum Computing Algorithms and Architecture · Benford’s Law and Fraud Detection
