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.
arXiv comment7 pages, 4 figures
References in corpus (28)
- Fault-tolerant quantum computation by anyons
- Non-Abelian Anyons and Topological Quantum Computation
- Anyons in an exactly solved model and beyond
- Majorana Fermions and a Topological Phase Transition in Semiconductor-Superconductor Heterostructures
- Helical liquids and Majorana bound states in quantum wires
- Non-Abelian statistics and topological quantum information processing in 1D wire networks
- Direct observation of anyonic braiding statistics at the =1/3 fractional quantum Hall state
- 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
- Majorana fermion exchange in quasi-one-dimensional networks
- The two-eigenvalue problem and density of Jones representation of braid groups
- Non-adiabatic Effects in the Braiding of Non-Abelian Anyons in Topological Superconductors
- Non-adiabatic processes in Majorana qubit systems
- Boosting Majorana zero modes
- Dynamics of Majorana-based qubits operated with an array of tunable gates
- Non-Abelian statistics as a Berry phase in exactly solvable models
- A topological Josephson junction platform for creating, manipulating, and braiding Majorana bound states
- Near-group categories
- n-particle quantum statistics on graphs
- Protocol Discovery for the Quantum Control of Majoranas by Differentiable Programming and Natural Evolution Strategies
- Error generation and propagation in Majorana-based topological qubits
- Non-abelian Quantum Statistics on Graphs
- Rigorous Calculations of Non-Abelian Statistics in the Kitaev Honeycomb Model
- Parafermions in a multilegged geometry: Towards a scalable parafermionic network
- Geometric presentations of braid groups for particles on a graph
- Universal properties of anyon braiding on one-dimensional wire networks