pith. sign in

arxiv: quant-ph/0509175 · v2 · submitted 2005-09-23 · 🪐 quant-ph · cond-mat.mes-hall· hep-th

Topological Quantum Computing with Only One Mobile Quasiparticle

classification 🪐 quant-ph cond-mat.mes-hallhep-th
keywords quantumquasiparticlearoundcomputationdimensionaldoneidenticalother
0
0 comments X
read the original abstract

In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form braids of their world lines in 2+1 dimensional space-time. In this paper we show that any such quantum computation that can be done by braiding $n$ identical quasiparticles can also be done by moving a single quasiparticle around n-1 other identical quasiparticles whose positions remain fixed.

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.