Operator Krylov complexity in random matrix theory
Haifeng Tang

TL;DR
This paper investigates Krylov complexity within Random Matrix Theory, revealing universal behaviors, bounds in chaotic systems, and temperature-dependent growth patterns, thereby connecting operator complexity with quantum chaos and thermal effects.
Contribution
It analytically characterizes Krylov complexity growth in RMT at different temperatures and proposes bounds for chaotic systems based on RMT behavior.
Findings
At infinite temperature, Krylov complexity grows linearly with time.
The Lanczos coefficient $b_n$ saturates to a constant plateau in large $N$ limit.
At low temperature, complexity exhibits exponential growth before scrambling, then linear growth afterward.
Abstract
Krylov complexity, as a novel measure of operator complexity under Heisenberg evolution, exhibits many interesting universal behaviors and also bounds many other complexity measures. In this work, we study Krylov complexity in Random Matrix Theory (RMT). In large limit: (1) For infinite temperature, we analytically show that the Lanczos coefficient saturate to constant plateau , rendering a linear growing complexity , in contrast to the exponential-in-time growth in chaotic local systems in thermodynamic limit. After numerically comparing this plateau value to a large class of chaotic local quantum systems, we find that up to small fluctuations, it actually bounds the in chaotic local quantum systems. Therefore we conjecture that in chaotic local quantum systems after scrambling…
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
TopicsTheoretical and Computational Physics · Quantum many-body systems · Statistical Mechanics and Entropy
