115 research outputs found
Postselection threshold against biased noise
The highest current estimates for the amount of noise a quantum computer can
tolerate are based on fault-tolerance schemes relying heavily on postselecting
on no detected errors. However, there has been no proof that these schemes give
even a positive tolerable noise threshold. A technique to prove a positive
threshold, for probabilistic noise models, is presented. The main idea is to
maintain strong control over the distribution of errors in the quantum state at
all times. This distribution has correlations which conceivably could grow out
of control with postselection. But in fact, the error distribution can be
written as a mixture of nearby distributions each satisfying strong
independence properties, so there are no correlations for postselection to
amplify.Comment: 13 pages, FOCS 2006; conference versio
Quantum computation with Turaev-Viro codes
The Turaev-Viro invariant for a closed 3-manifold is defined as the
contraction of a certain tensor network. The tensors correspond to tetrahedra
in a triangulation of the manifold, with values determined by a fixed spherical
category. For a manifold with boundary, the tensor network has free indices
that can be associated to qudits, and its contraction gives the coefficients of
a quantum error-correcting code. The code has local stabilizers determined by
Levin and Wen. For example, applied to the genus-one handlebody using the Z_2
category, this construction yields the well-known toric code.
For other categories, such as the Fibonacci category, the construction
realizes a non-abelian anyon model over a discrete lattice. By studying braid
group representations acting on equivalence classes of colored ribbon graphs
embedded in a punctured sphere, we identify the anyons, and give a simple
recipe for mapping fusion basis states of the doubled category to ribbon
graphs. We explain how suitable initial states can be prepared efficiently, how
to implement braids, by successively changing the triangulation using a fixed
five-qudit local unitary gate, and how to measure the topological charge.
Combined with known universality results for anyonic systems, this provides a
large family of schemes for quantum computation based on local deformations of
stabilizer codes. These schemes may serve as a starting point for developing
fault-tolerance schemes using continuous stabilizer measurements and active
error-correction.Comment: 53 pages, LaTeX + 199 eps figure
- …