Related papers: Krylov complexity, path integrals, and instantons
Recently, a novel measure for the complexity of operator growth is proposed based on Lanczos algorithm and Krylov recursion method. We study this Krylov complexity in quantum mechanical systems derived from some well-known local toric…
We introduce an analytical solution to the one of the most familiar problems from the elementary quantum mechanics textbooks. The following discussion provides simple illustrations to a number of general concepts of quantum chaology, along…
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…
Many quantum gravitational frameworks, such as DBI inflation, k-essence, and effective field theories obtained by integrating out heavy modes, can lead to a non-trivial sound speed. Meanwhile, our universe can be described as an open…
Krylov complexity and Nielsen complexity are successful approaches to quantifying quantum evolution complexity that have been actively pursued without much contact between the two lines of research. The two quantities are motivated by…
We establish a unified framework connecting decoherence and quantum complexity. By vectorizing the density matrix into a pure state in a double Hilbert space, a decoherence process is mapped to an imaginary-time evolution. Expanding this…
In quantum systems, purification can map mixed states into pure states and a non-unitary evolution into a unitary one by enlarging the Hilbert space. We establish a connection between the complexities of mixed quantum states and their…
The spreading of quantum states in Krylov space under unitary dynamics provides a natural framework for characterizing quantum complexity. Quantifiers of this spreading, such as the spread complexity and the inverse participation ratio,…
Considering the large-$q$ expansion of the Sachdev-Ye-Kitaev (SYK) model in the two-stage limit, we compute the Lanczos coefficients, Krylov complexity, and the higher Krylov cumulants in subleading order, along with the $t/q$ effects. The…
We investigate Krylov complexity in open quantum systems using Lindblad master equations for bosonic bath models, with particular emphasis on the Caldeira--Leggett model. Krylov complexity is computed from the moments of the two-point…
This article tackles a fundamental long-standing problem in quantum chaos, namely, whether quantum chaotic systems can exhibit sensitivity to initial conditions, in a form that directly generalizes the notion of classical chaos in phase…
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…
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…
An elementary application of Algorithmic Complexity Theory to the polygonal approximations of curved billiards-integrable and chaotic-unveils the equivalence of this problem to the procedure of quantization of classical systems: the scaling…
Krylov complexity is a novel measure of operator complexity that exhibits universal behavior and bounds a large class of other measures. In this letter, we generalize Krylov complexity from a closed system to an open system coupled to a…
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…
The problem of characterizing complexity of quantum dynamics - in particular of locally interacting chains of quantum particles - will be reviewed and discussed from several different perspectives: (i) stability of motion against external…
This work provides a nonasymptotic error analysis of quantum Krylov algorithms based on real-time evolutions, subject to generic errors in the outputs of the quantum circuits. We prove upper and lower bounds on the resulting ground state…
We present a general framework in which both Krylov state and operator complexities can be put on the same footing. In our formalism, the Krylov complexity is defined in terms of the density matrix of the associated state which, for the…
We study Krylov complexity for quantum systems whose Hamiltonians factorise as tensor products. We prove that complexity is superadditive under tensor products, $C_{12}\ge C_1+C_2$, and identify a positive operator that quantifies the…