2000 character limit reached
Level-rank duality for a Universal Topological Quantum Computer
Published 28 Nov 2018 in hep-th and quant-ph | (1811.11861v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.