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

Abstract

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.

Published paper together with Sup. Info in one document

References in corpus (10)

• Surface codes: Towards practical large-scale quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Towards fault-tolerant quantum computing with trapped ions
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Distributed Quantum Computation Based-on Small Quantum Registers
• Prospects for measurement-based quantum computing with solid state spins
• Surface code with decoherence: An analysis of three superconducting architectures
• Distributed quantum information processing with minimal local resources
• Practicality of spin chain 'wiring' in diamond quantum technologies
• Purification of large bicolorable graph states