Related papers: On Krylov complexity in open systems: an approach …
The complexity of quantum evolutions can be understood by examining their dispersion in a chosen basis. Recent research has stressed the fact that the Krylov basis is particularly adept at minimizing this dispersion [V. Balasubramanian et…
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…
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…
In this work, we investigate the Krylov complexity in quantum optical systems subject to time--dependent classical external fields. We focus on various interacting quantum optical models, including a collection of two--level atoms, photonic…
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 semi-classical systems, the exponential growth of the out-of-timeorder correlator (OTOC) is believed to be the hallmark of quantum chaos. However,on several occasions, it has been argued that, even in integrable systems, OTOC can grow…
Recently, Krylov complexity was proposed as a measure of complexity and chaoticity of quantum systems. We consider the stadium billiard as a typical example of the quantum mechanical system obtained by quantizing a classically chaotic…
In this paper, we study the Krylov complexity ($K$) from the planar/inflationary patch of the de Sitter space using the two mode squeezed state formalism in the presence of an effective field having sound speed $c_s$. From our analysis, we…
Krylov complexity measures operator growth with respect to a basis, which is adapted to the Heisenberg time evolution. The construction of that basis relies on the Lanczos algorithm, also known as the recursion method. The mathematics of…
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 Lifshitz-type Dirac field theories with a generic dynamical critical exponent $z$. By computing the Lanczos coefficients for massless and massive cases, we analyze the growth and saturation behavior of Krylov…
Krylov methods have reappeared recently, connecting physically sensible notions of complexity with quantum chaos and quantum gravity. In these developments, the Hamiltonian and the Liouvillian are tridiagonalized so that…
We propose and test logarithmic Krylov (logK) complexity, an operator growth measure akin to Krylov complexity defined through a replica approach, as a viable probe of early-time operator scrambling without false positives. In…
In this work, we investigate local quench dynamics in two-dimensional conformal field theories using Krylov space methods. We derive Lanczos coefficients, spread complexity, and Krylov entropies for local joining and splitting quenches in…
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…
Krylov complexity, or K-complexity for short, has recently emerged as a new probe of chaos in quantum systems. It is a measure of operator growth in Krylov space, which conjecturally bounds the operator growth measured by the out of time…
We investigate operator growth in quantum systems with two-dimensional Schr\"odinger group symmetry by studying the Krylov complexity. While feasible for semisimple Lie algebras, cases such as the Schr\"odinger algebra which is…
Building upon recent research in spin systems with non-local interactions, this study investigates operator growth using the Krylov complexity in different non-local versions of the Ising model. We find that the non-locality results in a…
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…
The time-ordered exponential is defined as the function that solves a system of coupled first-order linear differential equations with generally non-constant coefficients. In spite of being at the heart of much system dynamics, control…