Related papers: Lanczos spectrum for random operator growth
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 consider growth of local operators under Euclidean time evolution in lattice systems with local interactions. We derive rigorous bounds on the operator norm growth and then proceed to establish an analog of the Lieb-Robinson bound for…
Krylov complexity is an attractive measure for the rate at which quantum operators spread in the space of all possible operators under dynamical evolution. One expects that its late-time plateau would distinguish between integrable and…
We show constructively that, under certain regularity assumptions, any system of coupled linear differential equations with variable coefficients can be tridiagonalized by a time-dependent Lanczos-like method. The proof we present formally…
Solving short and long time dynamics of closed quantum many-body systems is one of the main challenges of both atomic and condensed matter physics. For locally interacting closed systems, the dynamics of local observables can always be…
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 this paper, we studied a set of generalised Krylov complexity for operator growth. We demonstrate their universal features at both initial times and long times using half-analytical technique as well as numerical results. In particular,…
In the Wigner-Weyl phase space formulation of quantum mechanics, we analyse the problem of the spreading of an initial state or an initial operator under time evolution when described in terms of the Krylov basis. After constructing the…
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…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
We generalize the diffusion-limited aggregation by issuing many randomly-walking particles, which stick to a cluster at the discrete time unit providing its growth. Using simple combinatorial arguments we determine probabilities of…
We present an overview of randomized orthogonalization techniques that construct a well-conditioned basis whose sketch is orthonormal. Randomized orthogonalization has recently emerged as a powerful paradigm for reducing the computational…
The density-matrix and Heisenberg formulations of quantum mechanics follow--for unitary evolution--directy from the Schr"odinger equation. Nevertheless, the symmetries of the corresponding evolution operator, the Liouvillian L=i[.,H], need…
We study the statistical properties of the spread complexity in the Krylov space of quantum systems driven across a quantum phase transition. Using the diabatic Magnus expansion, we map the evolution to an effective one-dimensional hopping…
In this chapter, we demonstrate how real-time quantum Krylov subspace methods can be adapted to investigate open quantum systems described by the Lindblad formalism. We apply these methods to a two-photon-driven superconducting Kerr…
We explore Krylov complexity for two exactly solvable models, one in the Wheeler-DeWitt (WDW) quantum cosmology and another in loop quantum cosmology (LQC), for a spatially flat, homogeneous, and isotropic universe sourced with a massless…
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…
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.…
Recently, the propagation of information through quantum many-body systems, developed to study quantum chaos, have found many application from black holes to disordered spin systems. Among other quantitative tools, Krylov complexity has…
Krylov complexity provides a powerful framework for characterizing the dynamical evolution of quantum systems through the spreading of states in Krylov space. The motivation for this is rooted in the optimality of the Krylov basis for the…