pith. sign in

arxiv: 1008.2048 · v2 · pith:BAP2MEHGnew · submitted 2010-08-12 · 🪐 quant-ph

Topological One-Way Quantum Computation on Verified Logical Cluster States

classification 🪐 quant-ph
keywords computationclusterclustersone-waystartopologicalverificationfault-tolerant
0
0 comments X
read the original abstract

We present a scheme to improve the noise threshold for the fault-tolerant topological one-way computation with a constant overhead. Certain cluster states of finite size, say star clusters, are constructed with logical qubits through an efficient verification process to achieve high fidelity. Then, the star clusters are connected near-deterministically with verification to form a three-dimensional cluster state to implement the topological one-way computation. The necessary postselection for verification is localized within the star clusters, ensuring the salability of computation. This scheme works with a high error rate $ \sim 1 % $ and reasonable resources comparable to or less than those for the other fault-tolerant schemes, suggesting potentially a noise threshold higher than 5%.

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.