On Low-Rank Multiplicity-Free Fusion Categories
Gert Vercleyen

TL;DR
This thesis develops algorithms and software to explicitly compute fusion and braiding data for all multiplicity-free pivotal fusion categories up to rank 7, with applications in topological quantum computation.
Contribution
It introduces new algorithms and the Anyonica software for classifying and constructing fusion categories up to rank 7, including non-commutative and generalized fusion rings.
Findings
Explicit F, R, and pivotal coefficients for categories up to rank 7.
Classification of all multiplicity-free fusion rings up to rank 9.
Development of the Anyonica software for fusion system computations.
Abstract
This thesis explains the methods and algorithms we used to obtain explicit F symbols, R symbols, and pivotal coefficients of all multiplicity-free pivotal fusion categories up to rank 7. The thesis starts by introducing the concept of a unitary modular fusion system via two applications: modeling anyons for topological quantum computation and calculating braid group representations. Next, the notions of a pivotal, spherical, braided, ribbon, and modular fusion system are introduced. Unitarity and its implications on the pivotal structure are discussed as well. The next part of the thesis is devoted to algorithms for finding fusion systems and compatible structures. First, an algorithm to find low-rank fusion rings is explained, and its results are given. Special attention is given to the structure of non-commutative fusion rings and the construction of songs, which are generalizations…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition · Rough Sets and Fuzzy Logic
