Compatibility of Braiding and Fusion on Wire Networks
arXiv:2202.08207 · doi:10.1103/PhysRevB.108.035150
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.
7 pages, 4 figures
References in corpus (8)
- Non-Abelian Anyons and Topological Quantum Computation
- Majorana Fermions and a Topological Phase Transition in Semiconductor-Superconductor Heterostructures
- Fractional statistics in anyon collisions
- Exotic non-Abelian anyons from conventional fractional quantum Hall states
- Universal quantum computation on a semiconductor quantum wire network
- Interferometry of non-Abelian Anyons
- Non-Abelian statistics as a Berry phase in exactly solvable models
- Parafermions in a multilegged geometry: Towards a scalable parafermionic network