Group Theory

Group theory is the mathematics of symmetry. In quantum computing, it shows up in several critical places: the structure of quantum gate sets, the stabiliser formalism for quantum error correction, the Clifford group and why it is classically simulable, and the hidden subgroup problem that underlies Shor’s algorithm and many others.

This is an advanced elective for learners who want deeper mathematical fluency - not required for most quantum computing applications, but invaluable for anyone working in quantum error correction or quantum algorithm design.

What you’ll learn

• The definition of a group: closure, associativity, identity, and inverses - and why these four axioms capture the essence of symmetry
• Concrete groups before abstract ones: integers under addition, permutation groups, matrix groups, and cyclic groups as motivating examples
• Subgroups: subsets that are themselves groups, and how to identify them
• Cosets and Lagrange’s theorem: how a subgroup divides a group into equal-sized pieces
• Group homomorphisms and isomorphisms: structure-preserving maps between groups
• Normal subgroups and quotient groups: the machinery behind many classification results
• Conjugacy classes: partitioning a group by “sameness up to relabelling” and why this matters for structure
• Group actions: groups acting on geometric objects and sets, the formal version of “symmetry doing something”
• The Sylow theorems: the classic structural results about subgroups of prime power order that close out the course

The quantum applications of all this, the Pauli group, stabiliser codes, the Clifford group, and the hidden subgroup problem behind Shor’s algorithm, are not taught in the course itself, but they are built directly on the concepts above and become accessible once you have them.

Course structure

Brilliant’s group theory course takes a concrete-before-abstract approach. It runs to 22 lessons and 88 exercises across five levels, starting from Symmetry, and was written in collaboration with Jason Horowitz (UC Berkeley PhD and Proof School founder). You begin with familiar examples of groups - the symmetries of a square, permutations of a small set, integers modulo n - before the abstract definition is stated. This builds intuition that makes the later abstract material feel motivated rather than arbitrary.

Subgroups and cosets come next, with interactive exercises showing how cosets partition a group. The homomorphism section connects the abstract structure to the idea that two groups can be “the same” up to relabelling. Normal subgroups and quotient groups follow, covering the machinery used in many classification theorems.

The final levels cover group actions and the Sylow theorems, genuinely university-level material. There is no quantum computing content in the course itself: the payoff for quantum learners comes afterwards, when the stabiliser formalism and the structure of the Pauli group read as straightforward applications of what you now know.

Who is this for?

• Learners who have completed linear algebra and want deeper mathematical understanding of quantum error correction
• Those specifically interested in stabiliser codes who want to understand them at a group-theoretic rather than just a recipe level
• Mathematics students who want abstract algebra with clear applications in physics
• Researchers or engineers who use the stabiliser formalism daily and want clearer foundations

Prerequisites

Linear algebra is essential: comfortable with matrices, matrix multiplication, and vector spaces. Brilliant’s Linear Algebra course or equivalent provides the right preparation. Some mathematical maturity is needed - you should be comfortable reading formal definitions and following multi-step logical arguments. This is not a course for beginners to mathematics.

Hands-on practice

Problems at this level are genuinely mathematical. You will:

• Construct multiplication tables for small groups (dihedral groups, cyclic groups)
• Verify that a given set with an operation satisfies the group axioms
• Find all subgroups of small groups by systematic exploration
• Determine whether a given map is a homomorphism by checking the structure-preservation property
• Work with group actions on geometric objects and apply the Sylow theorems to pin down the structure of small groups

The browser environment lets you test conjectures immediately rather than working through pages of hand calculation.

Why take this course?

Most quantum computing curricula skip group theory and leave learners with a black-box understanding of stabiliser codes. If you want to understand why the surface code works, why Clifford circuits are efficiently classically simulable (Gottesman-Knill), or why Shor’s algorithm is a special case of a general hidden subgroup algorithm, group theory is unavoidable.

Brilliant is one of the few places where you can build this knowledge interactively. The course stays within pure mathematics, so you make the quantum connections yourself in your error correction and algorithms study afterwards, but it is exactly the right preparation. It is a genuine mathematical commitment, and the payoff for quantum error correction and algorithm understanding is substantial.