Approximate Unitary $k$-Designs from Shallow, Low-Communication Circuits

Random unitaries are useful in quantum information and related fields, but hard to generate with limited resources. An approximate unitary $k$-design is an ensemble of unitaries with an underlying measure over which the average is close to a Haar random ensemble up to the first $k$ moments. A particularly strong notion of approximation bounds the distance from Haar randomness in relative error. Such relative-error approximate designs are secure against queries by an adaptive adversary trying to distinguish it from a Haar ensemble. We construct relative-error approximate unitary $k$-design ensembles for which communication between subsystems is $O(1)$ in the system size. These constructions use the alternating projection method to analyze overlapping Haar averages, giving a bound on the convergence speed to the full averaging with respect to the $2$-norm. Using von Neumann subalgebra indices to replace system dimension, the 2-norm distance converts to relative error without introducing any additional dimension dependence. We use these constructions as the building blocks of a two-step protocol that achieves a relative-error design in $O \big ( (\log m + \log(1/ε) + k \log k ) k, \text{polylog}(k) \big )$ depth, where $m$ is the number of qudits in the complete system and $ε$ the approximation error. This sublinear depth construction answers a variant of [Harrow and Mehraban 2023, Section 1.5, Open Questions 1 and 7]. Moreover, entanglement generated by the sublinear depth scheme follows area laws on spatial lattices up to corrections logarithmic in the full system size.

💡 Research Summary

The paper addresses the long‑standing problem of generating approximate unitary k‑designs with limited quantum resources. A unitary k‑design is an ensemble of unitaries whose first k moments match those of the Haar measure; exact designs are hard to construct, so approximate versions are widely studied. The authors focus on the strongest notion of approximation—relative (multiplicative) error—because it guarantees security against adaptive adversaries and implies additive (diamond‑norm) guarantees.

The central technical contribution is a family of protocols that require only O(1) quantum communication between subsystems, independent of the total system size m, while still achieving a relative‑error k‑design. The basic building blocks are two protocols:

1. Twirl‑Swap‑Twirl: Two parties A and B each apply a local k‑design, exchange ℓ qudits, and then apply another local k‑design. By choosing ℓ = O(k log k + log 1/ε) the overall operation becomes an ε‑approximate relative‑error k‑design. The communication cost is constant because ℓ does not scale with the subsystem dimensions.

2. Twirl‑Cross‑Twirl: For a multipartite system with subsystems A₁,…,A_P, each party first applies a local k‑design, then a joint k‑design is applied to ℓ qudits drawn from each party. When ℓ satisfies a logarithmic bound in k and P, the resulting channel is again an ε‑relative‑error k‑design. This protocol is the main ingredient for constructing designs on lattices.

Both protocols are analyzed first in the 2→2 norm (tensor‑product expanders, TPEs). The authors use von Neumann’s alternating projection method together with Schur‑Weyl duality to bound the convergence speed of the overlapping Haar twirls. The 2‑norm bounds are then upgraded to relative‑error bounds using a novel technique based on von Neumann subalgebra indices. This conversion normally incurs a factor of the Hilbert‑space dimension, but by restricting to the relevant subalgebra the authors replace the full dimension with an effective one, eliminating any dimension‑dependent penalty.

Building on these primitives, the authors propose a two‑step CrosstwirL protocol for an m‑qudit system arranged on a D‑dimensional lattice. The protocol proceeds in layers: each layer applies overlapping local twirls according to the Twirl‑Cross‑Twirl construction, gradually extending the design across the whole lattice. The depth of the resulting circuit is

 O