pith. sign in

arxiv: 0910.2427 · v2 · submitted 2009-10-13 · 🪐 quant-ph

Composite anyon coding and the initialization of a topological quantum computer

classification 🪐 quant-ph
keywords compositestateassumptioncomputationquantumsystemtopologicalachieved
0
0 comments X
read the original abstract

Schemes for topological quantum computation are usually based on the assumption that the system is initially prepared in a specific state. In practice, this state preparation is expected to be challenging as it involves non-topological operations which heavily depend on the experimental realization and are not naturally robust against noise. Here we show that this assumption can be relaxed by using composite anyons: starting from an unknown state with reasonable physical properties, it is possible to efficiently distill suitable initial states for computation purely by braiding. This is achieved by encoding logical information in a subsystem code with gauge system corresponding to the internal degrees of freedom of composite objects.

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.