Level-rank duality for a Universal Topological Quantum Computer

2018/11/28 by Howard J. Schnitzer, Schnitzer, Howard J. · 1 citation
Computer Science · Physics and Astronomy · #FOS: Physical sciences #High Energy Physics - Theory (hep-th) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum and electron transport phenomena

paper · pdf · doi:10.48550/arxiv.1811.11861

openalex publication_date 2018/11/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Cited by

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

Related

• Level-rank duality of SU(2)k Chern-Simons theory, and of hypergraph and magic states
• Large k topological quantum computer
• A modular functor which is universal for quantum computation
• Universal Quantum Computation with the S₃ Quantum Double: A Pedagogical Exposition
• Topological Quantum Computation