Related papers: Krylov Complexity in Supersymmetric Large-$N$ Quan…
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…
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…
We investigate how a thermodynamical first-order phase transition affects the dynamical chaotic behaviour of a given model. To this effect, we analyze the model of Berkooz, Brukner, Jia and Mamroud that interpolates between the…
In this paper we study Krylov complexity in the presence of single and multiple operators in the DSSYK model, where we can use the analytical techniques coming from chord diagrammatics. One of the results we obtain is that it showcases the…
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…
We investigate the relationship between Krylov complexity and operator quantum speed limits (OQSLs) of the complexity operator and level repulsion in random/integrable matrices and many-body systems. An enhanced level-repulsion corresponds…
In a quantum many-body system, autocorrelation functions can determine linear responses nearby equilibrium and quantum dynamics far from equilibrium. In this letter, we bring out the connection between the operator complexity and the…
We examine the effective field theory (EFT) of maximal chaos through the lens of Krylov complexity and the Universal Operator Growth Hypothesis. We test the relationship between two measures of quantum chaos: out-of-time-ordered correlators…
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 Hermitian systems, Krylov complexity has emerged as a powerful diagnostic of quantum dynamics, capable of distinguishing chaotic from integrable phases, in agreement with established probes such as spectral statistics and…
Krylov subspace methods quantify operator growth in quantum many-body systems through Lanczos coefficients that encode how operators spread under time evolution. Although these diagnostics were originally motivated by questions of chaos and…
Understanding the complexity of quantum many-body systems has been attracting much attention recently for its fundamental importance in characterizing complex quantum phases beyond the scope of quantum entanglement. Here, we investigate…
In quantum many-body systems, time-evolved states typically remain confined to a smaller region of the Hilbert space known as the $\textit{Krylov subspace}$. The time evolution can be mapped onto a one-dimensional problem of a particle…
In this work, we propose a quantum-mechanically measurable basis for the computation of spread complexity. Current literature focuses on computing different powers of the Hamiltonian to construct a basis for the Krylov state space and the…
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,…
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,…
Krylov complexity (K-complexity) is a measure of quantum state complexity that minimizes wavefunction spreading across all the possible bases. It serves as a key indicator of operator growth and quantum chaos. In this work, K-complexity and…
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 Krylov subspace methods, being one category of the most important classical numerical methods for linear algebra problems, can be much more powerful when generalised to quantum computing. However, quantum Krylov subspace algorithms are…
We investigate the phase transitions from chaotic to nonchaotic dynamics in a quantum spin chain with a local non-Hermitian disorder, which can be realized with a Rydberg atom array setting. As the disorder strength increases, the emergence…