The Clifford group fails gracefully to be a unitary 4-design
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 10 Pith papers
-
A journey through Flatland: What does the antiflatness of a spectrum teach us?
Introduces antiflatness of entanglement spectra, antiflat majorization based on Rényi entropy spread, and unifies measures via escort distributions while connecting capacity of entanglement to quantum Fisher information.
-
Non-stabilizerness and U(1) symmetry in chaotic many-body quantum systems
Exact results show U(1) symmetry substantially suppresses non-stabilizerness in random states, with different leading scaling from entanglement near zero charge density.
-
Generalized Entanglement of Purification Criteria for 2-Producible States in Multipartite Systems
A multipartite pure state is 2-producible if and only if all generalized entanglement of purification gaps vanish.
-
Demonstrating an unconditional separation between quantum and classical information resources
Demonstrates a task solvable with 12 qubits but requiring 62-382 classical bits of memory, yielding unconditional quantum information supremacy on a trapped-ion processor.
-
Operational interpretation of the Stabilizer Entropy
The stabilizer Rényi entropy governs the exponential rate at which Clifford orbits become indistinguishable from Haar-random states and sets the optimal distinguishability from stabilizer states in property testing.
-
Coherence dynamics in quantum many-body systems with conservation laws
Conservation laws in quantum circuits and Hamiltonians replace logarithmic coherence saturation with slow hydrodynamic relaxation globally and produce algebraic peak-time growth locally, unlike ergodic cases.
-
The Quantum Complexity of String Breaking in the Schwinger Model
Quantum complexity measures applied to the Schwinger model reveal nonlocal correlations along the string and show that entanglement and magic give complementary views of string formation and breaking.
-
Nonstabilizerness and Error Resilience in Noisy Quantum Circuits
Amplitude damping generates nonstabilizerness in qubit systems unlike depolarizing noise, with local injection washed out collectively after encoding, decoding, and postselection.
-
Non-Clifford Cost of Random Unitaries
Rigorous bounds establish that t = Theta(k^2) non-Clifford gates are necessary and sufficient for frame-potential approximation to unitary k-designs while t = Theta(nk) suffices for relative-error k-designs.
-
Taming Trotter Errors with Quantum Resources
Higher entanglement entropy reduces variance of Trotter errors and higher magic reduces kurtosis, making error distributions more robust in quantum simulation.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.