Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum Permutation Groups

Updated 17 April 2026
  • Quantum permutation groups are noncommutative generalizations of classical symmetric groups, defined by magic unitary matrices that enforce projection and partition-of-unity relations.
  • They exhibit a rich representation theory using non-crossing partitions and Weingarten calculus, which yields key results on fusion rules and spectral statistics.
  • Their applications span quantum automorphism of graphs, noncommutative probability, and quantum information, with several open problems in subgroup classification and symmetry analysis.

A quantum permutation group is a noncommutative generalization of the classical symmetric group, encoding universal quantum symmetries of finite or infinite sets. Their algebraic realization, introduced by Wang, is formalized via "magic unitary" matrices whose C*-algebraic relations encode both the projections and the partition-of-unity properties of permutation matrices, without imposing commutativity. This framework produces infinite-dimensional, compact quantum groups with a rich interplay between noncommutative analysis, tensor categories, subfactor theory, and quantum symmetries of discrete structures and metric spaces.

1. Algebraic Definition and Fundamental Structure

Let n1n\geq1. The quantum permutation group Sn+S_n^+ is the compact quantum group whose algebra of "continuous functions," C(Sn+)C(S_n^+), is the universal unital C*-algebra generated by n2n^2 projections uiju_{ij} subject to the "magic unitary" relations: uij=uij=uij2,k=1nuik=1,k=1nukj=1(1i,jn)u_{ij} = u_{ij}^* = u_{ij}^2, \quad \sum_{k=1}^n u_{ik} = 1, \quad \sum_{k=1}^n u_{kj} = 1 \quad (1\leq i,j\leq n) If all uiju_{ij} are required to commute, C(Sn+)C(S_n^+) reduces to C(Sn)C(S_n), the algebra of functions on the classical symmetric group. For n3n\leq3, Sn+S_n^+0, but for Sn+S_n^+1, Sn+S_n^+2 is infinite-dimensional and noncommutative, exhibiting strictly quantum phenomena not present in classical combinatorics (Banica, 2020).

The Hopf *-algebra structure is defined on generators by

Sn+S_n^+3

satisfying the axioms for a compact (Kac type) quantum group (Franz et al., 2015, Banica, 2020). The Haar state is unique and tracial.

2. Representation Theory, Easiness, and Weingarten Calculus

The representation theory is governed by the category of non-crossing partitions (NC). Sn+S_n^+4 is an "easy quantum group": morphism spaces between tensor powers of the fundamental corepresentation are linearly spanned by maps associated to NC partitions (Banica, 2020). For example,

Sn+S_n^+5

This gives combinatorial access to fusion rules, spectral decompositions, and asymptotic eigenvalue statistics of characters. The Weingarten calculus, adapted from random matrix theory, expresses Haar state integrals as sums over NC pairings with explicit Weingarten coefficients, yielding e.g. the moments of the main character Sn+S_n^+6 (the Catalan numbers) and semicircular law in the large Sn+S_n^+7 limit (McCarthy, 2023, Banica, 2020).

Partition-based methods extend to closed quantum subgroups, quantum reflection groups, and quantum symmetry groups of finite graphs, framing their representation theories in terms of planar algebras and subfactor theory.

3. Quantum Symmetries and Automorphism Groups of Combinatorial Structures

Quantum permutation groups act as universal quantum symmetries of finite sets and more generally, of finite quantum spaces (spectra of finite-dimensional C*-algebras), and finite graphs. Given a (simple) graph Sn+S_n^+8 with adjacency matrix Sn+S_n^+9, its quantum automorphism group C(Sn+)C(S_n^+)0 is defined by imposing the commutation relation C(Sn+)C(S_n^+)1 in the magic unitary’s defining algebra, yielding a quotient C*-algebra C(Sn+)C(S_n^+)2 (Banica, 2020, Lupini et al., 2017). When C(Sn+)C(S_n^+)3 is noncommutative, C(Sn+)C(S_n^+)4 "has genuine quantum symmetry"; see e.g., complete graphs, hypercubes, and many Cayley graphs for explicit quantum symmetry (Nechita et al., 2019).

Key results include:

  • For random graphs, C(Sn+)C(S_n^+)5 is almost surely trivial as C(Sn+)C(S_n^+)6 (Lupini et al., 2017).
  • Quantum-vertex-transitive graphs can be constructed that are not classically vertex-transitive using operator quantum strategies in nonlocal games (Lupini et al., 2017).
  • In the infinite case, one constructs C(Sn+)C(S_n^+)7, the quantum permutation group of an infinite set C(Sn+)C(S_n^+)8, as a discrete quantum group via a suitable completion, covering infinite quantum automorphism groups of graphs (Voigt, 2022).

4. Subgroups, Classification, and Intermediate Quantum Groups

Compact quantum subgroups of C(Sn+)C(S_n^+)9 (dually, quotients of the universal algebra) are classified using Hopf algebra techniques, coideal subalgebras, and deformation theory. The category of finite-dimensional cosemisimple Hopf algebras generated by magic matrices forms the "quantum permutation algebras" (Banica et al., 2011). Twisting by 2-cocycles or constructing bicrossed product extensions generates broad classes of quantum permutation subgroups.

A major structural result is the "maximality conjecture," now a theorem for n2n^20 (Józiak, 2016, Józiak, 2019, Jung et al., 2019): any compact quantum subgroup n2n^21 with n2n^22 is necessarily either classical or all of n2n^23. For n2n^24, potential existence of intermediate quantum subgroups remains open (Jung et al., 2019).

5. Functional Analytic and Probabilistic Aspects

Quantum permutation groups are fertile ground for noncommutative probability and quantum stochastic processes:

6. Quantum Action Rigidity, Classical Actions, and Ergodicity

Quantum permutation groups exhibit rigidity in their classical actions:

  • The only nontrivial ergodic classical action of uiju_{ij}1 is the standard permutation action on uiju_{ij}2 points; any other action is either trivial or reduces to this up to isomorphism (Freslon et al., 2023).
  • This addresses Goswami’s rigidity conjecture in the context of quantum isometries, and extends rigorously to all free "easy" quantum groups (those associated with non-crossing partitions) (Freslon et al., 2023).
  • Generalizations to actions on infinite or noncommutative spaces, torsion phenomena, and Baum–Connes theory are under active investigation.

7. Applications, Open Problems, and Directions

Quantum permutation groups link quantum symmetry to combinatorics, noncommutative geometry, and quantum information theory:

  • Quantum automorphism and isomorphism notions for finite graphs correspond to perfect quantum strategies in nonlocal games, with implications for quantum isomorphism problems (Lupini et al., 2017).
  • Intermediate quantum groups, sinkhorn models, and structure of quantum symmetries in infinite graphs (e.g., Hamming or Johnson graphs, Cartesian products) remain incompletely classified, with particular attention to "no-quantum-symmetry" and existence of new non-classical invariants (Voigt, 2022).
  • Characterization of all finite-dimensional quantum permutation algebras, envelope theory (maximal QP Hopf subalgebras), and classification of quantum subgroups via planar algebras are central open questions (Banica et al., 2011, Banica, 2020).
  • Algorithmic and probabilistic models (Sinkhorn iterative schemes, random flat magic matrices) provide experimental evidence and computational tools for exploring inner faithfulness, fusion rule predictions, and probabilistic laws (free Poisson, semicircular) in quantum permutation theory (Banica et al., 2016, Nechita et al., 2019, McCarthy, 2023).

Quantum permutation groups have become central objects at the interface of operator algebras, quantum algebra, combinatorics, and quantum information, providing a testing ground for new concepts in noncommutative invariants, quantum symmetries, and classification of quantum group actions.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Quantum Permutation Groups.