pith. sign in

arxiv: 1001.4085 · v2 · pith:PNAXOF6Onew · submitted 2010-01-22 · 🪐 quant-ph · cond-mat.mes-hall· math-ph· math.MP

Unified approach to topological quantum computation with anyons: From qubit encoding to Toffoli gate

classification 🪐 quant-ph cond-mat.mes-hallmath-phmath.MP
keywords quantumtopologicalcomputationanyonapproachchern-simons-wittenencodinggates
0
0 comments X
read the original abstract

Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and sparse representations of quantum information (qubits) and a simple construction of multi-qubit gates, for all anyon models from Chern-Simons-Witten SU(2)$_k$ theory that support universal quantum computation by braiding ($k\geq 3,\ k \neq 4$). In the process, we show how the constructions of topological quantum memory and gates for $k=2,4$ connect naturally to those for $k\geq 3,\ k \neq 4$, unifying these concepts in a simple framework. Furthermore, we illustrate potential extensions of these ideas to other anyon models outside of Chern-Simons-Witten field theory.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Lower overhead fault-tolerant building blocks for noisy quantum computers

    quant-ph 2026-05 unverdicted novelty 5.0

    New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.