Hadamard-Free Circuits Expose the Structure of the Clifford Group

Abstract

The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. Here we study the structural properties of this group. We show that any Clifford operator can be uniquely written in the canonical form <inline-formula> <tex-math notation="LaTeX">$F_{1}HSF_{2}$ </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">$H$ </tex-math></inline-formula> is a layer of Hadamard gates, <inline-formula> <tex-math notation="LaTeX">$S$ </tex-math></inline-formula> is a permutation of qubits, and <inline-formula> <tex-math notation="LaTeX">$F_{i}$ </tex-math></inline-formula> are parameterized Hadamard-free circuits chosen from suitable subgroups of the Clifford group. Our canonical form provides a one-to-one correspondence between Clifford operators and layered quantum circuits. We report a polynomial-time algorithm for computing the canonical form. We employ this canonical form to generate a random uniformly distributed <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>-qubit Clifford operator in runtime <inline-formula> <tex-math notation="LaTeX">$O(n^{2})$ </tex-math></inline-formula>. The number of random bits consumed by the algorithm matches the information-theoretic lower bound. A surprising connection is highlighted between random uniform Clifford operators and the Mallows distribution on the symmetric group. The variants of the canonical form, one with a short Hadamard-free part and one allowing a circuit depth <inline-formula> <tex-math notation="LaTeX">$9n$ </tex-math></inline-formula> implementation of arbitrary Clifford unitaries in the Linear Nearest Neighbor architecture are also discussed. Finally, we study computational quantum advantage where a classical reversible linear circuit can be implemented more efficiently using Clifford gates, and show an explicit example where such an advantage takes place.