Unsupervised Techniques to Detect Quantum Chaos
arXiv:2507.12887 · doi:10.1063/10.0034346
Abstract
Conventional spectral probes of quantum chaos require eigenvalues, and sometimes, eigenvectors of the quantum Hamiltonian. This involves computationally expensive diagonalization procedures. We test whether an unsupervised neural network can detect quantum chaos directly from the Hamiltonian matrix. We use a single-body Hamiltonian with an underlying random graph structure and random coupling constants, with a parameter that determines the randomness of the graph. The spectral analysis shows that increasing the amount of randomness in the underlying graph results in a transition from integrable spectral statistics to chaotic ones. We show that the same transition can be detected via unsupervised neural networks, or more specifically, Self-Organizing Maps by feeding the Hamiltonian matrix directly into the neural network, without any diagonalization procedure.
17 pages
References in corpus (39)
- From Quantum Chaos and Eigenstate Thermalization to Statistical Mechanics and Thermodynamics
- Random Matrix Theories in Quantum Physics: Common Concepts
- Anderson Transitions
- Localization of interacting fermions at high temperature
- The distribution of the ratio of consecutive level spacings in random matrix ensembles
- A high-bias, low-variance introduction to Machine Learning for physicists
- Anderson localization on the Bethe lattice: non-ergodicity of extended states
- Anomalous Localization in Low-Dimensional Systems with Correlated Disorder
- Many-body localization and delocalization in large quantum chains
- Anderson localization on random regular graphs
- Polynomially filtered exact diagonalization approach to many-body localization
- Non-ergodic phases in strongly disordered random regular graphs
- Fractality of wave functions on a Cayley tree: Difference between a tree and a locally tree-like graph without boundary
- Shift-invert diagonalization of large many-body localizing spin chains
- From Anderson localization on Random Regular Graphs to Many-Body localization
- Random incidence matrices: moments of the spectral density
- Random matrix analysis of complex networks
- Sparse Sachdev-Ye-Kitaev model, quantum chaos and gravity duals
- Many-body level statistics of single-particle quantum chaos
- An exponential ramp in the quadratic Sachdev-Ye-Kitaev model
- Deep Learning the Quantum Phase Transitions in Random Electron Systems: Applications to Three Dimensions
- Localization transition on complex networks via spectral statistics
- A minimal model of many body localization
- Complex Quantum Networks: a Topical Review
- Neural network setups for a precise detection of the many-body localization transition: finite-size scaling and limitations
- Delocalization and ergodicity of the Anderson model on Bethe lattices
- Construction of Hamiltonians by supervised learning of energy and entanglement spectra
- Revealing quantum chaos with machine learning
- Renormalization Group Analysis of the Anderson Model on Random Regular Graphs
- Scaling up the Anderson transition in random-regular graphs
- Universal Dephasing Mechanism of Many-Body Quantum Chaos
- Out-of-time-order correlators and Lyapunov exponents in sparse SYK
- Multifractal phase in the weighted adjacency matrices of random Erdös-Rényi graphs
- An analysis of localization transitions using non-parametric unsupervised learning
- Probing Criticality in Quantum Spin Chains with Neural Networks
- Chaos and Scrambling in Quantum Small Worlds
- Tensor product random matrix theory
- Noise signal as input data in self-organized neural networks
- Neural Networks as Universal Probes of Many-Body Localization in Quantum Graphs