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.
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.
A bstract In this paper we study the notion of complexity under time evolution in chaotic quantum systems with holographic duals. Continuing on from our previous work, we turn our attention to the issue of Krylov complexity upon the insertion of a class of single-particle operators in the double-scaled SYK model. Such an operator is described by a matter-chord insertion, which splits the theory into left/right sectors, allowing us, via chord-diagram technology, to compute two different notions of complexity associated to the operator insertion: first a Krylov operator complexity, and second the Krylov complexity of a state obtained by an operator acting on the thermofield double state. We will provide both an analytic proof and detailed numerical evidence, that both Krylov complexities arise from a recursively defined basis of states characterized by a constant total chord number. As a consequence, in all cases we are able to establish that Krylov complexity is given by the expectation value of a length operator acting on the Hilbert space of the theory, expressed in terms of basis states, organized by left and right chord number. We find analytic expressions for the semiclassical limit of K-complexity, and study how the size of the operator encodes the scrambling dynamics upon the matter insertion in Krylov language. We furthermore determine the effective Hamiltonian governing the evolution of K-complexity, showing that evolution on the Krylov chain can equivalently be understood as a particle moving in a Morse potential. A particular type of triple scaling limit allows to access the gravitational sector of the theory, in which the geometrical nature of K-complexity is assured by virtue of being a total chord length, in an analogous fashion to what was found in [1] for the K-complexity of the thermofield double state.
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 Continuing the previous initiatives [1, 2], we pursue the exploration of operator growth and Krylov complexity in dissipative open quantum systems. In this paper, we resort to the bi-Lanczos algorithm generating two bi-orthogonal Krylov spaces, which individually generate non-orthogonal subspaces. Unlike the previously studied Arnoldi iteration, this algorithm renders the Lindbladian into a purely tridiagonal form, thus opening up a possibility to study a wide class of dissipative integrable and non-integrable systems by computing Krylov complexity at late times. Our study relies on two specific systems, the dissipative transverse-field Ising model (TFIM) and the dissipative interacting XXZ chain. We find that, for the weak coupling, initial Lanczos coefficients can efficiently distinguish integrable and chaotic evolution before the dissipative effect sets in, which results in more fluctuations in higher Lanczos coefficients. This results in the equal saturation of late-time complexity for both integrable and chaotic cases, making the notion of late-time chaos dubious.
A bstract We investigate Krylov complexity of the fermion chain operator which consists of multiple Majorana fermions in the double-scaled SYK (DSSYK) model with finite temperature. Using the fact that Krylov complexity is computable from two-point functions, the analysis is performed in the limit where the two-point function becomes simple and we compare the results with those of other previous studies. We confirm the exponential growth of Krylov complexity in the very low temperature regime. In general, Krylov complexity grows at most linearly at very late times in any system with a bounded energy spectrum. Therefore, we have to focus on the initial growth to see differences in the behaviors of systems or operators. Since the DSSYK model is such a bounded system, its chaotic nature can be expected to appear as the initial exponential growth of the Krylov complexity. In particular, the time at which the initial exponential growth of Krylov complexity terminates is independent of the number of degrees of freedom. More generally, and not limited to the DSSYK model, we systematically and specifically study the Lanczos coefficients and Krylov complexity using a toy power spectrum and deepen our understanding of those initial behaviors. In particular, we confirm that the overall sech-like behavior of the power spectrum shows the initial linear growth of the Lanczos coefficient, even when the energy spectrum is bounded.
Krylov state complexity, or spread complexity, has emerged as a sharp and versatile diagnostic of quantum chaos, information spreading, and many-body dynamics. Built from the Lanczos algorithm and grounded in the optimal-basis theorem, Krylov complexity thereby provides a robust spectroscopic window into quantum dynamics. A central theme is the characteristic overshoot observed in chaotic systems: a complexity peak in which chaotic evolution drives the state deeper into the Krylov chain than in integrable systems before relaxing to equilibrium. This behavior, tied to random-matrix universality classes of spectral statistics, is illustrated across a broad range of models, including quantum billiards, quantum spin chains, and variants of the SYK model. We also discuss proposed holographic descriptions of Krylov complexity in Einstein gravity, and conclude by outlining future directions and open problems, including time-dependent systems and quantum-field-theoretic formulations. A Mathematica notebook is provided for numerical exploration of Krylov complexity and spectral statistics across models.
A bstract Quantum complexity, suitably defined, has been suggested as an important probe of late-time dynamics of black holes, particularly in the context of AdS/CFT. A notion of quantum complexity can be effectively captured by quantifying the spread of an operator in Krylov space as a consequence of time evolution. Complexity is expected to behave differently in chaotic many-body systems, as compared to integrable ones. In this paper we investigate Krylov complexity for the case of interacting integrable models at finite size and find that complexity saturation is suppressed as compared to chaotic systems. We associate this behavior with a novel localization phenomenon on the Krylov chain by mapping the theory of complexity growth and spread to an Anderson localization hopping model with off-diagonal disorder, and find that localization is enhanced in the integrable case due to a stronger disorder in the hopping amplitudes, inducing an effective suppression of Krylov complexity. We demonstrate this behavior for an interacting integrable model, the XXZ spin chain, and show that the same behavior results from a phenomenological model that we define: this model captures the essential features of our analysis and is able to reproduce the behaviors we observe for chaotic and integrable systems via an adjustable disorder parameter.