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:2105.11498

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

Howard J. Schnitzer

Published May 24, 2021• 1 citation
arXivHTMLPDF

Abstract

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

Related papers

Topological quantum computation within the anyonic system the Kauffman–Jones version of SU(2) Chern–Simons theory at level 4

Claire Levaillant

arXiv:1501.02841•Quantum Information Processing•Feb 4, 2016•9 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

Dimensional reduction of U(1) × SU(2) Chern-Simons bosonization: Application to the t-J model

P. A. Marchetti, Zhao-Bin Su, Lu Yu

arXiv:hep-th/9605115•Nuclear Physics B•Dec 1, 1996•31 citations

Paired states of Chern-Simons fermions in quantum spin models

Andrew A. Allocca, Tigran Sedrakyan, Victor M. Galitski

Bulletin of the American Physical Society•Mar 15, 2016•0 citations

Hypergraph States in SU(N)1, N odd prime, Chern-Simons Theory

Howard J. Schnitzer

Graph states and hypergraph states can be constructed from products of basic operations that appear in SU(N)1. The level-rank dual of a theorem of Salton, Swingle, and Walter implies that these operations can be prepared topologically in the n-torus Hilbert space of Chern-Simons theory for N neq 5 mod 4. For SU(N)1, N = 5 mod 4, only stabilizer states can be prepared on the n-torus Hilbert space, which restricts the construction to graph states.

arXiv:2102.02281•Feb 3, 2021•0 citations

Level-rank duality for a Universal Topological Quantum Computer

Howard J. Schnitzer

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.

arXiv:1811.11861•Nov 28, 2018•3 citations
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.