We prove that the time required for sustained information scrambling in any Hamiltonian quantum system is universally at least logarithmic in the entanglement entropy of scrambled states. This addresses two foundational problems in nonequilibrium quantum dynamics. (1) It sets the earliest possible time for the applicability of equilibrium statistical mechanics in a quantum system coupled to a bath at a finite temperature. (2) It proves a version of the fast scrambling conjecture, originally motivated in models associated with black holes, as a fundamental property of quantum mechanics itself. Our result builds on a refinement of the energy-time uncertainty principle in terms of the infinite temperature spectral form factor in quantum chaos. We generalize this formulation to arbitrary initial states of the bath, including finite temperature states, by mapping Hamiltonian dynamics with any initial state to nonunitary dynamics at infinite temperature. A regularized spectral form factor emerges naturally from this procedure, whose decay is universally constrained by analyticity in complex time. This establishes an exact speed limit on information scrambling by the most general quantum mechanical Hamiltonian without any restrictions on locality or the nature of interactions.
We prove that the time required for sustained information scrambling in any Hamiltonian quantum system is universally at least logarithmic in the entanglement entropy of scrambled states. This addresses two foundational problems in nonequilibrium quantum dynamics. (1) It sets the earliest possible time for the applicability of equilibrium statistical mechanics in a quantum system coupled to a bath at a finite temperature. (2) It proves a version of the fast scrambling conjecture, originally motivated in models associated with black holes, as a fundamental property of quantum mechanics itself. Our result builds on a refinement of the energy-time uncertainty principle in terms of the infinite temperature spectral form factor in quantum chaos. We generalize this formulation to arbitrary initial states of the bath, including finite temperature states, by mapping Hamiltonian dynamics with any initial state to nonunitary dynamics at infinite temperature. A regularized spectral form factor emerges naturally from this procedure, whose decay is universally constrained by analyticity in complex time. This establishes an exact speed limit on information scrambling by the most general quantum mechanical Hamiltonian without any restrictions on locality or the nature of interactions.
Quantum speed limits such as the Mandelstam-Tamm or Margolus-Levitin bounds offer a quantitative formulation of the energy-time uncertainty principle that constrains dynamics over short times. We show that the spectral form factor, a central quantity in quantum chaos, sets a universal state-independent bound on the quantum dynamics of a complete set of initial states over arbitrarily long times, which is tighter than the corresponding state-independent bounds set by known speed limits. This bound further generalizes naturally to the real-time dynamics of time-dependent or dissipative systems where no energy spectrum exists. We use this result to constrain the scrambling of information in interacting many-body systems. For Hamiltonian systems, we show that the fundamental question of the fastest possible scrambling time-without any restrictions on the structure of interactions-maps to a purely mathematical property of the density of states involving the non-negativity of Fourier transforms. We illustrate these bounds in the Sachdev-Ye-Kitaev model, where we show that despite its "maximally chaotic" nature, the sustained scrambling of sufficiently large fermion subsystems via entanglement generation requires an exponentially long time in the subsystem size.
Many proposed quantum mechanical models of black holes include highly nonlocal interactions.The time required for thermalization to occur in such models should reflect the relaxation times associated with classical black holes in general relativity.Moreover, the time required for a particularly strong form of thermalization to occur, sometimes known as scrambling, determines the time scale on which black holes should start to release information.It has been conjectured that black holes scramble in a time logarithmic in their entropy, and that no system in nature can scramble faster.In this article, we address the conjecture from two directions.First, we exhibit two examples of systems that do indeed scramble in logarithmic time: Brownian quantum circuits and the antiferromagnetic Ising model on a sparse random graph.Unfortunately, both fail to be truly ideal fast scramblers for reasons we discuss.Second, we use Lieb-Robinson techniques to prove a logarithmic lower bound on the scrambling time of systems with finite norm terms in their Hamiltonian.The bound holds in spite of any nonlocal structure in the Hamiltonian, which might permit every degree of freedom to interact directly with every other one.
Given a quantum many-body system with few-body interactions, how rapidly can quantum information be hidden during time evolution? The fast-scrambling conjecture is that the time to thoroughly mix information among N degrees of freedom grows at least logarithmically in N. We derive this inequality for generic quantum systems at infinite temperature, bounding the scrambling time by a finite decay time of local quantum correlations at late times. Using Lieb-Robinson bounds, generalized Sachdev-Ye-Kitaev models, and random unitary circuits, we propose that a logarithmic scrambling time can be achieved in most quantum systems with sparse connectivity. These models also elucidate how quantum chaos is not universally related to scrambling: We construct random few-body circuits with infinite Lyapunov exponent but logarithmic scrambling time. We discuss analogies between quantum models on graphs and quantum black holes and suggest methods to experimentally study scrambling with as many as 100 sparsely connected quantum degrees of freedom.
Abstract Scrambling is a process by which the state of a quantum system is effectively randomized due to the global entanglement that “hides” initially localized quantum information. Closely related notions include quantum chaos and thermalization. Such phenomena play key roles in the study of quantum gravity, many-body physics, quantum statistical mechanics, quantum information etc. Scrambling can exhibit different complexities depending on the degree of randomness it produces. For example, notice that the complete randomization implies scrambling, but the converse does not hold; in fact, there is a significant complexity gap between them. In this work, we lay the mathematical foundations of studying randomness complexities beyond scrambling by entanglement properties. We do so by analyzing the generalized (in particular Rényi) entanglement entropies of designs, i.e. ensembles of unitary channels or pure states that mimic the uniformly random distribution (given by the Haar measure) up to certain moments. A main collective conclusion is that the Rényi entanglement entropies averaged over designs of the same order are almost maximal. This links the orders of entropy and design, and therefore suggests Rényi entanglement entropies as diagnostics of the randomness complexity of corresponding designs. Such complexities form a hierarchy between information scrambling and Haar randomness. As a strong separation result, we prove the existence of (state) 2-designs such that the Rényi entanglement entropies of higher orders can be bounded away from the maximum. However, we also show that the min entanglement entropy is maximized by designs of order only logarithmic in the dimension of the system. In other words, logarithmic-designs already achieve the complexity of Haar in terms of entanglement, which we also call max-scrambling. This result leads to a generalization of the fast scrambling conjecture, that max-scrambling can be achieved by physical dynamics in time roughly linear in the number of degrees of freedom. This paper is an extended version of Phys. Rev. Lett. 120 (2018) 130502 [1].
Quantum speed limits set an upper bound to the rate at which a quantum system can evolve, and as such can be used to analyze the scrambling of information. To this end, we consider the survival probability of a thermofield double state under unitary time evolution which is related to the analytic continuation of the partition function. We provide an exponential lower bound to the survival probability with a rate governed by the inverse of the energy fluctuations of the initial state. Further, we elucidate universal features of the nonexponential behavior at short and long times of evolution that follow from the analytic properties of the survival probability and its Fourier transform, both for systems with a continuous and for systems with a discrete energy spectrum. We find the spectral form factor in a number of illustrative models; notably, we obtain the exact answer in the Gaussian unitary ensemble for any N with excellent agreement with recent numerical studies. We also discuss the relationship of our findings to models of black hole information loss, such as the Sachdev-Ye-Kitaev model dual to AdS2, as well as higher-dimensional versions of AdS/CFT.
Information scrambling, the process by which quantum information spreads and becomes effectively inaccessible, is central to modern quantum statistical physics and quantum chaos. These lecture notes provide an introduction to information scrambling from both static and dynamical perspectives. The spectral properties of reduced density matrices arising from Haar-random states are developed through the geometry of the unitary group and the universal results of random matrix theory. This geometric framework yields universal, model-independent predictions for entanglement and spectral statistics, capturing generic features of quantum chaos without reference to microscopic details. Dynamical diagnostics such as the spectral form factor and out-of-time-ordered correlators further reveal the onset of chaos in time-dependent evolution.
The notes are aimed at advanced undergraduate and graduate students in physics, mathematics, and computer science who are interested in the connections between quantum chaos, information dynamics, and quantum computing. Concepts such as entanglement growth, Haar randomness, random-matrix statistics, and unitary t-designs are introduced through their realization in random quantum circuits and circuit complexity. The same mathematical framework also underpins modern quantum-device benchmarking, where approximate unitary designs and random circuits translate geometric ideas into quantitative tools for assessing fidelity, noise, and scrambling efficiency in real quantum processors.