Simulation of Anyons Using Symmetric Tensor Network Algorithms
Abstract
In this thesis I develop a formalism whereby a tensor network may be understood in terms of a unitary braided tensor category, and represented in a particularly efficient manner corresponding to the exploitation of this mathematical structure. This approach permits the exploitation of the global Abelian and non-Abelian internal group symmetries of a lattice model, both to facilitate the study of particular symmetry sectors and to provide a considerable reduction in computational cost. It also enables the study of models with non-trivial exchange statistics (fermions, Abelian and non-Abelian anyons) using tensor network algorithms which scale polynomially in the system size.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.