Pseudo-random operators of the circular ensembles

Abstract

We demonstrate quantum algorithms to implement pseudo-random operators that closely reproduce statistical properties of random matrices from the three universal classes: unitary, symmetric, and symplectic. Modified versions of the algorithms are introduced for the less experimentally challenging quantum cellular automata. For implementing pseudo-random symplectic operators we provide gate sequences for the unitary part of the time-reversal operator.