Related papers: Krylov Complexity
In this work, we investigate spectral complexity and Krylov complexity in quantum billiard systems at finite temperature. We study both circle and stadium billiards as paradigmatic examples of integrable and non-integrable…
The IP matrix model is a simple large $N$ quantum mechanical model made up of an adjoint harmonic oscillator plus a fundamental harmonic oscillator. It is a model introduced previously as a toy model of the gauge theory dual of an AdS black…
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…
When a solution to an abstract inverse linear problem on Hilbert space is approximable by finite linear combinations of vectors from the cyclic subspace associated with the datum and with the linear operator of the problem, the solution is…
We study a precise and computationally tractable notion of operator complexity in holographic quantum theories, including the ensemble dual of Jackiw-Teitelboim gravity and two-dimensional holographic conformal field theories. This is a…
We show that Hall's exact uncertainty relation acquires a simple geometric form in the Krylov basis generated by the Liouvillian. In this canonical operator frame, the uncertainty equality implies that the operator amplitude vector evolves…
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…
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 investigate various aspects of the Lanczos coefficients in a family of free Lifshitz scalar theories, characterized by their integer dynamical exponent, at finite temperature. In this non-relativistic setup, we examine the effects of…
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 quantum chaotic features of the brickwall model, which is obtained by introducing a stretched horizon - a Dirichlet wall placed outside the event horizon - within the BTZ geometry. This simple yet effective model has been…
We point out an interesting connection between the mathematical framework of the Krylov basis, which is used to quantify quantum complexity, and the entanglement entropy in high-energy QCD. In particular, we observe that the cascade…
Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely…
We consider the statistics of the results of a measurement of the spreading operator in the Krylov basis generated by the Hamiltonian of a quantum system starting from a specified initial pure state. We first obtain the probability…
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…
In high-energy physics, confinement denotes the tendency of fundamental particles to remain bound together, preventing their observation as free, isolated entities. Interestingly, analogous confinement behavior emerges in certain condensed…
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…
We study quantum-to-classical correspondence of the Krylov space for evolutions driven by unitary maps with a classical limit. This entails a proper definition of corresponding quantum and classical operators, inner products and initial…
We study the growth and saturation of Krylov spread (K-) complexity under random quantum circuits. In Haar-random unitary evolution, we show that, for large system sizes, K-complexity grows linearly before saturating at a late-time value of…
Some established and also novel techniques in the field of applications of algorithmic (Kolmogorov) complexity currently co-exist for the first time and are here reviewed, ranging from dominant ones such as statistical lossless compression…