Measuring Chern–Simons level k by braiding $$SU(2)_k$$ S U ( 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...
Saved in:
Main Authors: | Artem Belov, Andrey Morozov |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2025-01-01
|
Series: | European Physical Journal C: Particles and Fields |
Online Access: | https://doi.org/10.1140/epjc/s10052-024-13734-1 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On (k,kn-k2-2k-1)-Choosability of n-Vertex Graphs
by: Wongsakorn Charoenpanitseri
Published: (2015-01-01) -
Subdominant positive solutions of the discrete equation Δu(k+n)=−p(k)u(k)
by: Jaromír Baštinec, et al.
Published: (2004-01-01) -
Exact Computations in Topological Abelian Chern-Simons and BF Theories
by: Philippe Mathieu
Published: (2017-01-01) -
Chern-Simons forms of pseudo-Riemannian homogeneity on the
oscillator group
by: P. M. Gadea, et al.
Published: (2003-01-01) -
Reduction of Chern-Simons-Schrödinger Systems in One Space Dimension
by: Hyungjin Huh
Published: (2013-01-01)