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:2607.20919

Random unitary circuits with constant spectral gap

Tim Baer, Jeongwan Haah

quant-phmath.PRSubmitted Jul 23, 2026• Announced Jul 24, 2026• 0 citations
v1 · Jul 23, 2026v2 · Sep 29, 2026
arXivHTMLPDF

Abstract

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 \mathbb R / 2π\mathbb Z$, 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)$ independently, and apply $U_{2j-1}$ on two qubits $2j-1, 2j$ and then $U_{2j}$ on two qubits $2j, 2j+1$. Importantly, the spectral gaps are independent of $n$ and apply for all finite dimensional unitary representations of $\mathsf{SU}(2^n)$ uniformly, including those that appear in unitary $t$-designs. We also prove analogous constant gap results for Clifford unitaries, which are indispensable for our result on Brickwork Random Unitary Circuit.

Comments
24 pages. Julia and Mathematica code

Related papers

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

Efficient Approximate Unitary Designs from Random Pauli Rotations

Jeongwan Haah, Yunchao Liu, Xinyu Tan

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.

Annual Symposium on Foundations of Computer Science•Oct 27, 2024•14 citations

Efficient approximate unitary designs from random Pauli rotations

Jeongwan Haah, Yunchao Liu, Xinyu Tan

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 orthognoal group of dimension $2^{\mathsf n}$ is a random Pauli rotation $e^{\mathrm i θP /2}$. The spectral gap of this random walk is shown to be $Ω(1/t)$, which coincides with the best previously known bound for a random walk on the permutation group on $\{0,1\}^{\mathsf n}$. This implies that the walk gives an $\varepsilon$-approximate unitary $t$-design in depth $O(\mathsf n t^2 + t \log 1/\varepsilon)d$ where $d=O(\log \mathsf n)$ is the circuit depth to implement $e^{\mathrm i θP /2}$. Our simple proof uses quadratic Casimir operators of Lie algebras.

arXiv:2402.05239•Feb 7, 2024•1 citation

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•81 citations

Incompressibility and Spectral Gaps of Random Circuits

Chi-Fang Chen, Jeongwan Haah, Jonas Haferkamp +3 more

Random reversible and quantum circuits form random walks on the alternating group Alt(2n) and unitary group SU(2n), respectively, with each random gate as one step of the walk. Existing bounds on the spectral gap for the t-th moment of these random walks have inverse-polynomial dependence in both n and t. We prove that the gap for random reversible circuits is Ω(n−3) for all t≥1, and the gap for random quantum circuits is Ω(n−3) for t ≤ Θ(2n/2).Importantly, these gaps are independent of t in the respective regimes. We can further improve both gaps to n−1/polylog(n, t) for t ≤ 2Θ(n), which is tight up to polylog factors in n and t. Our spectral gap results have a number of consequences:1)Random reversible circuits with $\mathcal{O}\left( {{n^4}t} \right)$ gates form multiplicative-error t-wise independent (even) permutations for all t ≥ 1; for t ≤ Θ(2n/6.1), we show that $\tilde {\mathcal{O}}\left( {{n^2}t} \right)$ gates suffice.2)Random quantum circuits with $\mathcal{O}\left( {{n^4}t} \right)$ gates form multiplicative-error unitary t-designs for t ≤Θ(2n/2); for t ≤ Θ(22n/5), we show that $\tilde {\mathcal{O}}\left( {{n^2}t} \right)$ gates suffice.3)The robust quantum circuit complexity of random quantum circuits grows linearly for an exponentially long time, proving the robust Brown–Susskind conjecture [1], [2]. We also show an analogous result for random reversible circuits.Our spectral gap bounds are proven by reducing random quantum circuits to a more structured walk: a modification of the "PFC ensemble" from [3] together with an expander on the alternating group due to Kassabov [4], for which we give an efficient implementation using reversible circuits. In our reduction, we approximate the structured walk with local random circuits without losing the gap, which uses tools from the study of frustration-free Hamiltonians.

arXiv:2406.07478•Annual Symposium on Foundations of Computer Science•Dec 14, 2025•5 citations

(Almost) quadruply optimal unitary designs in 1D

Guoding Liu, Jonas Helsen

We construct $n$-qubit approximate unitary $k$-designs in 1D systems, achieving circuit depth $O(\log(n/\varepsilon) + k\log k)$ with relative error $\varepsilon$ and requiring $O(nk\log k)$ magic gates. This matches existing lower bounds $Ω(\log(n/\varepsilon) + k)$ for circuit depth, and $\widetildeΩ(nk)$ for the required number of $T$ gates, up to a $\log k$ factor, achieving simultaneous near-optimality in all parameters. Our construction is based on a combination and refinement of two existing results. We reduce the required magic block size for breaking Clifford symmetries in the magic-augmented circuit construction of Zhang et al. from $O(k\log k)$ to $O(\log k)$. We also improve the breakthrough construction of Chen et al. to construct a generating set of 1D local constant-depth circuits for the unitary group with a constant spectral gap, making $O(\log k)$-local random unitaries realizable in depth $O(k\log k)$. As a by-product, we provide a constant-size 1D-local generating set for the Clifford group, which we expect to be of independent interest. Combining the two results with the gluing lemma, we prove the final result.

quant-pharXiv:2608.18650•Aug 20, 2026•0 citations
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 θ∈R/2πZθ\in \mathbb R / 2π\mathbb Zθ∈R/2πZ, 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) 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 spectral gaps are independent of nnn and apply for all finite dimensional unitary representations of SU(2n)\mathsf{SU}(2^n)SU(2n) uniformly, including those that appear in unitary ttt-designs. We also prove analogous constant gap results for Clifford unitaries, which are indispensable for our result on Brickwork Random Unitary Circuit.
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.
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 construct random walks on simple Lie groups that quickly converge to the Haar measure for all moments up to order ttt. Specifically, a step of the walk on the unitary or orthognoal group of dimension 2n2^{\mathsf n}2n is a random Pauli rotation eiθP/2e^{\mathrm i θP /2}eiθP/2. The spectral gap of this random walk is shown to be Ω(1/t)Ω(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\}^{\mathsf n}{0,1}n. This implies that the walk gives an ε\varepsilonε-approximate unitary ttt-design in depth O(nt2+tlog⁡1/ε)dO(\mathsf n t^2 + t \log 1/\varepsilon)dO(nt2+tlog1/ε)d where d=O(log⁡n)d=O(\log \mathsf n)d=O(logn) is the circuit depth to implement eiθP/2e^{\mathrm i θP /2}eiθP/2. Our simple proof uses quadratic Casimir operators of Lie algebras.
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.
Random reversible and quantum circuits form random walks on the alternating group Alt(2n) and unitary group SU(2n), respectively, with each random gate as one step of the walk. Existing bounds on the spectral gap for the t-th moment of these random walks have inverse-polynomial dependence in both n and t. We prove that the gap for random reversible circuits is Ω(n−3) for all t≥1, and the gap for random quantum circuits is Ω(n−3) for t ≤ Θ(2n/2).Importantly, these gaps are independent of t in the respective regimes. We can further improve both gaps to n−1/polylog(n, t) for t ≤ 2Θ(n), which is tight up to polylog factors in n and t. Our spectral gap results have a number of consequences:1)Random reversible circuits with O(n4t)\mathcal{O}\left( {{n^4}t} \right)O(n4t) gates form multiplicative-error t-wise independent (even) permutations for all t ≥ 1; for t ≤ Θ(2n/6.1), we show that O~(n2t)\tilde {\mathcal{O}}\left( {{n^2}t} \right)O~(n2t) gates suffice.2)Random quantum circuits with O(n4t)\mathcal{O}\left( {{n^4}t} \right)O(n4t) gates form multiplicative-error unitary t-designs for t ≤Θ(2n/2); for t ≤ Θ(22n/5), we show that O~(n2t)\tilde {\mathcal{O}}\left( {{n^2}t} \right)O~(n2t) gates suffice.3)The robust quantum circuit complexity of random quantum circuits grows linearly for an exponentially long time, proving the robust Brown–Susskind conjecture [1], [2]. We also show an analogous result for random reversible circuits.Our spectral gap bounds are proven by reducing random quantum circuits to a more structured walk: a modification of the "PFC ensemble" from [3] together with an expander on the alternating group due to Kassabov [4], for which we give an efficient implementation using reversible circuits. In our reduction, we approximate the structured walk with local random circuits without losing the gap, which uses tools from the study of frustration-free Hamiltonians.
We construct nnn-qubit approximate unitary kkk-designs in 1D systems, achieving circuit depth O(log⁡(n/ε)+klog⁡k)O(\log(n/\varepsilon) + k\log k)O(log(n/ε)+klogk) with relative error ε\varepsilonε and requiring O(nklog⁡k)O(nk\log k)O(nklogk) magic gates. This matches existing lower bounds Ω(log⁡(n/ε)+k)Ω(\log(n/\varepsilon) + k)Ω(log(n/ε)+k) for circuit depth, and Ω~(nk)\widetildeΩ(nk)Ω(nk) for the required number of TTT gates, up to a log⁡k\log klogk factor, achieving simultaneous near-optimality in all parameters. Our construction is based on a combination and refinement of two existing results. We reduce the required magic block size for breaking Clifford symmetries in the magic-augmented circuit construction of Zhang et al. from O(klog⁡k)O(k\log k)O(klogk) to O(log⁡k)O(\log k)O(logk). We also improve the breakthrough construction of Chen et al. to construct a generating set of 1D local constant-depth circuits for the unitary group with a constant spectral gap, making O(log⁡k)O(\log k)O(logk)-local random unitaries realizable in depth O(klog⁡k)O(k\log k)O(klogk). As a by-product, we provide a constant-size 1D-local generating set for the Clifford group, which we expect to be of independent interest. Combining the two results with the gluing lemma, we prove the final result.