Related papers: Krylov Complexity in Calabi-Yau Quantum Mechanics
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…
We investigate Krylov state complexity as a probe of the quantum Mpemba effect in quantum spin chains. For models without global $U(1)$ symmetry, Krylov complexity exhibits clear Mpemba-like crossings, consistent with conventional…
We consider the problem of model reduction for Markovian quantum systems whose dynamics are described by a time-dependent Lindblad generator -- notably, as arising in the presence of external control. Our approach, which builds upon Krylov…
We investigate signatures of quantum chaos within Ising spin chains subjected to transverse and longitudinal fields, incorporating both local (nearest-neighbor) and non-local (long-range) couplings. While local Ising models may exhibit…
Compared to the classical Lanczos algorithm, the $s$-step Lanczos variant has the potential to improve performance by asymptotically decreasing the synchronization cost per iteration. However, this comes at a cost. Despite being…
In this work, we investigate the impact of conserved charges on the dynamics of spread complexity of quantum states. Building on the notion of symmetry-resolved Krylov complexity [1], we extend the framework to general quantum states and…
We report an implementation of the recursion method that addresses quantum many-body dynamics in the nonperturbative regime. The method essentially amounts to constructing a Lanczos basis in the space of operators and solving coupled…
We consider the following constrained Rayleigh quotient optimization problem (CRQopt) $$ \min_{x\in \mathbb{R}^n} x^{T}Ax\,\,\mbox{subject to}\,\, x^{T}x=1\,\mbox{and}\,C^{T}x=b, $$ where $A$ is an $n\times n$ real symmetric matrix and $C$…
We suggest a method to compute approximations to temporal correlation functions of few-body observables in chaotic many-body systems in the thermodynamic limit based on the respective Lanczos coefficients. Given the knowledge of these…
In recent years, there has been growing interest in characterizing the complexity of quantum evolutions of interacting many-body systems. When a time-independent Hamiltonian governs the dynamics, Krylov complexity has emerged as a powerful…
One of the fundamental manifestations of classical chaos is exponential sensitivity to initial conditions that is, two trajectories starting from nearly identical initial states diverge exponentially over time. This behavior is quantified…
We present a mapping of the nonlinear, electrostatic Vlasov equation with Krook-type collision operators, discretized on a (1+1) dimensional grid, onto a recent Carleman linearization-based quantum algorithm for solving ordinary…
The operator growth hypothesis (OGH) is a technical conjecture about the behaviour of operators -- specifically, the asymptotic growth of their Lanczos coefficients -- under repeated action by a Liouvillian. It is expected to hold for a…
We demonstrate that time-evolved operators can construct a Krylov space to compute Operator complexity and introduce Krylov observability as a measure of effective phase space dimension in quantum systems. We test Krylov observability in…
In classical chaotic systems the entropy, averaged over initial phase space distributions, follows an universal behavior. While approaching thermal equilibrium it passes through a stage where it grows linearly, while the growth rate, the…
We study the universal properties of the Lanczos algorithm applied to finite-size many-body quantum systems. Focusing on autocorrelation functions of local operators and on their infinite-time behaviour at finite size, we conjecture that in…
The Lanczos method with implicit restarting is one of the most popular methods for finding a few exterior eigenpairs of a large symmetric matrix $A$. Usually based on polynomial filtering, restarting is crucial to limit memory and the cost…
In this work we introduce a memory-efficient method for computing the action of a Hermitian matrix function on a vector. Our method consists of a rational Lanczos algorithm combined with a basis compression procedure based on rational…
Lyapunov exponents are well-known characteristic numbers that describe growth rates of perturbations applied to a trajectory of a dynamical system in different state space directions. Covariant (or characteristic) Lyapunov vectors indicate…
In this work, we study quantum chaos by focusing on the evolution of initially close states in the dynamics of the Quantum Kicked Rotor (QKR). We propose a novel measure, the Quantum Lyapunov Exponent (QLE), to quantify the degree of chaos…