The quantum baker map is a standard model of quantum chaos, but rigorous analysis of how it spreads random perturbations remains difficult. Following the repeated ``baker plus refreshed diagonal perturbation'' architecture of Schack and Caves, we study a tractable strong-noise model based on the Balazs--Voros quantization: at each time step, its unitary propagator is followed by a diagonal unitary whose entries are independent and uniform on the unit circle. The resulting random propagator is a structured random walk on $\U(N)$, $N=2^k$. We quantify how quickly the baker dynamics spreads this basis-local randomness at three levels: ensemble means, two-copy statistics, and the full law of the accumulated propagator. The walk becomes an exact unitary $1$-design at time $k+1$, while its fixed-accuracy $2$-design mixing time is $Θ(\log N)$. Thus the induced state ensembles reproduce Haar means and two-copy statistics on the Ehrenfest scale. The full law mixes much more slowly. A phase-adapted path coupling gives normalized Wasserstein mixing in $O_\varepsilon(N)$ steps, whereas metric-entropy and Haar small-ball estimates give an $Ω_\varepsilon(N/\log N)$ lower bound and asymptotically maximal distance at every $t=o(N/\log N)$. The law remains singular with respect to Haar measure for every $t
The quantum baker map is a standard model of quantum chaos, but rigorous analysis of how it spreads random perturbations remains difficult. Following the repeated ``baker plus refreshed diagonal perturbation'' architecture of Schack and Caves, we study a tractable strong-noise model based on the Balazs--Voros quantization: at each time step, its unitary propagator is followed by a diagonal unitary whose entries are independent and uniform on the unit circle. The resulting random propagator is a structured random walk on \U(N), N=2k. We quantify how quickly the baker dynamics spreads this basis-local randomness at three levels: ensemble means, two-copy statistics, and the full law of the accumulated propagator. The walk becomes an exact unitary 1-design at time k+1, while its fixed-accuracy 2-design mixing time is Θ(logN). Thus the induced state ensembles reproduce Haar means and two-copy statistics on the Ehrenfest scale. The full law mixes much more slowly. A phase-adapted path coupling gives normalized Wasserstein mixing in Oε(N) steps, whereas metric-entropy and Haar small-ball estimates give an Ωε(N/logN) lower bound and asymptotically maximal distance at every t=o(N/logN). The law remains singular with respect to Haar measure for every $t
Kac's walk is a classical local random walk whose action on a single real unit vector in dimension d mixes in total variation in Θ(dlogd) sequential steps~\cite{PS17}. Lu, Qin, Song, Yao, and Zhao introduced a parallel version of Kac's walk that mixes a single quantum state in O(logd) rounds~\cite{LQSY+26}. After discretizing the randomness and replacing it by suitable pseudorandom primitives, this parallel walk gives rise to pseudorandom state scramblers, and was subsequently shown to yield pseudorandom unitaries~\cite{LQSY+25}.
We study what happens when the parallel Kac's walk acts simultaneously on k orthonormal quantum states. We prove that, for any 1≤k<d, after O((k+logd)log(d/ε)) steps, the joint distribution of the k output states is ε-close, in both Wasserstein and total variation distance, to that obtained by applying a common Haar-random unitary to the same inputs. This generalizes the dispersing property of the parallel Kac's walk from a single quantum state to multiple orthonormal quantum states. Equivalently, viewing an ordered collection of k orthonormal states as a point on the complex Stiefel manifold Vd,k={X∈Cd×k:X†X=Ik}, we show that the parallel Kac's walk mixes rapidly on Vd,k, with both Wasserstein and total variation mixing times bounded by O((k+logd)log(d/ε)). This extends the Wasserstein mixing result of Pillai, Smith, and Vaikuntanathan for the standard Kac's walk on real Stiefel manifolds~\cite{PSV26}.
Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. We establish quantitative guarantees for how accurately these designs reproduce the distribution of each output probability. We show that, for every strong ε-approximate unitary k-design on n qubits, the distribution of each output probability is within O(k−1/2(1+k/2n)−1/2+ε) in Kolmogorov distance of the Porter-Thomas distribution, a beta distribution with parameters 1 and 2n−1. This bound is optimal up to constant factors, implying that a substantially better uniform bound requires additional structure. We then show that a mild form of local invariance suffices. We prove that any such design that is invariant under unitary translations acting on a single qubit approximates Porter-Thomas to total variation distance O(k−1/2+ε). Every strong ε-approximate unitary k-design invariant on logk+O(1) qubits achieves error 2−Ω(k)+O(ε) in Kolmogorov distance and 2−Ω(k)+O(εlog(2/ε)) in total variation distance. These results identify the distributional accuracy guaranteed by moment matching and the structure that improves it. As an application, we show that the Shannon entropy of the output distribution of a strong ε-approximate k-design is concentrated around its Haar value n−Θ(1): its mean differs from the Haar mean by O(k−1/4+ε1/2) and its standard deviation is O(2−n/2+k−1/8+ε1/4). Consequently, a trusted device sampling such circuits generates n−O(1) bits of entropy per sample, which makes them useful for random number generation.
According to one of the fundamental axioms of quantum mechanics, unitary operators rule the evolution of any quantum system; it is thus of prominent importance to investigate the corresponding group and discover its properties. Random processes over the unitary group have indeed a wide range of applications in the context of quantum information; in particular, they are involved in the construction of peculiar distributions called unitary designs which mimic the uniform Haar measure by matching its moments and are thus deeply connected to the description of phenomena such as quantum tomography, equilibration, thermalization, encryption and scrambling. Previous approaches have shown that unitary designs are efficiently approximated by random quantum circuits with local unitary operators. Moreover, these circuits are used to characterize the precision of experimental implementations of unitary gates via randomized benchmarking protocols and to rapidly decouple a system from the environment. The main novel contribution of this work is to extend these mixing properties to a continuous-time framework, namely, Brownian motion over the unitary group induced by stochastic local Hamiltonians. In order to achieve these new results, on the one hand we move to a representation theoretic formulation and make use of its tools to establish the gap of local generators linked to the moments of the distribution induced by the diffusion process; from this we then derive an expression for the length of time it takes to ensure convergence toward the moments of the Haar measure. On the other hand we project the stochastic evolution onto a random walk on Pauli matrices and tie this description to the analogous one for random quantum circuits to achieve decoupling in a run time scaling almost linearly with respect to the system size. In addition to providing a unifying framework for random processes over the unitary group, we hence aim at presenting new mathematical results and techniques for quantum information. We furthermore discuss applications to black holes dynamics in the perspective of the information paradox. As an additional novel result not related to Brownian motion, we propose a randomized benchmarking protocol exploiting the symmetry of the gate whose accuracy has to be estimated, in order to overcome current shortcomings afflicting the known schemes. We again rely on representation theory to reduce the computational effort and the amount of employed quantum resources.
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.
We study estimation of the von Neumann entropy of a d-dimensional quantum state from independent outcomes of a fixed rank-one measurement. Let κν∈[1,d+1] denote the normalized trace-zero frame spread; κν=1 for exact complex projective 2-designs. For any fixed rank-one measurement and n≤c2d2/κν, the minimax mean-squared error is at least c1log2{d2/(κνn)}. For bounded frame spread and every fixed 0<a<2, the minimax risk is of order log2d throughout n≲d2−a; hence fixed uniform accuracy requires Ω(d2) observations. Existing tomography bounds give bounded risk from O(d3log3d) observations for finite equal-weight exact designs and the Haar covariant measurement, while the intermediate minimax regime remains open. The results concern a fixed measurement repeated independently across copies; adaptive and collective protocols, and protocols that reuse common randomness across copies, are not covered.
Random quantum circuits yield minimally structured models for chaotic quantum dynamics, which are able to capture, for example, universal properties of entanglement growth.We provide exact results and coarse-grained models for the spreading of operators by quantum circuits made of Haar-random unitaries.We study both 1 þ 1D and higher dimensions and argue that the coarse-grained pictures carry over to operator spreading in generic many-body systems.In 1 þ 1D, we demonstrate that the out-of-time-order correlator (OTOC) satisfies a biased diffusion equation, which gives exact results for the spatial profile of the OTOC and determines the butterfly speed v B .We find that in 1 þ 1D, the "front" of the OTOC broadens diffusively, with a width scaling in time as t 1=2 .We address fluctuations in the OTOC between different realizations of the random circuit, arguing that they are negligible in comparison to the broadening of the front within a realization.Turning to higher dimensions, we show that the averaged OTOC can be understood exactly via a remarkable correspondence with a purely classical droplet growth problem.This implies that the width of the front of the averaged OTOC scales as t 1=3 in 2 þ 1D and as t 0.240 in 3 þ 1D (exponents of the Kardar-Parisi-Zhang universality class).We support our analytic argument with simulations in 2 þ 1D.We point out that, in two or higher spatial dimensions, the shape of the spreading operator at late times is affected by underlying lattice symmetries and, in general, is not spherical.However, when full spatial rotational symmetry is present in 2 þ 1D, our mapping implies an exact asymptotic form for the OTOC, in terms of the Tracy-Widom distribution.For an alternative perspective on the OTOC in 1 þ 1D, we map it to the partition function of an Ising-like statistical mechanics model.As a result of special structure arising from unitarity, this partition function reduces to a random walk calculation which can be performed exactly.We also use this mapping to give exact results for entanglement growth in 1 þ 1D circuits.