We introduce a pentagon equation solver, available as part of SageMath, and use it to construct braid group representations associated to certain anyon systems. We recall the category-theoretic framework for topological quantum computation to explain how these representations describe the sets of logical gates available to an anyonic quantum computer for information processing. In doing so, we avoid venturing deep into topological or conformal quantum field theory. Instead, we present anyons abstractly as sets of labels together with a collection of data satisfying a number of axioms, including the pentagon and hexagon equations, and explain how these data characterize ribbon fusion categories (RFCs). In the language of RFCs, our solver can produce
F-matrices for anyon systems corresponding to multiplicity-free fusion rings arising in connection with the representation theory of quantum groups associated to simple Lie algebras with deformation parameter a root of unity.
We discuss how to construct models of interacting anyons by generalizing quantum spin Hamiltonians to anyonic degrees of freedom. The simplest interactions energetically favor pairs of anyons to fuse into the trivial (“identity") channel, similar to the quantum Heisenberg model favoring pairs of spins to form spin singlets. We present an introduction to the theory of anyons and discuss in detail how basis sets and matrix representations of the interaction terms can be obtained, using non-Abelian Fibonacci anyons as example. Besides discussing the “golden chain”, a one-dimensional system of anyons with nearest neighbor interactions, we also present the derivation of more complicated interaction terms, such as three-anyon interactions in the spirit of the Majumdar-Ghosh spin chain, longer range interactions and two-leg ladders. We also discuss generalizations to anyons with general non-Abelian SU(2)k statistics. The k→∞ limit of the latter yields ordinary SU(2) spin chains.
Classically simulating the dynamics of anyonic excitations in two-dimensional quantum systems is likely intractable in general because such dynamics are sufficient to implement universal quantum computation. However, processes of interest for the study of quantum error correction in anyon systems are typically drawn from a restricted class that displays significant structure over a wide range of system parameters. We exploit this structure to classically simulate, and thereby demonstrate the success of, an error-correction protocol for a quantum memory based on the universal Fibonacci anyon model. We numerically simulate a phenomenological model of the system and noise processes on lattice sizes of up to $128\ifmmode\times\else\texttimes\fi{}128$ sites, and find a lower bound on the error-correction threshold of approximately 0.125 errors per edge, which is comparable to those previously known for Abelian and (nonuniversal) non-Abelian anyon models.
Anyons in
2+1 dimensions are not only characterized by exotic braiding statistics but also by intricate fusion properties. Two anyons may fuse into multiple topological charge sectors, and associativity of fusing three anyons to produce a fixed charge sector is governed by
F-symbols. While braiding invariants, such as the modular data, are typically complex valued, a complete description of general anyon models requires understanding the arithmetic properties of its fusion associativity data as well. The
F-symbols for many of the most common
2+1d topological orders, including all Abelian anyon models as well as Fibonacci and Ising anyons, can be made real valued. We show this phenomenon is not universal by exhibiting braided fusion categories whose
F-symbols cannot be made real. We call such
F-symbols "inherently complex." The examples we study lack a charge-conjugation symmetry and our results are therefore consistent with the converse of a statement proved in a companion work linking real
F-symbols in braided fusion categories with the existence of a suitable charge-conjugation symmetry. We analyse the smallest-rank braided fusion categories we know of with inherently complex
F-symbols:
Rep(Z7⋊Z3) and
Rep(Z5⋊Z4). Consequently, the corresponding
Z(Rep(Z7⋊Z3)) and
Z(Rep(Z5⋊Z4)) anyon models also have inherently complex
F-symbols. Our presentation connects these examples with recent results on classifying anyons beyond modular data.
The emergence of non-Abelian anyons from large collections of interacting elementary particles is a conceptually beautiful phenomenon with important ramifications for fault-tolerant quantum computing. Over the last few decades the field has evolved from a highly theoretical subject to an active experimental area, particularly following proposals for trapping non-Abelian anyons in 'engineered' structures built from well-understood components. In this short overview we briefly tour the impressive progress that has taken place in the quest for the simplest type of non-Abelian anyon—defects binding Majorana zero modes—and then turn to similar strategies for pursuing more exotic excitations. Specifically, we describe how interfacing simple quantum Hall systems with conventional superconductors yields 'parafermionic' generalizations of Majorana modes and even Fibonacci anyons—the latter enabling fully fault tolerant universal quantum computation. We structure our treatment in a manner that unifies these topics in a coherent way. The ideas synthesized here spotlight largely uncharted experimental territory in the field of quantum Hall physics that appears ripe for discovery.