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

Annual Symposium on Foundations of Computer Science

Efficient Approximate Unitary Designs from Random Pauli Rotations

Jeongwan Haah, Yunchao Liu, Xinyu Tan

Published Oct 27, 2024• 17 citations
Publisher

Abstract

We construct random walks on simple Lie groups that quickly converge to the Haar measure for all moments up to order$t$. Specifically, a step of the walk on the unitary or orthogonal group of dimension$2^{\mathrm{n}}$is a random Pauli rotation$e^{\mathrm{i}\theta P/2}$. The spectral gap of this random walk is shown to be$\Omega(1/t)$, which coincides with the best previously known bound for a random walk on the permutation group on$\{0,1\}^{\mathrm{n}}$. This implies that the walk gives an$\varepsilon$-approximate unitary t-design in depth$\mathcal{O}(\mathrm{n}t^{2}+t\log\frac{1}{\varepsilon})d$where$d=\mathrm{O}(\log \mathrm{n})$is the circuit depth to implement$e^{\mathrm{i}\theta P/2}$. Our simple proof uses quadratic Casimir operators of Lie algebras.

DOI
10.1109/focs61266.2024.00036

Related papers

Random unitary circuits with constant spectral gap

Tim Baer, Jeongwan Haah

We prove constant lower bounds for the spectral gap of the following random walks on unitary groups $\mathsf{SU}(2^n)$ on $n$ qubits. (i) Random Pauli Rotation: choose an $n$-qubit Pauli operator $P$ and an angle $θ\in [0,2π)$, both uniformly at random, and apply $e^{\mathrm i θP}$. (ii) Brickwork Random Unitary Circuit: choose $n-1$ unitaries $U_{i}$ uniformly at random from $\mathsf{SU}(4)$ (including central phases of the parent group) independently, and apply $U_{2j-1}$ on two qubits $2j-1, 2j$ and then $U_{2j}$ on two qubits $2j, 2j+1$. Importantly, the gap bounds are independent of $n$ and apply for all finite dimensional unitary representations of $\mathsf{SU}(2^n)$ uniformly. Our results immediately imply that the Random Pauli Rotation and Brickwork Random Unitary Circuit converge to approximate unitary $t$-designs after $\mathcal{O}(nt)$ steps. As a consequence, we improve implications for the complexity growth of random unitary circuits as a function of the depth. The existing argument can be applied almost verbatim, but previously the depth had to be $\mathcal{O}(2^{cn})$ for some $c < 1$. Our unconditional constant spectral gap removes this restriction. We prove analogous constant-gap results for orthogonal and Clifford groups; the latter is indispensable for our result on the Brickwork Random Unitary Circuit. The former implies convergence to approximate orthogonal $t$-designs. In this case, the implied mixing time with respect to a constant additive and multiplicative error is optimal (up to an absolute constant factor) for $t=2$.

quant-pharXiv:2607.20919•Jul 24, 2026•8 citations

Spectral gaps and slow modes of Pauli rotations and random quantum circuits

Ziyuan Dong, Xiang Fan

We determine which representation sectors control the slowest convergence of random Pauli rotations and several local random quantum circuits. For $d=2^n$, the continuous Pauli walk has exact all-representation gaps $$Δ_{\mathsf{SU}(d)}=\frac{d-8}{8(d-1)}\quad(n\ge4),\qquad Δ_{\mathsf{PU}(d)}=\frac{d(d-3)}{8(d^2-1)}\quad(n\ge3).$$ The special-unitary gap is attained in $\bigwedge^8\mathbb{C}^d$ and is invisible to balanced moments, while the projective gap is already attained in a balanced fourth-moment representation. We obtain exact discrete and orthogonal Pauli analogues, exact finite-Clifford chain/path gaps, and dimension-independent all-representation Haar brickwork lower bounds; on three qubits every weighted Haar-$\mathsf{SU}(4)$ edge walk reduces to one universal principal-angle constant. For real complete-graph models, the entire ordinary fourth-tensor gap reduces to a quadratic-size occupation operator, is simple for every $n\ge4$, and has an expansion beginning $$Δ_n^{(4)}=\frac{10}{9n}-\frac{88}{105n^2}+O(n^{-3}),$$ with competing branches separated only beyond all algebraic orders. For the two finite real Clifford complete-graph walks, this fourth-tensor mode is the exact all-representation group gap for every $n\ge144$; in the same range it simultaneously governs every ordinary even tensor degree $k\ge4$. Thus different representation scopes can have genuinely different slow modes.

quant-pharXiv:2609.40164•Oct 1, 2026•0 citations

Random quantum circuits are approximate unitary t -designs in depth O(nt5+o(1))

Jonas Haferkamp

The applications of random quantum circuits range from quantum computing and quantum many-body systems to the physics of black holes. Many of these applications are related to the generation of quantum pseudorandomness: Random quantum circuits are known to approximate unitary t -designs. Unitary t -designs are probability distributions that mimic Haar randomness up to t th moments. In a seminal paper, Brandão, Harrow and Horodecki prove that random quantum circuits on qubits in a brickwork architecture of depth O(nt10.5) are approximate unitary t -designs. In this work, we revisit this argument, which lower bounds the spectral gap of moment operators for local random quantum circuits by Ω(n−1t−9.5) . We improve this lower bound to Ω(n−1t−4−o(1)) , where the o(1) term goes to 0 as t→∞ . A direct consequence of this scaling is that random quantum circuits generate approximate unitary t -designs in depth O(nt5+o(1)) . Our techniques involve Gao's quantum union bound and the unreasonable effectiveness of the Clifford group. As an auxiliary result, we prove fast convergence to the Haar measure for random Clifford unitaries interleaved with Haar random single qubit unitaries.

arXiv:2203.16571•Quantum•Sep 8, 2022•117 citations

Efficient Unitary Designs with a System-Size Independent Number of Non-Clifford Gates

Jonas Haferkamp, Felipe Montealegre‐Mora, Markus Heinrich +3 more

Abstract Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full n -qubit group, one often resorts to t -designs. Unitary t -designs mimic the Haar-measure up to t -th moments. It is known that Clifford operations can implement at most 3-designs. In this work, we quantify the non-Clifford resources required to break this barrier. We find that it suffices to inject $$O(t^{4}\log ^{2}(t)\log (1/\varepsilon ))$$ O ( t 4 log 2 ( t ) log ( 1 / ε ) ) many non-Clifford gates into a polynomial-depth random Clifford circuit to obtain an $$\varepsilon $$ ε -approximate t -design. Strikingly, the number of non-Clifford gates required is independent of the system size – asymptotically, the density of non-Clifford gates is allowed to tend to zero. We also derive novel bounds on the convergence time of random Clifford circuits to the t -th moment of the uniform distribution on the Clifford group. Our proofs exploit a recently developed variant of Schur-Weyl duality for the Clifford group, as well as bounds on restricted spectral gaps of averaging operators.

arXiv:2002.09524•Communications in Mathematical Physics•Nov 12, 2022•114 citations

Strong unitary designs in optimal depth and space

Teodor Parella-Dilmé, Júlia Barberà-Rodríguez, Salvatore F. E. Oliviero +1 more

Unitary designs provide finite-moment approximations to Haar-random unitaries, with wide-ranging applications across physics and quantum information, from scrambling and black-hole dynamics to foundational primitives in quantum algorithms. Strong unitary designs capture a more demanding operational notion of approximation, requiring indistinguishability from Haar randomness even for quantum algorithms that may access a unitary not only in the forward direction, but also through its inverse, transpose, and complex conjugate. Motivated by the physical requirement that scrambling arise within the system itself, Schuster, Ma, Lombardi, Brandão, and Huang (arXiv:2509.26310) left open whether strong unitary designs can be generated in logarithmic depth using only the system qubits. For every fixed design order $k$ and measurable-error tolerance, we construct strong approximate unitary $k$-designs in optimal $Θ(\log n)$ all-to-all circuit depth using only the $n$ original system qubits. Our new ingredient is a logarithmic-depth Pauli-mixing bound for the perfect-matching ensemble, whose layers pair the qubits uniformly at random and apply independent random two-qubit gates. This bound controls the mixed forward-reverse two-query case, which we combine with existing design and gluing results to obtain strong unitary designs of arbitrary fixed order.

quant-pharXiv:2608.13491•Aug 14, 2026•5 citations

Efficient unitary designs and pseudorandom unitaries from permutations

Chi-Fang Chen, Adam Bouland, Fernando G. S. L. Brandão +3 more

In this work we give an efficient construction of unitary $k$-designs using $\tilde{O}(k\cdot poly(n))$ quantum gates, as well as an efficient construction of a parallel-secure pseudorandom unitary (PRU). Both results are obtained by giving an efficient quantum algorithm that lifts random permutations over $S(N)$ to random unitaries over $U(N)$ for $N=2^n$. In particular, we show that products of exponentiated sums of $S(N)$ permutations with random phases approximately match the first $2^{Ω(n)}$ moments of the Haar measure. By substituting either $\tilde{O}(k)$-wise independent permutations, or quantum-secure pseudorandom permutations (PRPs) in place of the random permutations, we obtain the above results. The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the polynomial method, which allows us to prove query lower bounds at finite-$N$ by interpolating from the much simpler large-$N$ limit. The key technical step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-$N$ expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension $N$.

arXiv:2404.16751•Apr 25, 2024•38 citations
We construct random walks on simple Lie groups that quickly converge to the Haar measure for all moments up to orderttt. Specifically, a step of the walk on the unitary or orthogonal group of dimension2n2^{\mathrm{n}}2nis a random Pauli rotationeiθP/2e^{\mathrm{i}\theta P/2}eiθP/2. The spectral gap of this random walk is shown to beΩ(1/t)\Omega(1/t)Ω(1/t), which coincides with the best previously known bound for a random walk on the permutation group on{0,1}n\{0,1\}^{\mathrm{n}}{0,1}n. This implies that the walk gives anε\varepsilonε-approximate unitary t-design in depthO(nt2+tlog⁡1ε)d\mathcal{O}(\mathrm{n}t^{2}+t\log\frac{1}{\varepsilon})dO(nt2+tlogε1​)dwhered=O(log⁡n)d=\mathrm{O}(\log \mathrm{n})d=O(logn)is the circuit depth to implementeiθP/2e^{\mathrm{i}\theta P/2}eiθP/2. Our simple proof uses quadratic Casimir operators of Lie algebras.
We prove constant lower bounds for the spectral gap of the following random walks on unitary groups SU(2n)\mathsf{SU}(2^n)SU(2n) on nnn qubits. (i) Random Pauli Rotation: choose an nnn-qubit Pauli operator PPP and an angle θ∈[0,2π)θ\in [0,2π)θ∈[0,2π), both uniformly at random, and apply eiθPe^{\mathrm i θP}eiθP. (ii) Brickwork Random Unitary Circuit: choose n−1n-1n−1 unitaries UiU_{i}Ui​ uniformly at random from SU(4)\mathsf{SU}(4)SU(4) (including central phases of the parent group) independently, and apply U2j−1U_{2j-1}U2j−1​ on two qubits 2j−1,2j2j-1, 2j2j−1,2j and then U2jU_{2j}U2j​ on two qubits 2j,2j+12j, 2j+12j,2j+1. Importantly, the gap bounds are independent of nnn and apply for all finite dimensional unitary representations of SU(2n)\mathsf{SU}(2^n)SU(2n) uniformly. Our results immediately imply that the Random Pauli Rotation and Brickwork Random Unitary Circuit converge to approximate unitary ttt-designs after O(nt)\mathcal{O}(nt)O(nt) steps. As a consequence, we improve implications for the complexity growth of random unitary circuits as a function of the depth. The existing argument can be applied almost verbatim, but previously the depth had to be O(2cn)\mathcal{O}(2^{cn})O(2cn) for some c<1c < 1c<1. Our unconditional constant spectral gap removes this restriction. We prove analogous constant-gap results for orthogonal and Clifford groups; the latter is indispensable for our result on the Brickwork Random Unitary Circuit. The former implies convergence to approximate orthogonal ttt-designs. In this case, the implied mixing time with respect to a constant additive and multiplicative error is optimal (up to an absolute constant factor) for t=2t=2t=2.
We determine which representation sectors control the slowest convergence of random Pauli rotations and several local random quantum circuits. For d=2nd=2^nd=2n, the continuous Pauli walk has exact all-representation gaps ΔSU(d)=d−88(d−1)(n≥4),ΔPU(d)=d(d−3)8(d2−1)(n≥3).Δ_{\mathsf{SU}(d)}=\frac{d-8}{8(d-1)}\quad(n\ge4),\qquad Δ_{\mathsf{PU}(d)}=\frac{d(d-3)}{8(d^2-1)}\quad(n\ge3).ΔSU(d)​=8(d−1)d−8​(n≥4),ΔPU(d)​=8(d2−1)d(d−3)​(n≥3). The special-unitary gap is attained in ⋀8Cd\bigwedge^8\mathbb{C}^d⋀8Cd and is invisible to balanced moments, while the projective gap is already attained in a balanced fourth-moment representation. We obtain exact discrete and orthogonal Pauli analogues, exact finite-Clifford chain/path gaps, and dimension-independent all-representation Haar brickwork lower bounds; on three qubits every weighted Haar-SU(4)\mathsf{SU}(4)SU(4) edge walk reduces to one universal principal-angle constant. For real complete-graph models, the entire ordinary fourth-tensor gap reduces to a quadratic-size occupation operator, is simple for every n≥4n\ge4n≥4, and has an expansion beginning Δn(4)=109n−88105n2+O(n−3),Δ_n^{(4)}=\frac{10}{9n}-\frac{88}{105n^2}+O(n^{-3}),Δn(4)​=9n10​−105n288​+O(n−3), with competing branches separated only beyond all algebraic orders. For the two finite real Clifford complete-graph walks, this fourth-tensor mode is the exact all-representation group gap for every n≥144n\ge144n≥144; in the same range it simultaneously governs every ordinary even tensor degree k≥4k\ge4k≥4. Thus different representation scopes can have genuinely different slow modes.
The applications of random quantum circuits range from quantum computing and quantum many-body systems to the physics of black holes. Many of these applications are related to the generation of quantum pseudorandomness: Random quantum circuits are known to approximate unitary t -designs. Unitary t -designs are probability distributions that mimic Haar randomness up to t th moments. In a seminal paper, Brandão, Harrow and Horodecki prove that random quantum circuits on qubits in a brickwork architecture of depth O(nt10.5) are approximate unitary t -designs. In this work, we revisit this argument, which lower bounds the spectral gap of moment operators for local random quantum circuits by Ω(n−1t−9.5) . We improve this lower bound to Ω(n−1t−4−o(1)) , where the o(1) term goes to 0 as t→∞ . A direct consequence of this scaling is that random quantum circuits generate approximate unitary t -designs in depth O(nt5+o(1)) . Our techniques involve Gao's quantum union bound and the unreasonable effectiveness of the Clifford group. As an auxiliary result, we prove fast convergence to the Haar measure for random Clifford unitaries interleaved with Haar random single qubit unitaries.
Abstract Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full n -qubit group, one often resorts to t -designs. Unitary t -designs mimic the Haar-measure up to t -th moments. It is known that Clifford operations can implement at most 3-designs. In this work, we quantify the non-Clifford resources required to break this barrier. We find that it suffices to inject O(t4log⁡2(t)log⁡(1/ε))O(t^{4}\log ^{2}(t)\log (1/\varepsilon ))O(t4log2(t)log(1/ε)) O ( t 4 log 2 ( t ) log ( 1 / ε ) ) many non-Clifford gates into a polynomial-depth random Clifford circuit to obtain an ε\varepsilon ε ε -approximate t -design. Strikingly, the number of non-Clifford gates required is independent of the system size – asymptotically, the density of non-Clifford gates is allowed to tend to zero. We also derive novel bounds on the convergence time of random Clifford circuits to the t -th moment of the uniform distribution on the Clifford group. Our proofs exploit a recently developed variant of Schur-Weyl duality for the Clifford group, as well as bounds on restricted spectral gaps of averaging operators.
Unitary designs provide finite-moment approximations to Haar-random unitaries, with wide-ranging applications across physics and quantum information, from scrambling and black-hole dynamics to foundational primitives in quantum algorithms. Strong unitary designs capture a more demanding operational notion of approximation, requiring indistinguishability from Haar randomness even for quantum algorithms that may access a unitary not only in the forward direction, but also through its inverse, transpose, and complex conjugate. Motivated by the physical requirement that scrambling arise within the system itself, Schuster, Ma, Lombardi, Brandão, and Huang (arXiv:2509.26310) left open whether strong unitary designs can be generated in logarithmic depth using only the system qubits. For every fixed design order kkk and measurable-error tolerance, we construct strong approximate unitary kkk-designs in optimal Θ(log⁡n)Θ(\log n)Θ(logn) all-to-all circuit depth using only the nnn original system qubits. Our new ingredient is a logarithmic-depth Pauli-mixing bound for the perfect-matching ensemble, whose layers pair the qubits uniformly at random and apply independent random two-qubit gates. This bound controls the mixed forward-reverse two-query case, which we combine with existing design and gluing results to obtain strong unitary designs of arbitrary fixed order.
In this work we give an efficient construction of unitary kkk-designs using O~(k⋅poly(n))\tilde{O}(k\cdot poly(n))O~(k⋅poly(n)) quantum gates, as well as an efficient construction of a parallel-secure pseudorandom unitary (PRU). Both results are obtained by giving an efficient quantum algorithm that lifts random permutations over S(N)S(N)S(N) to random unitaries over U(N)U(N)U(N) for N=2nN=2^nN=2n. In particular, we show that products of exponentiated sums of S(N)S(N)S(N) permutations with random phases approximately match the first 2Ω(n)2^{Ω(n)}2Ω(n) moments of the Haar measure. By substituting either O~(k)\tilde{O}(k)O~(k)-wise independent permutations, or quantum-secure pseudorandom permutations (PRPs) in place of the random permutations, we obtain the above results. The heart of our proof is a conceptual connection between the large dimension (large-NNN) expansion in random matrix theory and the polynomial method, which allows us to prove query lower bounds at finite-NNN by interpolating from the much simpler large-NNN limit. The key technical step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-NNN expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension NNN.