Related papers: Krylov Complexity as a Probe for Chaos
We investigate the spread complexity of a generic two-level subsystem of a larger system to analyze the influence of energy level statistics, comparing chaotic and integrable systems. Initially focusing on the nearest-neighbor level…
Quantum chaotic systems are conjectured to display a spectrum whose fine-grained features (gaps and correlations) are well described by Random Matrix Theory (RMT). We propose and develop a complementary version of this conjecture: quantum…
Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing -- in studying the…
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…
Some aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize how a…
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…
We investigate the anatomy and complexity of quantum states in Krylov space, in the ergodic and many-body localised (MBL) phases of a disordered, interacting spin chain. The Krylov basis generated by the Hamiltonian from an initial state…
Krylov complexity is an important dynamical quantity with relevance to the study of operator growth and quantum chaos, and has recently been much studied for various time-independent systems. We initiate the study of K-complexity in…
We develop a theory of classical complexity. We study the relations between classical complexity and entropy, and conjecture that in an isolated system, classical absolute complexity always tends to grow, until it reaches its maximum. We…
We compare Krylov's state complexity with an information-geometric (IG) measure of complexity for the quantum evolution of two-level systems. Focusing on qubit dynamics on the Bloch sphere, we analyze evolutions generated by stationary and…
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…
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.…
The Lanczos algorithm offers a framework for constructing wave functions in closed and open quantum systems from their Hamiltonians. Since the early universe is inherently an open system, we employ this algorithm to investigate Krylov…
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…
We investigate the orbits of compact binary systems during the final inspiral period before coalescence by integrating numerically the second-order post-Newtonian equations of motion. We include spin-orbit and spin-spin coupling terms,…
Dynamical chaos is a fundamental manifestation of gravity in astrophysical, many-body systems. The spectrum of Lyapunov exponents quantifies the associated exponential response to small perturbations. Analytical derivations of these…
In this paper, we study the Krylov complexity ($K$) from the planar/inflationary patch of the de Sitter space using the two mode squeezed state formalism in the presence of an effective field having sound speed $c_s$. From our analysis, we…
Continuing the previous initiatives arXiv: 2207.05347 and arXiv: 2212.06180, we pursue the exploration of operator growth and Krylov complexity in dissipative open quantum systems. In this paper, we resort to the bi-Lanczos algorithm…
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…
In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. This indicator is invariant up to topological conjugation. We…