The Clifford group fails gracefully to be a unitary 4-design

Abstract

A unitary t-design is a set of unitaries that is "evenly distributed" in the sense that the average of any t-th order polynomial over the design equals the average over the entire unitary group. In various fields -- e.g. quantum information theory -- one frequently encounters constructions that rely on matrices drawn uniformly at random from the unitary group. Often, it suffices to sample these matrices from a unitary t-design, for sufficiently high t. This results in more explicit, derandomized constructions. The most prominent unitary t-design considered in quantum information is the multi-qubit Clifford group. It is known to be a unitary 3-design, but, unfortunately, not a 4-design. Here, we give a simple, explicit characterization of the way in which the Clifford group fails to constitute a 4-design. Our results show that for various applications in quantum information theory and in the theory of convex signal recovery, Clifford orbits perform almost as well as those of true 4-designs. Technically, it turns out that in a precise sense, the 4th tensor power of the Clifford group affords only one more invariant subspace than the 4th tensor power of the unitary group. That additional subspace is a stabilizer code -- a structure extensively studied in the field of quantum error correction codes. The action of the Clifford group on this stabilizer code can be decomposed explicitly into previously known irreps of the discrete symplectic group. We give various constructions of exact complex projective 4-designs or approximate 4-designs of arbitrarily high precision from Clifford orbits. Building on results from coding theory, we give strong evidence suggesting that these orbits actually constitute complex projective 5-designs.

49 pages, many representations. Not. A. Single. Figure. See also related work by Helsen, Wallman, and Wehner

References in corpus (8)

• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Evenly distributed unitaries: on the structure of unitary designs
• The mother of all protocols: Restructuring quantum information's family tree
• Optimizing quantum process tomography with unitary 2-designs
• Unitary designs and codes
• Quantum state estimation with informationally overcomplete measurements
• Sharply covariant mutually unbiased bases

Cited by in corpus (18)

• Stabilizer Rényi entropy
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Random Matrix Theory of the Isospectral twirling
• Analysing quantum systems with randomised measurements
• Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries
• Performance analysis of multi-shot shadow estimation
• Exact solution of long-range stabilizer Rényi entropy in the dual-unitary XXZ model
• Characterizing correlation within multipartite quantum systems via local randomized measurements
• Entanglement and Stabilizer entropies of random bipartite pure quantum states
• Entanglement of random hypergraph states
• Low rank matrix recovery from Clifford orbits
• Efficient unitary designs and pseudorandom unitaries from permutations
• Efficient Unitary T-designs from Random Sums
• Estimating Gibbs partition function with quantumClifford sampling
• Charge-conserving unitaries typically generate optimal covariant quantum error-correcting codes
• On character table of Clifford groups
• Sampling and the complexity of nature
• Quantum Private Broadcasting