paper

Efficient approximate unitary designs from random Pauli rotations

arXiv:2402.05239 · doi:10.1007/s00220-025-05480-6

Abstract

We construct random walks on simple Lie groups that quickly converge to the Haar measure for all moments up to order . Specifically, a step of the walk on the unitary or orthognoal group of dimension is a random Pauli rotation . The spectral gap of this random walk is shown to be , which coincides with the best previously known bound for a random walk on the permutation group on . This implies that the walk gives an -approximate unitary -design in depth where is the circuit depth to implement . Our simple proof uses quadratic Casimir operators of Lie algebras.

21 pages, 1 figure

Efficient approximate unitary designs from random Pauli rotations · wovepaper