Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations

Abstract

Schur-Weyl duality is a ubiquitous tool in quantum information. At its heart is the statement that the space of operators that commute with the tensor powers of all unitaries is spanned by the permutations of the tensor factors. In this work, we describe a similar duality theory for tensor powers of Clifford unitaries. The Clifford group is a central object in many subfields of quantum information, most prominently in the theory of fault-tolerance. The duality theory has a simple and clean description in terms of finite geometries. We demonstrate its effectiveness in several applications: (1) We resolve an open problem in quantum property testing by showing that "stabilizerness" is efficiently testable: There is a protocol that, given access to six copies of an unknown state, can determine whether it is a stabilizer state, or whether it is far away from the set of stabilizer states. We give a related membership test for the Clifford group. (2) We find that tensor powers of stabilizer states have an increased symmetry group. We provide corresponding de Finetti theorems, showing that the reductions of arbitrary states with this symmetry are well-approximated by mixtures of stabilizer tensor powers (in some cases, exponentially well). (3) We show that the distance of a pure state to the set of stabilizers can be lower-bounded in terms of the sum-negativity of its Wigner function. This gives a new quantitative meaning to the sum-negativity (and the related mana) -- a measure relevant to fault-tolerant quantum computation. The result constitutes a robust generalization of the discrete Hudson theorem. (4) We show that complex projective designs of arbitrary order can be obtained from a finite number (independent of the number of qudits) of Clifford orbits. To prove this result, we give explicit formulas for arbitrary moments of random stabilizer states.

60 pages, 2 figures, accepted at Communications in Mathematical Physics

References in corpus (12)

• Robust randomized benchmarking of quantum processes
• Aspects of generic entanglement
• Security of continuous-variable quantum key distribution against general attacks
• One-and-a-half quantum de Finetti theorems
• The Spectra of Density Operators and the Kronecker Coefficients of the Symmetric Group
• The Clifford group fails gracefully to be a unitary 4-design
• Learning and Testing Algorithms for the Clifford Group
• A quasipolynomial-time algorithm for the quantum separability problem
• A Finite de Finetti Theorem for Infinite-Dimensional Systems
• Low rank matrix recovery from Clifford orbits
• Learning stabilizer states by Bell sampling
• Rank-deficient representations in the Theta correspondence over finite fields arise from quantum codes

Cited by in corpus (76)

• Information-theoretic bounds on quantum advantage in machine learning
• Many-body quantum magic
• Operator scaling dimensions and multifractality at measurement-induced transitions
• Scalable measures of magic resource for quantum computers
• Measurement-induced criticality and entanglement clusters: a study of 1D and 2D Clifford circuits
• Many-body magic via Pauli-Markov chains -- from criticality to gauge theories
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• Nonstabilizerness via matrix product states in the Pauli basis
• Controlling entanglement at absorbing state phase transitions in random circuits
• Measuring nonstabilizerness via multifractal flatness
• Magic spreading in random quantum circuits
• Pauli Spectrum and Non-stabilizerness of Typical Quantum Many-Body States
• Efficient quantum algorithms for stabilizer entropies
• Real Randomized Benchmarking
• Learning t-doped stabilizer states
• Magic in generalized Rokhsar-Kivelson wavefunctions
• Random Matrix Theory of the Isospectral twirling
• Statistical mechanics model for Clifford random tensor networks and monitored quantum circuits
• Error-resilience Phase Transitions in Encoding-Decoding Quantum Circuits
• Thrifty shadow estimation: re-using quantum circuits and bounding tails
• Performance analysis of multi-shot shadow estimation
• Bell sampling from quantum circuits
• Learning shallow quantum circuits
• Magic Resources of the Heisenberg Picture
• Improved Stabilizer Estimation via Bell Difference Sampling
• Clifford Dressed Time-Dependent Variational Principle
• Postselection technique for optical Quantum Key Distribution with improved de Finetti reductions
• Efficient mutual magic and magic capacity with matrix product states
• Pseudorandom unitaries are neither real nor sparse nor noise-robust
• Hypergraph min-cuts from quantum entropies
• Anticoncentration and state design of random tensor networks
• Pseudorandom density matrices
• Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
• Quantum Measurements in the Light of Quantum State Estimation
• Nonstabilizerness dynamics in many-body localized systems
• Mixing and localisation in random time-periodic quantum circuits of Clifford unitaries
• Bridging Entanglement and Magic Resources within Operator Space
• A nonstabilizerness monotone from stabilizerness asymmetry
• Designs from Local Random Quantum Circuits with SU(d) Symmetry
• Efficient distributed inner product estimation via Pauli sampling
• Fermionic Magic Resources of Quantum Many-Body Systems
• Qudit Shadow Estimation Based on the Clifford Group and the Power of a Single Magic Gate
• Disentangling magic states with classically simulable quantum circuits
• Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates
• Efficient witnessing and testing of magic in mixed quantum states
• Operational interpretation of the Stabilizer Entropy
• Optimal trace-distance bounds for free-fermionic states: Testing and improved tomography
• Exponential learning advantages with conjugate states and minimal quantum memory
• Linear programming with unitary-equivariant constraints
• Designs from magic-augmented Clifford circuits
• Non-stabilizerness of Neural Quantum States
• Counting stabiliser codes for arbitrary dimension
• Anticoncentration and State Design of Doped Real Clifford Circuits and Tensor Networks
• Computational self-testing for entangled magic states
• Certifying nonstabilizerness in quantum processors
• Non-Clifford Cost of Random Unitaries
• Wigner's Theorem for stabilizer states and quantum designs
• Nonstabilizerness and Error Resilience in Noisy Quantum Circuits
• Random Quantum Circuits with Time-Reversal Symmetry
• Deformations of the symmetric subspace of qubit chains
• Single-copy stabilizer testing
• Bounding the quantum capacity with flagged extensions
• Universality classes for purification in nonunitary quantum processes
• Secret extraction attacks against obfuscated IQP circuits
• Tight concentration inequalities for quantum adversarial setups exploiting permutation symmetry
• On character table of Clifford groups
• Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudo-Magic States
• $\Gamma$-conjugate weight enumerators and invariant theory
• Approximate 3-designs and partial decomposition of the Clifford group representation using transvections
• Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs
• Experimental measurement and a physical interpretation of quantum shadow enumerators
• Pseudoentanglement Ain't Cheap
• Bell sampling in Quantum Monte Carlo simulations
• Agnostic Tomography of Stabilizer Product States
• The abelian state hidden subgroup problem: Learning stabilizer groups and beyond
• Duality theory for Clifford tensor powers