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].
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. 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 Renyi) 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 Renyi entanglement entropies averaged over designs of the same order are almost maximal. This links the orders of entropy and design, and therefore suggests Renyi 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 Renyi 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.
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.
The entanglement properties of random quantum states or dynamics are important to the study of a broad spectrum of disciplines of physics, ranging from quantum information to high energy and many-body physics. This Letter investigates the interplay between the degrees of entanglement and randomness in pure states and unitary channels. We reveal strong connections between designs (distributions of states or unitaries that match certain moments of the uniform Haar measure) and generalized entropies (entropic functions that depend on certain powers of the density operator), by showing that Rényi entanglement entropies averaged over designs of the same order are almost maximal. This strengthens the celebrated Page's theorem. Moreover, we find that designs of an order that is logarithmic in the dimension maximize all Rényi entanglement entropies and so are completely random in terms of the entanglement spectrum. Our results relate the behaviors of Rényi entanglement entropies to the complexity of scrambling and quantum chaos in terms of the degree of randomness, and suggest a generalization of the fast scrambling conjecture.
Complexity of dynamics is at the core of quantum many-body chaos and exhibits a hierarchical feature: higher-order complexity implies more chaotic dynamics. Conventional ergodicity in thermalization processes is a manifestation of the lowest-order complexity, which is represented by the eigenstate thermalization hypothesis (ETH) stating that individual energy eigenstates are thermal. Here, we propose a higher-order generalization of the ETH, named the
k-ETH ($k=1,2,\ensuremath{\cdots}$), to quantify higher-order complexity of quantum many-body dynamics at the level of individual energy eigenstates, where the lowest-order ETH (1-ETH) is the conventional ETH. The explicit condition of the
k-ETH is obtained by comparing Hamiltonian dynamics with the Haar random unitary of the
k-fold channel. As a nontrivial contribution of the higher-order ETH, we show that the
k-ETH with $k\ensuremath{\ge}2$ implies a universal behavior of the
kth R\'enyi entanglement entropy of individual energy eigenstates. In particular, the Page correction of the entanglement entropy originates from the higher-order ETH, while, as is well known, the volume law can be accounted for by the 1-ETH. We numerically verify that the 2-ETH approximately holds for a nonintegrable system, but does not hold in the integrable case. To further investigate the information-theoretic feature behind the
k-ETH, we introduce a concept named a partial unitary
k-design (PU
k-design), which is an approximation of the Haar random unitary up to the
kth moment, where ``partial'' means that only a limited number of observables are accessible. The
k-ETH is a special case of a PU
k-design for the ensemble of Hamiltonian dynamics with random-time sampling. In addition, we discuss the relationship between the higher-order ETH and information scrambling quantified by out-of-time-ordered correlators. Our framework provides a unified view on thermalization, entanglement entropy, and unitary
k-designs, leading to deeper characterization of higher-order quantum complexity.
This work develops tools to understand how quantum information spreads, scrambles, and is reshaped by measurements in many-body systems. First, I study scrambling and pseudorandomness in the Brownian Sachdev-Ye-Kitaev (SYK) model, quantifying pseudorandomness using unitary k-designs and frame potentials. Using Keldysh path integrals with replicas and disorder averaging, I obtain analytic control of the approach to randomness, identify collective modes that delay convergence to Haar-like behavior, and estimate design times as functions of model parameters, clarifying links between scrambling, complexity growth, and random-circuit phenomenology. Second, I construct a field theory for weakly measured SYK clusters. Starting from a system-ancilla description and a continuum monitoring limit, and using fermionic coherent states with replicas and disorder averaging, I derive a nonlinear sigma model that captures measurement back-action and the competition between interaction-induced scrambling and information extraction, predicting characteristic crossover scales and response signatures that distinguish weak monitoring from fully unitary evolution. Third, I develop a strong-disorder renormalization group for measurement-only SYK clusters, based on the SO(2n) replica algebra and Dasgupta-Ma decimation rules. The flow shows features reminiscent of infinite-randomness behavior, but an order-of-limits subtlety renders the leading recursions non-robust, so the analytic evidence for an infinite-randomness fixed point is inconclusive, even though the average second Renyi entropy displays logarithmic scaling. Together, these results provide a unified language to diagnose when many-body dynamics generate operational randomness and how measurements redirect that flow.
We study quantum information scrambling in spin models with both long-range all-to-all and short-range interactions. We argue that a simple global, spatially homogeneous interaction together with local chaotic dynamics is sufficient to give rise to fast scrambling, which describes the spread of quantum information over the entire system in a time that is logarithmic in the system size. This is illustrated in two tractable models: (1) a random circuit with Haar random local unitaries and a global interaction and (2) a classical model of globally coupled nonlinear oscillators. We use exact numerics to provide further evidence by studying the time evolution of an out-of-time-order correlator and entanglement entropy in spin chains of intermediate sizes. Our results pave the way towards experimental investigations of fast scrambling and aspects of quantum gravity with quantum simulators.