Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2009.01862 · Journal of High Energy Physics

Operator complexity: a journey to the edge of Krylov space

Eliezer Rabinovici, Adrián Sánchez-Garrido, Ruth Shir, Julian Sonner

Published Jun 1, 2021• 185 citations
arXivHTMLPDF

Abstract

A bstract Heisenberg time evolution under a chaotic many-body Hamiltonian H transforms an initially simple operator into an increasingly complex one, as it spreads over Hilbert space. Krylov complexity, or ‘K-complexity’, quantifies this growth with respect to a special basis, generated by H by successive nested commutators with the operator. In this work we study the evolution of K-complexity in finite-entropy systems for time scales greater than the scrambling time t s > log( S ). We prove rigorous bounds on K-complexity as well as the associated Lanczos sequence and, using refined parallelized algorithms, we undertake a detailed numerical study of these quantities in the SYK 4 model, which is maximally chaotic, and compare the results with the SYK 2 model, which is integrable. While the former saturates the bound, the latter stays exponentially below it. We discuss to what extent this is a generic feature distinguishing between chaotic vs. integrable systems.

DOI
10.1007/jhep06(2021)062

Related papers

Krylov complexity from integrability to chaos

Eliezer Rabinovici, Adrián Sánchez-Garrido, Ruth Shir +1 more

A bstract We apply a notion of quantum complexity, called “Krylov complexity”, to study the evolution of systems from integrability to chaos. For this purpose we investigate the integrable XXZ spin chain, enriched with an integrability breaking deformation that allows one to interpolate between integrable and chaotic behavior. K-complexity can act as a probe of the integrable or chaotic nature of the underlying system via its late-time saturation value that is suppressed in the integrable phase and increases as the system is driven to the chaotic phase. We furthermore ascribe the (under-)saturation of the late-time bound to the amount of disorder present in the Lanczos sequence, by mapping the complexity evolution to an auxiliary off-diagonal Anderson hopping model. We compare the late-time saturation of K-complexity in the chaotic phase with that of random matrix ensembles and find that the chaotic system indeed approaches the RMT behavior in the appropriate symmetry class. We investigate the dependence of the results on the two key ingredients of K-complexity: the dynamics of the Hamiltonian and the character of the operator whose time dependence is followed.

arXiv:2207.07701•Journal of High Energy Physics•Jul 26, 2022•144 citations

Operator Krylov complexity in random matrix theory

Tang Haifeng

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 $\mathcal{K}(t)$ in Random Matrix Theory (RMT). In large $N$ limit: (1) For infinite temperature, we analytically show that the Lanczos coefficient $\{b_n\}$ saturate to constant plateau $\lim\limits_{n\rightarrow\infty}b_n=b$, rendering a linear growing complexity $\mathcal{K}(t)\sim t$, in contrast to the exponential-in-time growth in chaotic local systems in thermodynamic limit. After numerically comparing this plateau value $b$ to a large class of chaotic local quantum systems, we find that up to small fluctuations, it actually bounds the $\{b_n\}$ in chaotic local quantum systems. Therefore we conjecture that in chaotic local quantum systems after scrambling time, the speed of linear growth of Krylov complexity cannot be larger than that in RMT. (2) For low temperature, we analytically show that $b_n$ will first exhibit linear growth with $n$, whose slope saturates the famous chaos bound. After hitting the same plateau $b$, $b_n$ will then remain constant. This indicates $\mathcal{K}(t)\sim e^{2πt/β}$ before scrambling time $t_*\sim O(β\logβ)$, and after that it will grow linearly in time, with the same speed as in infinite temperature. We finally remark on the effect of finite $N$ corrections.

arXiv:2312.17416•Dec 29, 2023•1 citation

Operator dynamics in Lindbladian SYK: a Krylov complexity perspective

Budhaditya Bhattacharjee, Pratik Nandy, Tanay Pathak

A bstract We use Krylov complexity to study operator growth in the q -body dissipative Sachdev-Ye-Kitaev (SYK) model, where the dissipation is modeled by linear and random p -body Lindblad operators. In the large q limit, we analytically establish the linear growth of two sets of coefficients for any generic jump operators. We numerically verify this by implementing the bi-Lanczos algorithm, which transforms the Lindbladian into a pure tridiagonal form. We find that the Krylov complexity saturates inversely with the dissipation strength, while the dissipative timescale grows logarithmically. This is akin to the behavior of other 𝔮-complexity measures, namely out-of-time-order correlator (OTOC) and operator size, which we also demonstrate. We connect these observations to continuous quantum measurement processes. We further investigate the pole structure of a generic auto-correlation and the high-frequency behavior of the spectral function in the presence of dissipation, thereby revealing a general principle for operator growth in dissipative quantum chaotic systems.

arXiv:2311.00753•Journal of High Energy Physics•Jan 17, 2024•57 citations

Krylov complexity as a probe for chaos

Mohsen Alishahiha, Souvik Banerjee, Mohammad Javad Vasli

Abstract In this work, we explore in detail, the time evolution of Krylov complexity. We demonstrate, through analytical computations, that in finite many-body systems, while ramp and plateau are two generic features of Krylov complexity, the manner in which complexity saturates reveals the chaotic nature of the system. In particular, we show that the dynamics towards saturation precisely distinguish between chaotic and integrable systems. For chaotic models, the saturation value of complexity reaches its infinite time average at a finite saturation time. In this case, depending on the initial state, it may also exhibit a peak before saturation. In contrast, in integrable models, complexity approaches the infinite time average value from below at a much longer timescale. We confirm this distinction using numerical results for specific spin models.

arXiv:2408.10194•The European Physical Journal C•Jul 7, 2025•18 citations

On Krylov Complexity

Adrián Sánchez-Garrido

This Thesis explores the notion of Krylov complexity as a probe of quantum chaos and as a candidate for holographic complexity. The first Part is devoted to presenting the fundamental notions required to conduct research in this area. Namely, an extensive introduction to the Lanczos algorithm, its properties and associated algebraic structures, as well as technical details related to its practical implementation, is given. Subsequently, an overview of the seminal references and the main debates regarding Krylov complexity and its relation to chaos and holography is provided. The text throughout this first Part combines review material with original analyses which either intend to contextualize, compare and criticize results in the literature, or are the fruit of the investigations leading to the publications on which this Thesis is based. These research projects are the subject of the second Part of the manuscript. In them, methods for the efficient implementation of the Lanczos algorithm in finite many-body systems were developed, allowing to compute numerically the Krylov complexity of models like SYK or the XXZ spin chain up to time scales exponentially large in system size. It was observed that the operator Krylov complexity profile in SYK, a paradigmatic low-dimensional chaotic system with a holographic dual, agrees with holographic expectations, while in the case of integrable models like XXZ complexity is affected by a novel localization effect in the so-called Krylov space which hinders its growth. Finally, an exact, analytical, correspondence between the Krylov complexity of the infinite-temperature thermofield double state in the low-energy regime of the double-scaled SYK model and bulk length in the theory of JT gravity is established.

arXiv:2407.03866•Jul 4, 2024•0 citations

Universal chaotic dynamics from Krylov space

Johanna Erdmenger B, Shao-Kai Jian, Zhuo-Yu Xian

Abstract Krylov complexity measures the spread of the wavefunction in the Krylov basis, which is constructed using the Hamiltonian and an initial state. We investigate the evolution of the maximally entangled state in the Krylov basis for both chaotic and non-chaotic systems. For this purpose, we derive an Ehrenfest theorem for the Krylov complexity, which reveals its close relation to the spectrum. Our findings suggest that neither the linear growth nor the saturation of Krylov complexity is necessarily associated with chaos. However, for chaotic systems, we observe a universal rise-slope-ramp-plateau behavior in the transition probability from the initial state to one of the Krylov basis states. Moreover, a long ramp in the transition probability is a signal for spectral rigidity, characterizing quantum chaos. Also, this ramp is directly responsible for the late-time peak of Krylov complexity observed in the literature. On the other hand, for non-chaotic systems, this long ramp is absent. Therefore, our results help to clarify which features of the wave function time evolution in Krylov space characterize chaos. We exemplify this by considering the Sachdev-Ye-Kitaev model with two-body or four-body interactions.

arXiv:2303.12151•Journal of High Energy Physics•Aug 28, 2023•112 citations
A bstract Heisenberg time evolution under a chaotic many-body Hamiltonian H transforms an initially simple operator into an increasingly complex one, as it spreads over Hilbert space. Krylov complexity, or ‘K-complexity’, quantifies this growth with respect to a special basis, generated by H by successive nested commutators with the operator. In this work we study the evolution of K-complexity in finite-entropy systems for time scales greater than the scrambling time t s > log( S ). We prove rigorous bounds on K-complexity as well as the associated Lanczos sequence and, using refined parallelized algorithms, we undertake a detailed numerical study of these quantities in the SYK 4 model, which is maximally chaotic, and compare the results with the SYK 2 model, which is integrable. While the former saturates the bound, the latter stays exponentially below it. We discuss to what extent this is a generic feature distinguishing between chaotic vs. integrable systems.
A bstract We apply a notion of quantum complexity, called “Krylov complexity”, to study the evolution of systems from integrability to chaos. For this purpose we investigate the integrable XXZ spin chain, enriched with an integrability breaking deformation that allows one to interpolate between integrable and chaotic behavior. K-complexity can act as a probe of the integrable or chaotic nature of the underlying system via its late-time saturation value that is suppressed in the integrable phase and increases as the system is driven to the chaotic phase. We furthermore ascribe the (under-)saturation of the late-time bound to the amount of disorder present in the Lanczos sequence, by mapping the complexity evolution to an auxiliary off-diagonal Anderson hopping model. We compare the late-time saturation of K-complexity in the chaotic phase with that of random matrix ensembles and find that the chaotic system indeed approaches the RMT behavior in the appropriate symmetry class. We investigate the dependence of the results on the two key ingredients of K-complexity: the dynamics of the Hamiltonian and the character of the operator whose time dependence is followed.
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 K(t)\mathcal{K}(t)K(t) in Random Matrix Theory (RMT). In large NNN limit: (1) For infinite temperature, we analytically show that the Lanczos coefficient {bn}\{b_n\}{bn​} saturate to constant plateau lim⁡n→∞bn=b\lim\limits_{n\rightarrow\infty}b_n=bn→∞lim​bn​=b, rendering a linear growing complexity K(t)∼t\mathcal{K}(t)\sim tK(t)∼t, in contrast to the exponential-in-time growth in chaotic local systems in thermodynamic limit. After numerically comparing this plateau value bbb to a large class of chaotic local quantum systems, we find that up to small fluctuations, it actually bounds the {bn}\{b_n\}{bn​} in chaotic local quantum systems. Therefore we conjecture that in chaotic local quantum systems after scrambling time, the speed of linear growth of Krylov complexity cannot be larger than that in RMT. (2) For low temperature, we analytically show that bnb_nbn​ will first exhibit linear growth with nnn, whose slope saturates the famous chaos bound. After hitting the same plateau bbb, bnb_nbn​ will then remain constant. This indicates K(t)∼e2πt/β\mathcal{K}(t)\sim e^{2πt/β}K(t)∼e2πt/β before scrambling time t∗∼O(βlog⁡β)t_*\sim O(β\logβ)t∗​∼O(βlogβ), and after that it will grow linearly in time, with the same speed as in infinite temperature. We finally remark on the effect of finite NNN corrections.
A bstract We use Krylov complexity to study operator growth in the q -body dissipative Sachdev-Ye-Kitaev (SYK) model, where the dissipation is modeled by linear and random p -body Lindblad operators. In the large q limit, we analytically establish the linear growth of two sets of coefficients for any generic jump operators. We numerically verify this by implementing the bi-Lanczos algorithm, which transforms the Lindbladian into a pure tridiagonal form. We find that the Krylov complexity saturates inversely with the dissipation strength, while the dissipative timescale grows logarithmically. This is akin to the behavior of other 𝔮-complexity measures, namely out-of-time-order correlator (OTOC) and operator size, which we also demonstrate. We connect these observations to continuous quantum measurement processes. We further investigate the pole structure of a generic auto-correlation and the high-frequency behavior of the spectral function in the presence of dissipation, thereby revealing a general principle for operator growth in dissipative quantum chaotic systems.
Abstract In this work, we explore in detail, the time evolution of Krylov complexity. We demonstrate, through analytical computations, that in finite many-body systems, while ramp and plateau are two generic features of Krylov complexity, the manner in which complexity saturates reveals the chaotic nature of the system. In particular, we show that the dynamics towards saturation precisely distinguish between chaotic and integrable systems. For chaotic models, the saturation value of complexity reaches its infinite time average at a finite saturation time. In this case, depending on the initial state, it may also exhibit a peak before saturation. In contrast, in integrable models, complexity approaches the infinite time average value from below at a much longer timescale. We confirm this distinction using numerical results for specific spin models.
This Thesis explores the notion of Krylov complexity as a probe of quantum chaos and as a candidate for holographic complexity. The first Part is devoted to presenting the fundamental notions required to conduct research in this area. Namely, an extensive introduction to the Lanczos algorithm, its properties and associated algebraic structures, as well as technical details related to its practical implementation, is given. Subsequently, an overview of the seminal references and the main debates regarding Krylov complexity and its relation to chaos and holography is provided. The text throughout this first Part combines review material with original analyses which either intend to contextualize, compare and criticize results in the literature, or are the fruit of the investigations leading to the publications on which this Thesis is based. These research projects are the subject of the second Part of the manuscript. In them, methods for the efficient implementation of the Lanczos algorithm in finite many-body systems were developed, allowing to compute numerically the Krylov complexity of models like SYK or the XXZ spin chain up to time scales exponentially large in system size. It was observed that the operator Krylov complexity profile in SYK, a paradigmatic low-dimensional chaotic system with a holographic dual, agrees with holographic expectations, while in the case of integrable models like XXZ complexity is affected by a novel localization effect in the so-called Krylov space which hinders its growth. Finally, an exact, analytical, correspondence between the Krylov complexity of the infinite-temperature thermofield double state in the low-energy regime of the double-scaled SYK model and bulk length in the theory of JT gravity is established.
Abstract Krylov complexity measures the spread of the wavefunction in the Krylov basis, which is constructed using the Hamiltonian and an initial state. We investigate the evolution of the maximally entangled state in the Krylov basis for both chaotic and non-chaotic systems. For this purpose, we derive an Ehrenfest theorem for the Krylov complexity, which reveals its close relation to the spectrum. Our findings suggest that neither the linear growth nor the saturation of Krylov complexity is necessarily associated with chaos. However, for chaotic systems, we observe a universal rise-slope-ramp-plateau behavior in the transition probability from the initial state to one of the Krylov basis states. Moreover, a long ramp in the transition probability is a signal for spectral rigidity, characterizing quantum chaos. Also, this ramp is directly responsible for the late-time peak of Krylov complexity observed in the literature. On the other hand, for non-chaotic systems, this long ramp is absent. Therefore, our results help to clarify which features of the wave function time evolution in Krylov space characterize chaos. We exemplify this by considering the Sachdev-Ye-Kitaev model with two-body or four-body interactions.