Approximate 3-designs and partial decomposition of the Clifford group representation using transvections

Abstract

We study a scheme to implement an asymptotic unitary 3-design. The scheme implements a random Pauli once followed by the implementation of a random transvection Clifford by using state twirling. Thus the scheme is implemented in the form of a quantum channel. We show that when this scheme is implemented k times, then, in the k → ∞ limit, the overall scheme implements a unitary 3-design. This is proved by studying the eigendecomposition of the scheme: the +1 eigenspace of the scheme coincides with that of an exact unitary 3-design, and the remaining eigenvalues are bounded by a constant. Using this we prove that the scheme has to be implemented approximately O(m + log 1/ǫ) times to obtain an ǫ-approximate unitary 3-design, where m is the number of qubits, and ǫ is the diamond-norm distance of the exact unitary 3-design. Also, the scheme implements an asymptotic unitary 2-design with the following convergence rate: it has to be 1 sampled O(log 1/ǫ) times to be an ǫ-approximate unitary 2-design. Since transvection Cliffords are a conjugacy class of the Clifford group, the eigenspaces of the scheme's quantum channel coincide with the irreducible invariant subspaces of the adjoint representation of the Clifford group. Some of the subrepresentations we obtain are the same as were obtained in [36], whereas the remaining are new invariant subspaces. Thus we obtain a partial decomposition of the adjoint representation for 3 copies for the Clifford group. Thus, aside from providing a scheme for the implementation of unitary 3-design, this work is of interest for studying representation theory of the Clifford group, and the potential applications of this topic. The paper ends with open questions regarding the scheme and representation theory of the Clifford group.