Entangling gates for the SU(N) anyons

The model of a topological quantum computer is a promising one due to its natural resistance to noise and other errors. Operations in such a computer are implemented by braiding the trajectories of anyons. While it is easy to understand how to build one-qubit operations, two-qubit operations are more difficult. In arXiv:2412.20931 we suggested an approach to build such operations for a topological quantum computer based on SU(2) Chern-Simons theory with arbitrary level using cabling of knots. In this paper we discuss how this approach should be generalized to the SU(N) case, what the differences are, and which new problems arise.

Source: arXiv:2605.04016v1 - http://arxiv.org/abs/2605.04016v1 PDF: https://arxiv.org/pdf/2605.04016v1 Original Link: http://arxiv.org/abs/2605.04016v1