We investigate operator spreading in random quantum circuits with gates drawn from orthogonal-invariant or symplectic-invariant ensembles, revealing several key distinctions from the well-studied unitary-invariant case. We find that the ensemble-averaged Pauli-string weights relax to a ternary-valued structure, instead of the binary structure of unitary-invariant circuits. For orthogonal- or symplectic-invariant circuits, the domain wall separating trivial and scrambled regions has a finite width even for Haar-random gates, whereas domain walls are sharp for Haar-distributed random unitary circuits. We further find a fundamental dichotomy between random circuits with two-qubit gates from the two disconnected components of the orthogonal group: While the butterfly velocity for the special orthogonal ensemble lies between zero and the Haar value, the negative-determinant sector exhibits a non-zero lower bound for any gate distribution. Moreover, for qudit size $q=2$, the butterfly velocity can exceed that of the Haar-random ensemble.
Journal reference
Tan, Z., & Brouwer, P. W. (2026). Operator spreading in random unitary circuits with orthogonal/symplectic-invariant gate distributions. Physical Review B, 114(7), 074308
We investigate operator spreading in random quantum circuits with gates drawn from orthogonal-invariant or symplectic-invariant ensembles, revealing several key distinctions from the well-studied unitary-invariant case. We find that the ensemble-averaged Pauli-string weights relax to a ternary-valued structure, instead of the binary structure of unitary-invariant circuits. For orthogonal- or symplectic-invariant circuits, the domain wall separating trivial and scrambled regions has a finite width even for Haar-random gates, whereas domain walls are sharp for Haar-distributed random unitary circuits. We further find a fundamental dichotomy between random circuits with two-qubit gates from the two disconnected components of the orthogonal group: While the butterfly velocity for the special orthogonal ensemble lies between zero and the Haar value, the negative-determinant sector exhibits a non-zero lower bound for any gate distribution. Moreover, for qudit size q=2, the butterfly velocity can exceed that of the Haar-random ensemble.
Random unitary circuits have become a model system to investigate information scrambling in quantum systems. In the literature, mostly random circuits with Haar-distributed gate operations have been considered. In this work, we investigate operator spreading in random unitary circuits in which the elementary gate operations are drawn from general unitary-invariant ensembles, which include the well-studied Haar-distributed random unitary circuits as a special case. Similar to the Haar-distributed case, the long-time behavior of operator spreading with the more general unitary-invariant gate distribution is governed by drift-diffusion equations characterized by the butterfly velocity v B and a diffusion constant D . Differences with the Haar-random case are (i) that it takes a finite time τ b until ensemble-averaged Pauli-string weights take a “binary” form, in which they depend only on whether Pauli operators inside the support of the Pauli strong are equal to the identity matrix, and (ii) that the operator spreading is characterized by a finite “domain-wall width” n DW separating regions with a random-matrix-like Pauli-string distribution. To illustrate these findings, we perform explicit calculations for random unitary circuits distributed according to the Poisson kernel, which interpolates between the trivial and Haar-distributed circuits.
Abstract Parametrized and random unitary (or orthogonal) n -qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as S P ( d / 2 ) —the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators G for the symplectic algebra sp ( d / 2 ) , consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in G cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t -designs over S P ( d / 2 ) . To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.
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.
Abstract Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the behavior of typical states and circuits involves sampling unitary transformations from the Haar measure on the unitary group. In this work, we depart from this standard approach and instead study structured unitaries drawn from other compact connected groups, namely the symplectic and special orthogonal groups. By leveraging the concentration of measure phenomenon, we establish two main results. We show that random quantum states generated using symplectic or orthogonal unitaries typically exhibit an exponentially large strong state complexity, and are nearly orthogonal to one another. Similar behavior is observed for designs over these groups. Additionally, we demonstrate the average-case hardness of learning circuits composed of gates drawn from such classical groups of unitaries. Taken together, our results demonstrate that structured subgroups can exhibit a complexity comparable to that of the full unitary group.
We study the amount of interference in random quantum algorithms using a recently derived quantitative measure of interference. To this end we introduce two random circuit ensembles composed of random sequences of quantum gates from a universal set, mimicking quantum algorithms in the quantum circuit representation. We show numerically that, concerning the interference distribution and the level spacing distribution, these ensembles converge to the well-known circular unitary ensemble (CUE) for general complex quantum algorithms, and to the Haar orthogonal ensemble (HOE) for real quantum algorithms. We provide exact analytical formulas for the average and typical interference in the circular ensembles, and show that for sufficiently large numbers of qubits a random quantum algorithm uses with probability close to one an amount of interference approximately equal to the dimension of the Hilbert space. As a by-product, we offer a new way of constructing approximate random unitary operators from the Haar measures of CUE or HOE in a high dimensional Hilbert space using universal sets of quantum gates.
Random many-body states and matrices are both a useful tool to model certain physical systems and an important asset for quantum computation. Realizing them, however, generally requires an exponential (in system size) amount of resources. Recent research has presented a way out by showing that one can generate random states and matrices, or more precisely a controlled approximation of them, by applying a quantum circuit built in terms of few-body unitary gates. Most of this research has been focussed on the case of quantum circuits composed by fully random unitary gates. Here we consider what happens for circuits that, instead, involve a minimal degree of randomness. Specifically, we concentrate on two different settings: (a) brickwork quantum circuits with a single one-qudit random matrix at a boundary; (b) brickwork quantum circuits with fixed interactions but random one-qudit gates everywhere. We show that, for any given initial state, (a) and (b) produce a distribution of states approaching the Haar distribution in the limit of large circuit depth. More precisely, we show that the moments of the distribution produced by our circuits can approximate the ones of the Haar distribution in a depth proportional to the system size. Interestingly we find that in both Cases (a) and (b) the relaxation to the Haar distribution occurs in two steps—this is in contrast with what happens in fully random circuits. Moreover, we show that choosing appropriately the fixed interactions, for example taking the local gate to be a dual-unitary gate with high enough entangling power, minimally random circuits produce a Haar random distribution more rapidly than fully random circuits. In particular, dual-unitary circuits with maximal entangling power—i.e. perfect tensors—appear to provide the optimal quantum state design preparation for any design number. Our results also suggest that the minimally random settings (a) and (b) give an optimal framework to prepare unitary designs, i.e., random unitary matrices.