Papers
Topics
Authors
Recent
Search
2000 character limit reached

Krylov fractality and complexity in generic random matrix ensembles

Published 10 Jul 2024 in quant-ph, cond-mat.stat-mech, hep-th, and nlin.CD | (2407.07399v2)

Abstract: Krylov space methods provide an efficient framework for analyzing the dynamical aspects of quantum systems, with tridiagonal matrices playing a key role. Despite their importance, the behavior of such matrices from chaotic to integrable states, transitioning through an intermediate phase, remains unexplored. We aim to fill this gap by considering the properties of the tridiagonal matrix elements and the associated basis vectors for appropriate random matrix ensembles. We utilize the Rosenzweig-Porter model as our primary example, which hosts a fractal regime in addition to the ergodic and localized phases. We discuss the characteristics of the matrix elements and basis vectors across the three (ergodic, fractal, and localized) regimes and introduce tools to identify the transition points. The exact expressions of the Lanczos coefficients are provided in terms of $q$-logarithmic function across the full parameter regime. The numerical results are corroborated with analytical reasoning for certain features of the Krylov spectra. Additionally, we investigate the Krylov state complexity within these regimes, showcasing the efficacy of our methods in pinpointing these transitions.

Citations (10)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.