We consider the problem of measuring the spread of quantum states and justify the use of the Krylov basis to measure the spread of quantum states as a Hamiltonian system evolves, resulting in a measure of "spread complexity" akin to Krylov operator complexity but applied to states. In this basis, Hamiltonians become tridiagonal. The time-evolved thermofield double states in chaotic systems shows four regimes of this spread complexity: a linear ramp up to a peak that is exponential in the entropy, followed by a slope down to a plateau. We then derive analytical approximations for the mean of the tridiagonal matrix coefficients from the density of states in an general quantum system, as well as for both the mean and covariance for random matrices with a single-trace potential. Other quantities in the long time limit are shown to be computable as well. This is then applied in two ways: We show in examples that the covariance of the tridiagonal coefficients distinguish integrable and chaotic systems. Essentially, we provide a new set of tools capable of probing the detailed spectral statistics of quantum systems. We also find an application of the mean to infer the late time behavior of double scaled SYK. Lastly, as a somewhat separate topic, we shine a spotlight on the differences between the properties of eigenbasis chaos (e.g. the Eignestate Themalization Hypothesis) and spectral chaos (e.g. the eigenvalue repulsion found in chaotic systems). We show that without any constraints on the system or with a exponentially small tolerance in the constraints, these two properties are unrelated. We then provide a numerically-constructed example that shows that even with exact k-locality it may be possible to construct systems where the two properties do not agree. This suggests that careful considerations of typicality, restrictions, and/or the order of limits, may be needed to fully connect eigenbasis and spectral chaos.
We consider the problem of measuring the spread of quantum states and justify the use of the Krylov basis to measure the spread of quantum states as a Hamiltonian system evolves, resulting in a measure of "spread complexity" akin to Krylov operator complexity but applied to states. In this basis, Hamiltonians become tridiagonal. The time-evolved thermofield double states in chaotic systems shows four regimes of this spread complexity: a linear ramp up to a peak that is exponential in the entropy, followed by a slope down to a plateau. We then derive analytical approximations for the mean of the tridiagonal matrix coefficients from the density of states in an general quantum system, as well as for both the mean and covariance for random matrices with a single-trace potential. Other quantities in the long time limit are shown to be computable as well. This is then applied in two ways: We show in examples that the covariance of the tridiagonal coefficients distinguish integrable and chaotic systems. Essentially, we provide a new set of tools capable of probing the detailed spectral statistics of quantum systems. We also find an application of the mean to infer the late time behavior of double scaled SYK. Lastly, as a somewhat separate topic, we shine a spotlight on the differences between the properties of eigenbasis chaos (e.g. the Eignestate Themalization Hypothesis) and spectral chaos (e.g. the eigenvalue repulsion found in chaotic systems). We show that without any constraints on the system or with a exponentially small tolerance in the constraints, these two properties are unrelated. We then provide a numerically-constructed example that shows that even with exact k-locality it may be possible to construct systems where the two properties do not agree. This suggests that careful considerations of typicality, restrictions, and/or the order of limits, may be needed to fully connect eigenbasis and spectral chaos.
A bstract In quantum many-body systems, time-evolved states typically remain confined to a smaller region of the Hilbert space known as the Krylov subspace . The time evolution can be mapped onto a one-dimensional problem of a particle moving on a chain, where the average position 〈 n 〉 defines Krylov state complexity or spread complexity. Generalized spread complexities, associated with higher-order moments 〈 n p 〉 for p > 1, provide finer insights into the dynamics. We investigate the time evolution of generalized spread complexities following a quantum quench in random matrix theory. The quench is implemented by transitioning from an initial random Hamiltonian to a post-quench Hamiltonian obtained by dividing it into four blocks and flipping the sign of the off-diagonal blocks. This setup captures universal features of chaotic quantum quenches. When the initial state is the thermofield double state of the post-quench Hamiltonian, a peak in spread complexity preceding equilibration signals level repulsion, a hallmark of quantum chaos. We examine the robustness of this peak for other initial states, such as the ground state or the thermofield double state of the pre-quench Hamiltonian. To quantify this behavior, we introduce a measure based on the peak height relative to the late-time saturation value. In the continuous limit, higher-order complexities show increased sensitivity to the peak, supported by numerical simulations for finite-size random matrices.
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 chaotic systems display a Lanczos spectrum whose local means and covariances are well described by RMT. To support this proposal, we first demonstrate its validity in examples of chaotic and integrable systems. We then show that for Haar-random initial states in RMTs the mean and covariance of the Lanczos spectrum suffice to produce the full long-time behavior of general survival probabilities including the spectral form factor, as well as the spread complexity. In addition, for initial states with continuous overlap with energy eigenstates, we analytically find the long-time averages of the probabilities of Krylov basis elements in terms of the mean Lanczos spectrum. This analysis suggests a notion of eigenstate complexity, the statistics of which differentiate integrable systems and classes of quantum chaos. Finally, we clarify the relation between spread complexity and the universality classes of RMT by exploring various values of the Dyson index and Poisson distributed spectra.
A bstract Recently, the concept of spread complexity, Krylov complexity for states, has been introduced as a measure of the complexity and chaoticity of quantum systems. In this paper, we study the spread complexity of the thermofield double state within integrable systems that exhibit saddle-dominated scrambling. Specifically, we focus on the Lipkin-Meshkov-Glick model and the inverted harmonic oscillator as representative examples of quantum mechanical systems featuring saddle-dominated scrambling. Applying the Lanczos algorithm, our numerical investigation reveals that the spread complexity in these systems exhibits features reminiscent of chaotic systems, displaying a distinctive ramp-peak-slope-plateau pattern. Our results indicate that, although spread complexity serves as a valuable probe, accurately diagnosing true quantum chaos generally necessitates additional physical input. We also explore the relationship between spread complexity, the spectral form factor, and the transition probability within the Krylov space. We provide analytical confirmation of our numerical results, validating the Ehrenfest theorem of complexity and identifying a distinct quadratic behavior in the early-time regime of spread complexity.
Spread complexity has emerged as a useful probe of quantum chaos, yet the microscopic spectral origin of its characteristic finite-time peak remains incompletely understood. We develop an analytic framework that relates spread complexity directly to local spectral statistics. Starting from an energy-space representation of the Krylov kernel, we show that the kernel is approximately banded, leading to a rapidly convergent diagonal expansion dominated by nearby levels in the ordered spectrum. Motivated by this structure, we propose an approximate kernel-universality hypothesis: after unfolding, the Krylov kernel is well approximated by that of a uniform lattice. Combining this universal kernel with local spectral statistics yields a simple analytic expression for spread complexity in terms of the Fourier transforms of the k-th nearest-neighbour spacing distributions. In particular, at leading order, the finite-time peak is controlled by the Fourier transform of the nearest-neighbour spacing distribution. The resulting framework describes both chaotic random-matrix ensembles and the integrable Poisson limit, identifies the spectral origin of the complexity peak and its late-time behaviour, and provides a direct connection between Krylov dynamics and spectral statistics.
A bstract We explore spread and spectral complexity in quantum systems that exhibit a transition from integrability to chaos, namely the mixed-field Ising model and the next-to-nearest-neighbor deformation of the Heisenberg XXZ spin chain. We corroborate the observation that the presence of a peak in spread complexity before its saturation, is a characteristic feature in chaotic systems. We find that, in general, the saturation value of spread complexity post-peak depends not only on the spectral statistics of the Hamiltonian, but also on the specific state. However, there appears to be a maximal universal bound determined by the symmetries and dimension of the Hamiltonian, which is realized by the thermofield double state (TFD) at infinite temperature. We also find that the time scales at which the spread complexity and spectral form factor change their behaviour agree with each other and are independent of the chaotic properties of the systems. In the case of spectral complexity, we identify that the key factor determining its saturation value and timescale in chaotic systems is given by minimum energy difference in the theory’s spectrum. This explains observations made in the literature regarding its earlier saturation in chaotic systems compared to their integrable counterparts. We conclude by discussing the properties of the TFD which, we conjecture, make it suitable for probing signatures of chaos in quantum many-body systems.
Abstract Krylov complexity measures the spread of the wavefunction in the Krylov basis, which is constructed using the Hamiltonian and an initial state. We investigate the evolution of the maximally entangled state in the Krylov basis for both chaotic and non-chaotic systems. For this purpose, we derive an Ehrenfest theorem for the Krylov complexity, which reveals its close relation to the spectrum. Our findings suggest that neither the linear growth nor the saturation of Krylov complexity is necessarily associated with chaos. However, for chaotic systems, we observe a universal rise-slope-ramp-plateau behavior in the transition probability from the initial state to one of the Krylov basis states. Moreover, a long ramp in the transition probability is a signal for spectral rigidity, characterizing quantum chaos. Also, this ramp is directly responsible for the late-time peak of Krylov complexity observed in the literature. On the other hand, for non-chaotic systems, this long ramp is absent. Therefore, our results help to clarify which features of the wave function time evolution in Krylov space characterize chaos. We exemplify this by considering the Sachdev-Ye-Kitaev model with two-body or four-body interactions.