Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2501.04091 · Physical review. B./Physical review. B

Operator spreading in random unitary circuits with unitary-invariant gate distributions

Zhiyang Tan, Piet W. Brouwer

Published May 1, 2025• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevb.111.184301

Related papers

Operator spreading in random unitary circuits with orthogonal/symplectic-invariant gate distributions

Zhiyang Tan, Piet W. Brouwer

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.

quant-pharXiv:2606.03956•Physical review. B./Physical review. B•Jun 3, 2026•2 citations

Operator Spreading in Random Unitary Circuits

Adam Nahum, Sagar Vijay, Jeongwan Haah

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.

arXiv:1705.08975•Physical Review X•Apr 11, 2018•871 citations

Operator growth in random quantum circuits with symmetry

Nicholas Hunter-Jones

We study random quantum circuits with symmetry, where the local 2-site unitaries are drawn from a quotient or subgroup of the full unitary group $U(d)$. Random quantum circuits are minimal models of local quantum chaotic dynamics and can be used to study operator growth and the emergence of diffusive hydrodynamics. We derive the transition probabilities for the stochastic process governing the growth of operators in four classes of symmetric random circuits. We then compute the butterfly velocities and diffusion constants for a spreading operator by solving a simple random walk in each class of circuits.

arXiv:1812.08219•Dec 19, 2018•45 citations

Diffusive Operator Spreading for Random Unitary Free Fermion Circuits

Beatriz Dias, Masudul Haque, Pedro Ribeiro +1 more

We study a model of free fermions on a chain with dynamics generated by random unitary gates acting on nearest neighbor bonds and present an exact calculation of time-ordered and out-of-time-ordered correlators. We consider three distinct cases: the random circuit with spatio-temporal disorder (i) with and (ii) without particle number conservation and (iii) the particle non-conserving case with purely temporal disorder. In all three cases, temporal disorder causes diffusive operator spreading and $\sim\sqrt{t}$ entanglement growth. This is in sharp contrast to Anderson localization for the case of static disorder and with the ballistic behavior observed in both the clean case of Hamiltonian evolution and in fully random unitary quantum circuits.

arXiv:2102.09846•Feb 19, 2021•22 citations

Random-Matrix Models of Monitored Quantum Circuits

Vir B. Bulchandani, Shivaji L. Sondhi, J. T. Chalker

Abstract We study the competition between Haar-random unitary dynamics and measurements for unstructured systems of qubits. For projective measurements, we derive various properties of the statistical ensemble of Kraus operators analytically, including the purification time and the distribution of Born probabilities. The latter generalizes the Porter–Thomas distribution for random unitary circuits to the monitored setting and is log-normal at long times. We also consider weak measurements that interpolate between identity quantum channels and projective measurements. In this setting, we derive an exactly solvable Fokker–Planck equation for the joint distribution of singular values of Kraus operators, analogous to the Dorokhov–Mello–Pereyra–Kumar (DMPK) equation modelling disordered quantum wires. We expect that the statistical properties of Kraus operators we have established for these simple systems will serve as a model for the entangling phase of monitored quantum systems more generally.

Journal of Statistical Physics•May 3, 2024•24 citations

Random Processes over the Unitary Group

Emilio Onorati

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.

•Jan 1, 2019•0 citations
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.
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=2q=2q=2, the butterfly velocity can exceed that of the Haar-random ensemble.
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.
We study random quantum circuits with symmetry, where the local 2-site unitaries are drawn from a quotient or subgroup of the full unitary group U(d)U(d)U(d). Random quantum circuits are minimal models of local quantum chaotic dynamics and can be used to study operator growth and the emergence of diffusive hydrodynamics. We derive the transition probabilities for the stochastic process governing the growth of operators in four classes of symmetric random circuits. We then compute the butterfly velocities and diffusion constants for a spreading operator by solving a simple random walk in each class of circuits.
We study a model of free fermions on a chain with dynamics generated by random unitary gates acting on nearest neighbor bonds and present an exact calculation of time-ordered and out-of-time-ordered correlators. We consider three distinct cases: the random circuit with spatio-temporal disorder (i) with and (ii) without particle number conservation and (iii) the particle non-conserving case with purely temporal disorder. In all three cases, temporal disorder causes diffusive operator spreading and ∼t\sim\sqrt{t}∼t​ entanglement growth. This is in sharp contrast to Anderson localization for the case of static disorder and with the ballistic behavior observed in both the clean case of Hamiltonian evolution and in fully random unitary quantum circuits.
Abstract We study the competition between Haar-random unitary dynamics and measurements for unstructured systems of qubits. For projective measurements, we derive various properties of the statistical ensemble of Kraus operators analytically, including the purification time and the distribution of Born probabilities. The latter generalizes the Porter–Thomas distribution for random unitary circuits to the monitored setting and is log-normal at long times. We also consider weak measurements that interpolate between identity quantum channels and projective measurements. In this setting, we derive an exactly solvable Fokker–Planck equation for the joint distribution of singular values of Kraus operators, analogous to the Dorokhov–Mello–Pereyra–Kumar (DMPK) equation modelling disordered quantum wires. We expect that the statistical properties of Kraus operators we have established for these simple systems will serve as a model for the entangling phase of monitored quantum systems more generally.
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.