Related papers: Krylov complexity, path integrals, and instantons
Krylov space methods provide an efficient framework for analyzing the dynamical aspects of quantum systems, with tridiagonal matrices playing a key role. Despite their importance, the behavior of such matrices from chaotic to integrable…
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 ask whether Krylov complexity is mutually compatible with the circuit and Nielsen definitions of complexity. We show that the Krylov complexities between three states fail to satisfy the triangle inequality and so cannot be a measure of…
Krylov subspace methods are among the most extensively studied early fault-tolerant quantum algorithms for estimating ground-state energies of quantum systems. However, the rapid onset of ill-conditioning might make accurate energies…
Quantifying complexity in quantum systems has witnessed a surge of interest in recent years, with Krylov-based measures such as Krylov complexity ($C_K$) and Spread complexity ($C_S$) gaining prominence. In this study, we investigate their…
Spread complexity uses the distribution of support of a time-evolving state in the Krylov basis to quantify dispersal across accessible dimensions of a Hilbert space. Here, we describe how variations in initial conditions, the Hamiltonian,…
We perform a systematic holographic study of Krylov complexity for a wide class of confining quantum field theories. Using the geometric prescription that identifies the time derivative of the complexity with the proper momentum of a…
We present a Krylov space based theoretical framework for modeling inhomogeneous spin ensembles with arbitrary distributions of spin frequencies and couplings. The framework is then used to asymptotically large spin ensemble. In the…
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…
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…
The complexity and the chaos degree can be used to examine the chaotic aspects of not only several nonlinear classical and quantum physical physics but also life sciences. We will construct a model describing the function of brain in the…
Many quantum integrable systems are obtained using an accelerator physics technique known as Ermakov (or normalized variables) transformation. This technique was used to create classical nonlinear integrable lattices for accelerators and…
Many quantum integrable systems are obtained using an accelerator physics technique known as Ermakov (or normalized variables) transformation. This technique was used to create classical nonlinear integrable lattices for accelerators and…
In this paper, we present some results on information, complexity and entropy as defined below and we discuss their relations with the Kolmogorov-Sinai entropy which is the most important invariant of a dynamical system. These results have…
Recently, the out-of-time-ordered correlator(OTOC) and Krylov complexity have been studied actively as a measure of operator growth. OTOC is known to exhibit exponential growth in chaotic systems, which was confirmed in many previous works.…
In this work, we find that the complexity of quantum many-body states, defined as a spread in the Krylov basis, may serve as a new probe that distinguishes topological phases of matter. We illustrate this analytically in one of the…
We study the statistical properties of Lanczos coefficients over an ensemble of random initial operators generating the Krylov space. We propose two statistical quantities that are important in characterizing the complexity: the average…
The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity (QC), and rigorous mathematical proofs of its basic properties. The definition used here is similar to that by Berthiaume, van Dam, and Laplante. It…
Classical quasi-integrable systems are known to have Lyapunov times much shorter than their ergodicity time -- the most clear example being the Solar System -- but the situation for their quantum counterparts is less well understood. As a…
In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce this string as its output. It is a measure of the…