arXiv Analytics

Sign in

arXiv:0912.5150 [quant-ph]AbstractReferencesReviewsResources

Cluster-based architecture for fault-tolerant quantum computation

Keisuke Fujii, Katsuji Yamamoto

Published 2009-12-28Version 1

We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite different way from the usual circuit-based architecture where physical gates are recursively replaced by logical gates with error-correction gadgets. Instead, some relevant cluster states, say fundamental clusters, are recursively constructed through verification and postselection in advance for the higher-level one-way computation, which namely provides error-precorrection of gate operations. A suitable code such as the Steane seven-qubit code is adopted for transversal operations. This concatenated construction of verified fundamental clusters has a simple transversal structure of logical errors, and achieves a high noise threshold ~ 3 % for computation by using appropriate verification procedures. Since the postselection is localized within each fundamental cluster with the help of deterministic bare controlled-Z gates without verification, divergence of resources is restrained, which reconciles postselection with scalability.

Related articles: Most relevant | Search more
arXiv:0712.2084 [quant-ph] (Published 2007-12-13, updated 2008-01-15)
Semi-Clifford operations, structure of $\mathcal{C}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation
arXiv:0809.5063 [quant-ph] (Published 2008-09-30, updated 2008-12-17)
The Fibonacci scheme for fault-tolerant quantum computation
arXiv:0802.4137 [quant-ph] (Published 2008-02-28, updated 2008-06-13)
Fault-tolerant quantum computation in concatenation of verified cluster states