Topological quantum computing with a very noisy network and local error rates approaching one percent

A scalable quantum computer could be built by networking together many simple processor cells, thus avoiding the need to create a single complex structure. The difficulty is that realistic quantum links are very error prone. A solution is for cells to repeatedly communicate with each other and so purify any imperfections; however prior studies suggest that the cells themselves must then have prohibitively low internal error rates. Here we describe a method by which even error-prone cells can perform purification: groups of cells generate shared resource states, which then enable stabilization of topologically encoded data. Given a realistically noisy network (≥10% error rate) we find that our protocol can succeed provided that intra-cell error rates for initialisation, state manipulation and measurement are below 0.82%. This level of fidelity is already achievable in several laboratory systems.

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

[2]  Austin G. Fowler,et al.  Surface code with decoherence: An analysis of three superconducting architectures , 2012, 1210.5799.

[3]  R. Blatt,et al.  Towards fault-tolerant quantum computing with trapped ions , 2008, 0803.2798.

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

[5]  Masato Koashi,et al.  A distributed architecture for scalable quantum computation with realistically noisy devices , 2012, 1202.6588.

[6]  W Dür,et al.  Entanglement purification for quantum computation. , 2003, Physical review letters.

[7]  J. Cirac,et al.  Room-Temperature Quantum Bit Memory Exceeding One Second , 2012, Science.

[8]  Earl T. Campbell,et al.  Distributed quantum-information processing with minimal local resources , 2007, 0704.1464.

[9]  Jacob M. Taylor,et al.  Distributed Quantum Computation Based-on Small Quantum Registers , 2007, 0709.4539.

[10]  M. L. W. Thewalt,et al.  Quantum Information Storage for over 180 s Using Donor Spins in a 28Si “Semiconductor Vacuum” , 2012, Science.

[11]  D. Matsukevich,et al.  Entanglement of single-atom quantum bits at a distance , 2007, Nature.

[12]  Jason M. Smith,et al.  Prospects for measurement‐based quantum computing with solid state spins , 2009, 0901.3092.

[13]  Ying Li,et al.  High threshold distributed quantum computing with three-qubit nodes , 2012, 1204.0443.

[14]  M. Mariantoni,et al.  Surface codes: Towards practical large-scale quantum computation , 2012, 1208.0928.

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

[16]  R. Raussendorf,et al.  Purification of large bicolorable graph states , 2006, quant-ph/0605228.

[17]  Simon C Benjamin,et al.  Practicality of spin chain wiring in diamond quantum technologies. , 2013, Physical review letters.

[18]  A. V. Gorshkov,et al.  Scalable architecture for a room temperature solid-state quantum information processor , 2010, Nature Communications.

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

[20]  Katsuji Yamamoto,et al.  Entanglement purification with double selection , 2008, 0811.2639.

[21]  Austin G. Fowler,et al.  Surface code quantum computing by lattice surgery , 2011, 1111.4022.

[22]  Vladimir Kolmogorov,et al.  Blossom V: a new implementation of a minimum cost perfect matching algorithm , 2009, Math. Program. Comput..

[23]  M. Markham,et al.  Heralded entanglement between solid-state qubits separated by three metres , 2012, Nature.

[24]  Helmut G. Katzgraber,et al.  Strong resilience of topological codes to depolarization , 2012, 1202.1852.

[25]  C. Monroe,et al.  Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects , 2012, 1208.0391.

[26]  Hannes Bernien,et al.  Heralded entanglement between solid-state qubits separated by 3 meters , 2013 .