Wigner's Theorem for stabilizer states and quantum designs

Abstract

We describe the symmetry group of the stabilizer polytope for any number $n$ of systems and any prime local dimension $d$. In the qubit case, the symmetry group coincides with the linear and anti-linear Clifford operations. In the case of qudits, the structure is somewhat richer: for $n=1$, it is a wreath product of permutations of bases and permutations of the elements within each basis. For $n>1$, the symmetries are given by affine symplectic similitudes. These are the affine maps that preserve the symplectic form of the underlying discrete phase space up to a non-zero multiplier. We phrase these results with respect to a number of a priori different notions of "symmetry'', including Kadison symmetries (bijections that are compatible with convex combinations), Wigner symmetries (bijections that preserve inner products), and symmetries realized by an action on Hilbert space. Going beyond stabilizer states, we extend an observation of Heinrich and Gross (Ref. [25]) and show that the symmetries of fairly general sets of Hermitian operators are constrained by certain moments. In particular: the symmetries of a set that behaves like a 3-design preserve Jordan products and are therefore realized by conjugation with unitaries or anti-unitaries. (The structure constants of the Jordan algebra are encoded in an order-three tensor, which we connect to the third moments of a design). This generalizes Kadison's formulation of the classic Wigner Theorem on quantum mechanical symmetries.

21 pages, v2: minor notation changes and references added

References in corpus (27)

• Improved Simulation of Stabilizer Circuits
• The Resource Theory of Stabilizer Computation
• Instantaneous non-local computation of low T-depth quantum circuits
• The Heisenberg Representation of Quantum Computers
• Positive Wigner functions render classical simulation of quantum computation efficient
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Negative Quasi-Probability as a Resource for Quantum Computation
• Evenly distributed unitaries: on the structure of unitary designs
• Hudson's Theorem for finite-dimensional quantum systems
• SIC-POVMs and the Extended Clifford Group
• Multiqubit Clifford groups are unitary 3-designs
• Improved magic states distillation for quantum universality
• Classicality in discrete Wigner functions
• Quantifying quantum speedups: improved classical simulation from tighter magic monotones
• Quantifying magic for multi-qubit operations
• 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
• Equivalence between contextuality and negativity of the Wigner function for qudits
• Phase space simulation method for quantum computation with magic states on qubits
• Classical simulatability, entanglement breaking, and quantum computation thresholds
• Real Randomized Benchmarking
• From estimation of quantum probabilities to simulation of quantum circuits
• A hidden variable model for universal quantum computation with magic states on qubits
• Qubit stabilizer states are complex projective 3-designs
• Two elementary proofs of the Wigner theorem on symmetry in quantum mechanics
• The axiomatic and the operational approaches to resource theories of magic do not coincide
• Critical even unimodular lattices in the Gaussian core model

Cited by in corpus (1)

• A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems