Error Correction for Non-Abelian Topological Quantum Computation

The possibility of quantum computation using non-Abelian anyons has been considered for over a decade. However, the question of how to obtain and process information about what errors have occurred in order to negate their effects has not yet been considered. This is in stark contrast with quantum computation proposals for Abelian anyons, for which decoding algorithms have been tailor-made for many topological error-correcting codes and error models. Here, we address this issue by considering the properties of non-Abelian error correction, in general. We also choose a specific anyon model and error model to probe the problem in more detail. The anyon model is the charge submodel of D(S-3). This shares many properties with important models such as the Fibonacci anyons, making our method more generally applicable. The error model is a straight forward generalization of those used in the case of Abelian anyons for initial benchmarking of error correction methods. It is found that error correction is possible under a threshold value of 7% for the total probability of an error on each physical spin. This is remarkably comparable with the thresholds for Abelian models.

[1]  Jiannis K. Pachos,et al.  Universal Quantum Computation with a Non-Abelian Topological Memory , 2009, TCQ.

[2]  Austin G. Fowler,et al.  Optimal complexity correction of correlated errors in the surface code , 2013, 1310.0863.

[3]  Eric Dennis Purifying Quantum States: Quantum and Classical Algorithms , 2005 .

[4]  Adam C. Whiteside,et al.  Towards practical classical processing for the surface code: Timing analysis , 2012, 1202.5602.

[5]  Carlos Mochon Anyon computers with smaller groups , 2004 .

[6]  J. Preskill,et al.  Topological quantum memory , 2001, quant-ph/0110143.

[7]  Matthias Troyer,et al.  A Short Introduction to Fibonacci Anyon Models , 2008, 0902.3275.

[8]  Jiannis K. Pachos,et al.  Engineering complex topological memories from simple Abelian models , 2009, 0908.0708.

[9]  Robert Raussendorf,et al.  Fault-tolerant quantum computation with high threshold in two dimensions. , 2007, Physical review letters.

[10]  David Poulin,et al.  Kitaev's Z_d-Codes Threshold Estimates , 2013, TQC.

[11]  Jiannis K. Pachos,et al.  Introduction to Topological Quantum Computation , 2012 .

[12]  James R. Wootton Quantum memories and error correction , 2012, 1210.3207.

[13]  G. K. Brennen,et al.  Non-locality of non-Abelian anyons , 2008, 0810.4319.

[14]  Sergey Bravyi Universal quantum computation with the v=5/2 fractional quantum Hall state , 2006 .

[15]  James R. Wootton,et al.  Enhanced thermal stability of the toric code through coupling to a bosonic bath , 2013, 1309.0621.

[16]  R. Lathe Phd by thesis , 1988, Nature.

[17]  S. Bravyi,et al.  Quantum self-correction in the 3D cubic code model. , 2013, Physical review letters.

[18]  James R. Wootton,et al.  Efficient Markov chain Monte Carlo algorithm for the surface code , 2013, 1302.2669.

[19]  Salman Beigi,et al.  The Quantum Double Model with Boundary: Condensations and Symmetries , 2010, 1006.5479.

[20]  Sergey Bravyi,et al.  Simulation of rare events in quantum error correction , 2013, 1308.6270.

[21]  L. Landau Fault-tolerant quantum computation by anyons , 2003 .

[22]  J. Cirac,et al.  Simulations of quantum double models , 2009, 0901.1345.

[23]  James R. Wootton,et al.  High threshold error correction for the surface code. , 2012, Physical review letters.

[24]  A. G. Fowler,et al.  Threshold error rates for the toric and surface codes , 2009, 0905.0531.

[25]  David Poulin,et al.  Fast decoders for topological quantum codes. , 2009, Physical review letters.

[26]  James R. Wootton A Simple Decoder for Topological Codes , 2013, Entropy.

[27]  James R. Wootton Topological phases and self-correcting memories in interacting anyon systems , 2013, 1305.1808.

[28]  Alexei Kitaev,et al.  Anyons in an exactly solved model and beyond , 2005, cond-mat/0506438.