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

Abstract

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 commentv2; typos corrected and reference added

References in corpus (21)

• The Resource Theory of Stabilizer Computation
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Novel constructions for the fault-tolerant Toffoli gate
• Quantum Hypergraph States
• Quantum computation with realistic magic state factories
• Many-body quantum magic
• Qudit versions of the qubit "pi-over-eight" gate
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Distilling one-qubit magic states into Toffoli states
• Entanglement Entropy and the Colored Jones Polynomial
• Entanglement from Topology in Chern-Simons Theory
• New techniques for fault-tolerant decomposition of Multi-Controlled Toffoli gate
• Qutrit and Ququint Magic States
• Qudit Hypergraph States
• Symmetries and entanglement of stabilizer states
• A Gap Between the Hypergraph and Stabilizer Entropy Cones
• Mana in Haar-random states
• A quantum compiler for qudits of prime dimension greater than 3
• Bit threads on hypergraphs
• Level-rank duality for a Universal Topological Quantum Computer
• Clifford operators in SU(N)1; N not odd prime