Measuring Chern-Simons level $k$ by braiding $SU(2{)}_k$ anyons

Abstract

Chern-Simons theory in application to the quantum computing is actively developing at the present. However, most discussed are the questions of using materials with known parameters and building corresponding quantum gates and algorithms. In this paper we discuss opposite problem of finding Chern-Simons level $k$ in the unknown material. For this purpose, we use the previously derived braiding rules for Chern-Simons $SU(2{)}_k$ anyons. Using certain operations (turnarounds) on three anyons, one can measure probabilities of annihilation of pairs of anyons, which depend on the parameter of the theory. Therefore, Chern-Simons level $k$ can be found from such an experiment. It is implied that anyons additionally possess certain properties which are required for topological quantum computations.

12 pages, 13 figures

References in corpus (17)

• Fault-tolerant quantum computation by anyons
• Non-Abelian Anyons and Topological Quantum Computation
• Anyons in an exactly solved model and beyond
• Direct observation of anyonic braiding statistics at the $\nu$=1/3 fractional quantum Hall state
• A short introduction to Fibonacci anyon models
• Introduction to topological quantum computation with non-Abelian anyons
• Anyons and Quantum Groups
• A two-site Kitaev chain in a two-dimensional electron gas
• Non-Abelian braiding of Fibonacci anyons with a superconducting processor
• Towards topological quantum computer
• Observation of higher-order topological states on a quantum computer
• Multi-Colored Links From 3-strand Braids Carrying Arbitrary Symmetric Representations
• Quantum $\mathcal{R}$-matrices as universal qubit gates
• On measuring the topological charge of anyons
• Braiding Fibonacci anyons
• Entangled states from arborescent knots
• Measurement and feedforward induced entanglement negativity transition