Unitary 𝑡-designs are distributions on the unitary group whose first 𝑡 moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate 𝑡-designs. Here we show that these bounds can be extended to any fixed architecture of Haar-random two-site gates. This is accomplished by relating the spectral gaps of such architectures to those of one-dimensional brickwork architectures. Our bound depends on the details of the architecture only via the typical number of layers needed for a block of the circuit to form a connected graph over the sites. When this quantity is bounded, the circuit forms an approximate 𝑡-design in at most linear depth. We give numerical evidence for a stronger bound that depends only on the number of connected blocks into which the architecture can be divided. We also give an implicit bound for nondeterministic architectures in terms of properties of the corresponding distribution over fixed architectures.
A fundamental question is understanding the rate at which random quantum circuits converge to the Haar measure. One quantity which is important in establishing this rate is the spectral gap of a random quantum ensemble. In this work we establish a new bound on the spectral gap of the t-th moment of a one-dimensional brickwork architecture on N qudits. This bound is independent of both t and N, provided t does not exceed the qudit dimension q. We also show that the bound is nearly optimal. The improved spectral gaps gives large improvements to the constant factors in known results on the approximate t-design depths of the 1D brickwork, of generic circuit architectures, and of specially-constructed architectures which scramble in depth O(log N). We moreover show that the spectral gap gives the dominant epsilon-dependence of the t-design depth at small epsilon. Our spectral gap bound is obtained by bounding the N-site 1D brickwork architecture by the spectra of 3-site operators. We then exploit a block-triangular hierarchy and a global symmetry in these operators in order to efficiently bound them. The technical methods used are a qualitatively different approach for bounding spectral gaps and and have little in common with previous techniques.
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.
Approximate unitary k-designs are ensembles of unitary matrices whose first k statistical moments approximate the Haar (uniform) measure. Shallow, random quantum circuits with temporally and spatially structured architectures are known to yield approximate k-designs in depth that is logarithmic in the number of qubits. It was open whether this structure is physically necessary. Shown here is shallow relative entropy convergence for standard notions of less structured, time-periodic circuits, implying additive-error approximate k-designs in nearly logarithmic depth (up to sub-logarithmic factors). These architectures include 1-dimensional brickwork and gates placed randomly according to a connected, bounded-degree graph. Relative entropy recombination methods derived herein are potentially of independent interest.
We prove constant lower bounds for the spectral gap of the following random walks on unitary groups
SU(2n) on
n qubits. (i) Random Pauli Rotation: choose an
n-qubit Pauli operator
P and an angle
θ∈[0,2π), both uniformly at random, and apply
eiθP. (ii) Brickwork Random Unitary Circuit: choose
n−1 unitaries
Ui uniformly at random from
SU(4) (including central phases of the parent group) independently, and apply
U2j−1 on two qubits
2j−1,2j and then
U2j on two qubits
2j,2j+1. Importantly, the gap bounds are independent of
n and apply for all finite dimensional unitary representations of
SU(2n) uniformly.
Our results immediately imply that the Random Pauli Rotation and Brickwork Random Unitary Circuit converge to approximate unitary
t-designs after
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) 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.
We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed
2-qudit interactions. Prior work has established that such
n-qudit circuits with local dimension
q on 1D, complete, and
D-dimensional graphs form approximate unitary designs, that is, they generate unitaries from distributions close to the Haar measure on the unitary group
U(qn) after polynomially many gates. Here, we extend those results by proving that RQCs comprised of
O(poly(n,k)) gates on a wide class of graphs form approximate unitary
k-designs. We prove that RQCs on graphs with spanning trees of bounded degree and height form
k-designs after
O(∣E∣npoly(k)) gates, where
∣E∣ is the number of edges in the graph. Furthermore, we identify larger classes of graphs for which RQCs generate approximate designs in polynomial circuit size. For
k≤4, we show that RQCs on graphs of certain maximum degrees form designs after
O(∣E∣n) gates, providing explicit constants. We determine our circuit size bounds from the spectral gaps of local Hamiltonians. To that end, we extend the finite-size (or Knabe) method for bounding gaps of frustration-free Hamiltonians on regular graphs to arbitrary connected graphs. We further introduce a new method based on the Detectability Lemma for determining the spectral gaps of Hamiltonians on arbitrary graphs. Our methods have wider applicability as the first method provides a succinct alternative proof of [Commun. Math. Phys. 291, 257 (2009)] and the second method proves that RQCs on any connected architecture form approximate designs in quasi-polynomial circuit size.