Multiqubit Clifford groups are unitary 3-designs

Abstract

Unitary $t$-designs are a ubiquitous tool in many research areas, including randomized benchmarking, quantum process tomography, and scrambling. Despite the intensive efforts of many researchers, little is known about unitary $t$-designs with $t\ge 3$ in the literature. We show that the multiqubit Clifford group in any even prime-power dimension is not only a unitary 2-design, but also a 3-design. Moreover, it is a minimal 3-design except for dimension~4. As an immediate consequence, any orbit of pure states of the multiqubit Clifford group forms a complex projective 3-design; in particular, the set of stabilizer states forms a 3-design. In addition, our study is helpful to studying higher moments of the Clifford group, which are useful in many research areas ranging from quantum information science to signal processing. Furthermore, we reveal a surprising connection between unitary 3-designs and the physics of discrete phase spaces and thereby offer a simple explanation of why no discrete Wigner function is covariant with respect to the multiqubit Clifford group, which is of intrinsic interest to studying quantum computation.

7 pages, published in Phys. Rev. A

References in corpus (20)

• Black holes as mirrors: quantum information in random subsystems
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Chaos in quantum channels
• Chaos and complexity by design
• Evenly distributed unitaries: on the structure of unitary designs
• Tight informationally complete quantum measurements
• Wigner function negativity and contextuality in quantum computation on rebits
• Optimizing quantum process tomography with unitary 2-designs
• Unitary designs and codes
• Efficient unitary designs with nearly time-independent Hamiltonian dynamics
• Multipartite Entanglement in Stabilizer Tensor Networks
• The Clifford group fails gracefully to be a unitary 4-design
• Efficient Quantum Pseudorandomness
• Properties of the extended Clifford group with applications to SIC-POVMs and MUBs
• Spectra of phase point operators in odd prime dimensions and the extended Clifford group
• Mutually unbiased bases as minimal Clifford covariant 2-designs
• Low rank matrix recovery from Clifford orbits
• Distinguishing quantum states using Clifford orbits
• Sharply covariant mutually unbiased bases

Cited by in corpus (133)

• Random Quantum Circuits
• Chaos and complexity by design
• Security in Quantum Cryptography
• Linear growth of quantum circuit complexity
• Robust shadow estimation
• Theory of quantum system certification: a tutorial
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• A general framework for randomized benchmarking
• Avoiding barren plateaus using classical shadows
• Pseudorandom States, Non-Cloning Theorems and Quantum Money
• Robust Dynamic Hamiltonian Engineering of Many-Body Spin Systems
• Models of quantum complexity growth
• Contextuality and Wigner function negativity in qubit quantum computation
• Robustness of Magic and Symmetries of the Stabiliser Polytope
• Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
• Classical Shadows With Noise
• Hadamard-free circuits expose the structure of the Clifford group
• Single-copies estimation of entanglement negativity
• Measurement-induced phase transitions in $(d+1)$-dimensional stabilizer circuits
• Quantum Chaos is Quantum
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• Matchgate Shadows for Fermionic Quantum Simulation
• Experimental single-setting quantum state tomography
• Fast quantum circuit cutting with randomized measurements
• Multipartite Entanglement in Stabilizer Tensor Networks
• Scrambling and Complexity in Phase Space
• Correlation measures and the entanglement wedge cross-section after quantum quenches in two-dimensional conformal field theories
• Measuring nonstabilizerness via multifractal flatness
• Many-body quantum teleportation via operator spreading in the traversable wormhole protocol
• Unitary designs from statistical mechanics in random quantum circuits
• Recovering quantum gates from few average gate fidelities
• Shallow shadows: Expectation estimation using low-depth random Clifford circuits
• Scrambling Transition in a Radiative Random Unitary Circuit
• Universal cost bound of quantum error mitigation based on quantum estimation theory
• Entanglement, quantum randomness, and complexity beyond scrambling
• Real Randomized Benchmarking
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Hamiltonian simulation with random inputs
• Probing post-measurement entanglement without post-selection
• Multi-qubit Randomized Benchmarking Using Few Samples
• Transitions in entanglement complexity in random quantum circuits by measurements
• Detecting entanglement in quantum many-body systems via permutation moments
• Mitigating Barren Plateaus with Transfer-learning-inspired Parameter Initializations
• A Bayesian analysis of classical shadows
• Quantum authentication with key recycling
• Random Matrix Theory of the Isospectral twirling
• Spectral decoupling in many-body quantum chaos
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Informational power of the Hoggar SIC-POVM
• Crystalline Quantum Circuits
• Estimating gate-set properties from random sequences
• Retrieving information from a black hole using quantum machine learning
• Phase transition in Stabilizer Entropy and efficient purity estimation
• Closed-form analytic expressions for shadow estimation with brickwork circuits
• Efficient quantum pseudorandomness with simple graph states
• Markovianization with approximate unitary designs
• Realizing topologically ordered states on a quantum processor
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Schrödinger-Heisenberg Variational Quantum Algorithms
• Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates
• Improved Stabilizer Estimation via Bell Difference Sampling
• Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
• Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
• Randomized benchmarking in measurement-based quantum computing
• Representations of the multi-qubit Clifford group
• The role of cohomology in quantum computation with magic states
• Improving compressed sensing with the diamond norm
• Quantifying scrambling in quantum neural networks
• Spectral Properties Versus Magic Generation in $T$-doped Random Clifford Circuits
• Sample-optimal classical shadows for pure states
• Magic of Random Matrix Product States
• Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
• Efficient unitary designs and pseudorandom unitaries from permutations
• Efficient Unitary T-designs from Random Sums
• Continuous-variable quantum state designs: theory and applications
• Quantum Measurements in the Light of Quantum State Estimation
• On the explicit constructions of certain unitary $t$-designs
• Optimising quantum tomography via shadow inversion
• Mixing and localisation in random time-periodic quantum circuits of Clifford unitaries
• Clifford Group and Unitary Designs under Symmetry
• Weak approximate unitary designs and applications to quantum encryption
• Designs from Local Random Quantum Circuits with SU(d) Symmetry
• Extracting randomness from magic quantum states
• Absence of localization in two-dimensional Clifford circuits
• NoRA: A Tensor Network Ansatz for Volume-Law Entangled Equilibrium States of Highly Connected Hamiltonians
• Certifying Quantum Temporal Correlation via Randomized Measurements: Theory and Experiment
• Rank-deficient representations in the Theta correspondence over finite fields arise from quantum codes
• Complexity Classification of Conjugated Clifford Circuits
• Scalable evaluation of quantum-circuit error loss using Clifford sampling
• Predicting Features of Quantum Systems from Very Few Measurements
• Fast and robust quantum state tomography from few basis measurements
• Efficient Classical Shadow Tomography through Many-body Localization Dynamics
• Qudit Shadow Estimation Based on the Clifford Group and the Power of a Single Magic Gate
• Universal Spreading of Conditional Mutual Information in Noisy Random Circuits
• Measurement Contextuality and Planck's Constant
• Estimation of correlations and non-separability in quantum channels via unitarity benchmarking
• New security notions and feasibility results for authentication of quantum data
• Learning Properties of Quantum States Without the I.I.D. Assumption
• Fundamental limits on quantum cloning from the no-signalling principle
• Dynamical phase transitions of information flow in random quantum circuits
• Morphophoric POVMs, generalised qplexes, and 2-designs
• Lower Bounds for Learning Quantum States with Single-Copy Measurements
• Non-Haar random circuits form unitary designs as fast as Haar random circuits
• Non-Clifford Cost of Random Unitaries
• Impact of dynamics, entanglement, and Markovian noise on the fidelity of few-qubit digital quantum simulation
• Robust Estimation of Nonlinear Properties of Quantum Processes
• Estimating many properties of a quantum state via quantum reservoir processing
• Wigner's Theorem for stabilizer states and quantum designs
• Learning Quantum Processes with Quantum Statistical Queries
• Randomized measurements for multi-parameter quantum metrology
• Agnostic Process Tomography
• Multipartite Greenberger-Horne-Zeilinger Entanglement in Monitored Random Clifford Circuits
• Invested and Potential Magic Resources in Measurement-Based Quantum Computation
• Advancing Quantum Networking: Some Tools and Protocols for Ideal and Noisy Photonic Systems
• Clifford Circuits can be Properly PAC Learned if and only if $\text{RP}=\text{NP}$
• Nearly query-optimal classical shadow estimation of unitary channels
• Partial randomized benchmarking
• Generalized group designs: constructing novel unitary 2-, 3- and 4-designs
• Equilibration and Typicality in Quantum Processes
• Resource-efficient shadow tomography using equatorial stabilizer measurements
• On character table of Clifford groups
• Theory of mirror benchmarking and demonstration on a quantum computer
• Approximate 3-designs and partial decomposition of the Clifford group representation using transvections
• Optimal estimation of three parallel spins with genuine and restricted collective measurements
• Optimal randomized measurements for a family of non-linear quantum properties
• Duality theory for Clifford tensor powers
• High-expressibility Quantum Neural Networks using only classical resources
• Generalized Entanglement of Purification Criteria for 2-Producible States in Multipartite Systems
• Adaptively secure unitary designs with constant non-Clifford cost
• Measurement-induced entanglement in noisy 2D random circuits
• Quantum Advantage via Efficient Post-processing on Qudit Classical Shadow tomography
• Approximate Quantum Error Correction with 1D Log-Depth Circuits
• Certifying entanglement dimensionality by $k$-reduction moments