Keisuke Fujii, Katsuji Yamamoto
Published 2008-02-28, updated 2008-06-13Version 2
A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery operation, where a suitable code such as the Steane's 7-qubit code is adopted for transversal operations. This simple concatenated construction of verified cluster states achieves a high noise threshold ~1%, and restrains the divergence of resources.
Comments: 4 pages, 5 figures. v2:improved version
Journal: AIP Conf. Proc. 1110, 141 (2009)
Cluster-based architecture for fault-tolerant quantum computation
The Fibonacci scheme for fault-tolerant quantum computation
Semi-Clifford operations, structure of $\mathcal{C}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation
![QR code for arXiv:0802.4137 [quant-ph]](http://oss.arxitics.com/images/favicon.svg)