Statistical features of quantum chaos using the Krylov operator complexity
Zhuoran Li, Wei Fan

TL;DR
This paper investigates the statistical properties of Lanczos coefficients in quantum chaos, revealing universal distributions and connections to random matrix theory, Anderson localization, and Krylov complexity.
Contribution
It introduces new statistical quantities for Lanczos coefficients and demonstrates their distributions are universal, linking quantum chaos to RMT and localization phenomena.
Findings
Lanczos coefficients follow Wishart and chi-square distributions
Distributions become normal for large matrix sizes
Numerical results from billiard systems support theoretical predictions
Abstract
We study the statistical properties of Lanczos coefficients over an ensemble of random initial operators generating the Krylov space. We propose two statistical quantities that are important in characterizing the complexity: the average correlation matrix of Lanczos coefficients and the resulting distribution of the variance of Lanczos coefficients. Their resulting statistics are the Wishart distribution and the (rescaled) chi-square distribution respectively, which are independent of the distributions of initial operators and become the normal distribution in the case of large matrix size. As a numerical example, we use the typical billiard system with an integrability-breaking term and choose samples of random initial operators from given probability distributions (GOE, GUE and the uniform distribution). It agrees with the phenomenological analysis and…
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
TopicsNeural Networks and Applications · Neural Networks and Reservoir Computing
