Related papers: Exactly solvable models for universal operator gro…
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…
We study a notion of operator growth known as Krylov complexity in free and interacting massive scalar quantum field theories in $d$-dimensions at finite temperature. We consider the effects of mass, one-loop self-energy due to perturbative…
The dynamics of quantum systems unfolds within a subspace of the state space or operator space, known as the Krylov space. This review presents the use of Krylov subspace methods to provide an efficient description of quantum evolution and…
In the context of chaotic quantum many-body systems, we show that operator growth, as diagnosed by out-of-time-order correlators of local operators, also leaves a sharp imprint in out-of-time-order correlators of global operators. In…
We investigate the complexity of states and operators evolved with the modular Hamiltonian by using the Krylov basis. In the first part, we formulate the problem for states and analyse different examples, including quantum mechanics,…
We study Krylov complexity in BMN Plane Wave Matrix Model at large mass deformation. We consider various consistent reductions of the matrix model that allow us to perform a Hamiltonian analysis which leads to different notions of the…
We study Krylov complexity in Schr\"odinger field theory in the grand canonical ensemble with chemical potential $\mu$, with an emphasis on the qualitatively new features that arise for $\mu>0$. In this regime the fermionic Wightman power…
The Lanczos algorithm, introduced by Cornelius Lanczos, has been known for a long time and is widely used in computational physics. While often employed to approximate extreme eigenvalues and eigenvectores of an operator, recently interest…
Krylov complexity is a measure of operator growth in quantum systems, based on the number of orthogonal basis vectors needed to approximate the time evolution of an operator. In this paper, we study the Krylov complexity of a…
The recursion method, which solves coupled Heisenberg equations in a Lanczos operator basis, has recently emerged as a powerful nonperturbative tool for computing dynamical correlation functions in strongly correlated two- and…
Assuming the existence of a general nonuniform dichotomy for the evolution operator of a non-autonomous ordinary linear differential equation in a Banach space, we establish the existence of invariant stable manifolds for the semiflow…
Operator growth, or operator spreading, describes the process where a "simple" operator acquires increasing complexity under the Heisenberg time evolution of a chaotic dynamics, therefore has been a key concept in the study of quantum chaos…
In an isolated system, the time evolution of a given observable in the Heisenberg picture can be efficiently represented in Krylov space. In this representation, an initial operator becomes increasingly complex as time goes by, a feature…
We prove an abstract result giving a $\langle t \rangle^\varepsilon$ upper bound on the growth of the Sobolev norms of a time-dependent Schr\"odinger equation of the form ${i} \dot \psi = H_0 \psi + V (t)\psi$. Here $H_0$ is assumed to be…
We present an expansion of a many-body correlation function in a sum of pseudomodes -- exponents with complex frequencies that encompass both decay and oscillations. The pseudomode expansion emerges in the framework of the Heisenberg…
Krylov complexity has recently emerged as a useful probe of operator growth and quantum dynamics in many-body systems and holographic dualities. In this paper we study its behavior in the Veneziano--Wosiek model, a supersymmetric matrix…
We announce the folowing result: Any finitely generated non virtually solvable linear group over a field of characteristic zero has uniform exponential growth.
The growth of simple operators is essential for the emergence of chaotic dynamics and quantum thermalization. Recent studies have proposed different measures, including the out-of-time-order correlator and Krylov complexity. It is…
We develop computational tools necessary to extend the application of Krylov complexity beyond the simple Hamiltonian systems considered thus far in the literature. As a first step toward this broader goal, we show how the Lanczos algorithm…
We establish a direct correspondence between the Lanczos approach and the orthogonal polynomials approach in random matrix theory. In the large-$N$ and continuum limits, the average Lanczos coefficients and the recursion coefficients become…