Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1811.11861

Level-rank duality for a Universal Topological Quantum Computer

Howard J. Schnitzer

Published Nov 28, 2018• 3 citations
arXivHTMLPDF

Abstract

It is shown, using level-rank duality that a universal topological quantum computer based on Chern-Simons theory for SU(2)$_3$ also implies an analogous universal quantum computer based on SU(3)$_2$. Suggestions are made for the possible role of level-rank duality in entanglement from topology.

DOI
10.48550/arxiv.1811.11861

Related papers

Level-rank duality of SU(2)k Chern-Simons theory, and of hypergraph and magic states

Howard J. Schnitzer

The level-rank duality of SU(2)k Chern-Simons theory is discussed, and applied to graph, hypergraph, and magic states.

arXiv:2105.11498•May 24, 2021•1 citation

Entangling gates for the SU(N) anyons

Sergey Mironov, Andrey Morozov

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.

hep-thCross-listedarXiv:2605.04016•May 6, 2026•0 citations

Large k topological quantum computer

Nikita Kolganov, Sergey Mironov, Andrey Morozov

Chern-Simons topological quantum computer is a device that can be effectively described by the Chern-Simons topological quantum field theory and used for quantum computations. Quantum qudit gates of this quantum computer are represented by sequences of quantum R-matrices. Its dimension and explicit form depend on the parameters of the Chern-Simons theory — level k, gauge group SU(N), and representation, which is chosen to be symmetric representation [r]. In this paper, we examine the universality of such a quantum computer. We prove that for sufficiently large k it is universal, and the minimum allowed value of k depends on the remaining parameters r and N.

arXiv:2105.03980•Nuclear Physics B•Jan 9, 2023•15 citations

Towards topological quantum computer

Dmitry Melnikov, Andrei Dmitrievich Mironov, С.А. Миронов +2 more

Quantum R-matrices, the entangling deformations of non-entangling (classical) permutations, provide a distinguished basis in the space of unitary evolutions and, consequently, a natural choice for a minimal set of basic operations (universal gates) for quantum computation. Yet they play a special role in group theory, integrable systems and modern theory of non-perturbative calculations in quantum field and string theory. Despite recent developments in those fields the idea of topological quantum computing and use of R-matrices, in particular, practically reduce to reinterpretation of standard sets of quantum gates, and subsequently algorithms, in terms of available topological ones. In this paper we summarize a modern view on quantum R-matrix calculus and propose to look at the R-matrices acting in the space of irreducible representations, which are unitary for the real-valued couplings in Chern–Simons theory, as the fundamental set of universal gates for topological quantum computer. Such an approach calls for a more thorough investigation of the relation between topological invariants of knots and quantum algorithms.

arXiv:1703.00431•Nuclear Physics B•Dec 2, 2017•36 citations

Topological Entanglement Entropy in Chern-Simons Theories and Quantum Hall Fluids

Shiying Dong, Eduardo Fradkin, Robert G. Leigh +1 more

We compute directly the entanglement entropy of spatial regions in Chern-Simons gauge theories in 2 + 1 dimensions using surgery. We use these results to determine the universal topological piece of the entanglement entropy for Abelian and non-Abelian quantum Hall fluids.

•Jan 1, 2008•210 citations

Universal topological quantum computing via double-braiding in SU(2) Witten–Chern–Simons theory

Adrian L. Kaufmann, Shawn Xingshan Cui

arXiv:2312.16747•Quantum Information Processing•Jan 6, 2025•1 citation
It is shown, using level-rank duality that a universal topological quantum computer based on Chern-Simons theory for SU(2)3_33​ also implies an analogous universal quantum computer based on SU(3)2_22​. Suggestions are made for the possible role of level-rank duality in entanglement from topology.
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.
Chern-Simons topological quantum computer is a device that can be effectively described by the Chern-Simons topological quantum field theory and used for quantum computations. Quantum qudit gates of this quantum computer are represented by sequences of quantum R-matrices. Its dimension and explicit form depend on the parameters of the Chern-Simons theory — level k, gauge group SU(N), and representation, which is chosen to be symmetric representation [r]. In this paper, we examine the universality of such a quantum computer. We prove that for sufficiently large k it is universal, and the minimum allowed value of k depends on the remaining parameters r and N.
Quantum R-matrices, the entangling deformations of non-entangling (classical) permutations, provide a distinguished basis in the space of unitary evolutions and, consequently, a natural choice for a minimal set of basic operations (universal gates) for quantum computation. Yet they play a special role in group theory, integrable systems and modern theory of non-perturbative calculations in quantum field and string theory. Despite recent developments in those fields the idea of topological quantum computing and use of R-matrices, in particular, practically reduce to reinterpretation of standard sets of quantum gates, and subsequently algorithms, in terms of available topological ones. In this paper we summarize a modern view on quantum R-matrix calculus and propose to look at the R-matrices acting in the space of irreducible representations, which are unitary for the real-valued couplings in Chern–Simons theory, as the fundamental set of universal gates for topological quantum computer. Such an approach calls for a more thorough investigation of the relation between topological invariants of knots and quantum algorithms.