Compatibility of Braiding and Fusion on Wire Networks

Abstract

Exchanging particles on graphs, or more concretely on networks of quantum wires, has been proposed as a means to perform fault tolerant quantum computation. This was inspired by braiding of anyons in planar systems. However, exchanges on a graph are not governed by the usual braid group but instead by a graph braid group. By imposing compatibility of graph braiding with fusion of topological charges, we obtain generalized hexagon equations. We find the usual planar anyons solutions but also more general braid actions. We illustrate this with Abelian, Fibonacci and Ising fusion rules.