A bstract Heisenberg time evolution under a chaotic many-body Hamiltonian H transforms an initially simple operator into an increasingly complex one, as it spreads over Hilbert space. Krylov complexity, or ‘K-complexity’, quantifies this growth with respect to a special basis, generated by H by successive nested commutators with the operator. In this work we study the evolution of K-complexity in finite-entropy systems for time scales greater than the scrambling time t s > log( S ). We prove rigorous bounds on K-complexity as well as the associated Lanczos sequence and, using refined parallelized algorithms, we undertake a detailed numerical study of these quantities in the SYK 4 model, which is maximally chaotic, and compare the results with the SYK 2 model, which is integrable. While the former saturates the bound, the latter stays exponentially below it. We discuss to what extent this is a generic feature distinguishing between chaotic vs. integrable systems.
Krylov complexity, as a novel measure of operator complexity under Heisenberg evolution, exhibits many interesting universal behaviors and also bounds many other complexity measures. In this work, we study Krylov complexity
K(t) in Random Matrix Theory (RMT). In large
N limit: (1) For infinite temperature, we analytically show that the Lanczos coefficient
{bn} saturate to constant plateau
n→∞limbn=b, rendering a linear growing complexity
K(t)∼t, in contrast to the exponential-in-time growth in chaotic local systems in thermodynamic limit. After numerically comparing this plateau value
b to a large class of chaotic local quantum systems, we find that up to small fluctuations, it actually bounds the
{bn} in chaotic local quantum systems. Therefore we conjecture that in chaotic local quantum systems after scrambling time, the speed of linear growth of Krylov complexity cannot be larger than that in RMT. (2) For low temperature, we analytically show that
bn will first exhibit linear growth with
n, whose slope saturates the famous chaos bound. After hitting the same plateau
b,
bn will then remain constant. This indicates
K(t)∼e2πt/β before scrambling time
t∗∼O(βlogβ), and after that it will grow linearly in time, with the same speed as in infinite temperature. We finally remark on the effect of finite
N corrections.
Abstract 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 refined, “microcanonical” version of K-complexity that applies to theories with infinite or continuous spectra (including quantum field theories), and in the holographic theories we study exhibits exponential growth for a scrambling time, followed by linear growth until saturation at a time exponential in the entropy — a behavior that is characteristic of chaos. We show that the linear growth regime implies a universal random matrix description of the operator dynamics after scrambling. Our main tool for establishing this connection is a “complexity renormalization group” framework we develop that allows us to study the effective operator dynamics for different timescales by “integrating out” large K-complexities. In the dual gravity setting, we comment on the empirical match between our version of K-complexity and the maximal volume proposal, and speculate on a connection between the universal random matrix theory dynamics of operator growth after scrambling and the spatial translation symmetry of smooth black hole interiors.
Operator scrambling is a crucial ingredient of quantum chaos. Specifically, in the quantum chaotic system, a simple operator can become increasingly complicated under unitary time evolution. This can be diagnosed by various measures such as square of the commutator (out-of-time-ordered correlator), operator entanglement entropy etc. In this paper, we discuss operator scrambling in three representative models: a chaotic spin-
1/2 chain with spatially local interactions, a 2-local spin model and the quantum linear map. In the first two examples, although the speeds of scrambling are quite different, a simple Pauli spin operator can eventually approach a "highly entangled" operator with operator entanglement entropy taking a volume law value (close to the Page value). Meanwhile, the spectrum of the operator reduced density matrix develops a universal spectral correlation which can be characterized by the Wishart random matrix ensemble. In the second example, we further connect the 2-local model into a one dimensional chain and briefly discuss the operator scrambling there. In contrast, in the quantum linear map, although the square of commutator can increase exponentially with time, a simple operator does not scramble but performs chaotic motion in the operator basis space determined by the classical linear map. We show that once we modify the quantum linear map such that operator can mix in the operator basis, the operator entanglement entropy can grow and eventually saturate to its Page value, thus making it a truly quantum chaotic model.
A bstract In this paper we study the notion of complexity under time evolution in chaotic quantum systems with holographic duals. Continuing on from our previous work, we turn our attention to the issue of Krylov complexity upon the insertion of a class of single-particle operators in the double-scaled SYK model. Such an operator is described by a matter-chord insertion, which splits the theory into left/right sectors, allowing us, via chord-diagram technology, to compute two different notions of complexity associated to the operator insertion: first a Krylov operator complexity, and second the Krylov complexity of a state obtained by an operator acting on the thermofield double state. We will provide both an analytic proof and detailed numerical evidence, that both Krylov complexities arise from a recursively defined basis of states characterized by a constant total chord number. As a consequence, in all cases we are able to establish that Krylov complexity is given by the expectation value of a length operator acting on the Hilbert space of the theory, expressed in terms of basis states, organized by left and right chord number. We find analytic expressions for the semiclassical limit of K-complexity, and study how the size of the operator encodes the scrambling dynamics upon the matter insertion in Krylov language. We furthermore determine the effective Hamiltonian governing the evolution of K-complexity, showing that evolution on the Krylov chain can equivalently be understood as a particle moving in a Morse potential. A particular type of triple scaling limit allows to access the gravitational sector of the theory, in which the geometrical nature of K-complexity is assured by virtue of being a total chord length, in an analogous fashion to what was found in [1] for the K-complexity of the thermofield double state.
Abstract The concepts of operator size and computational complexity play important roles in the study of quantum chaos and holographic duality because they help characterize the structure of time-evolving Heisenberg operators. It is particularly important to understand how these microscopically defined measures of complexity are related to notions of complexity defined in terms of a dual holographic geometry, such as complexity-volume (CV) duality. Here we study partially entangled thermal states in the Sachdev-Ye-Kitaev (SYK) model and their dual description in terms of operators inserted in the interior of a black hole in Jackiw-Teitelboim (JT) gravity. We compare a microscopic definition of complexity in the SYK model known as K-complexity to calculations using CV duality in JT gravity and find that both quantities show an exponential-to-linear growth behavior. We also calculate the growth of operator size under time evolution and find connections between size and complexity. While the notion of operator size saturates at the scrambling time, our study suggests that complexity, which is well defined in both quantum systems and gravity theories, can serve as a useful measure of operator evolution at both early and late times.