2011/01/13 by Gavriel Segre, Segre, Gavriel
Computer Science · Mathematics · Physics and Astronomy · #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #FOS: Physical sciences #Mathematical Physics (math-ph) #Quantum Computing Algorithms and Architecture #math-ph #math.MP
paper · pdf · doi:10.48550/arxiv.1101.2667
arxiv created 2011/01/13 · openalex publication_date 2011/01/13 · arxiv updated 2011/01/18 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.