In this thesis, we describe the one-way quantum computer [Formula: see text], a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the [Formula: see text], describe the underlying computational model and demonstrate that the [Formula: see text] can be operated fault-tolerantly. In Sec. 2, we show that the [Formula: see text] can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model — the common model of quantum computation. We also indicate that the description of the [Formula: see text] as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the [Formula: see text], which is very different from the quantum logic network model. The [Formula: see text] has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of [Formula: see text] quantum algorithms. Further, all information that is processed with the [Formula: see text] is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The [Formula: see text] is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the [Formula: see text]. Further, we outline the concept of checksums in the context of the [Formula: see text], which may become an element in future practical and adequate methods for fault-tolerant [Formula: see text] computation.
Toward a Faster Fault Tolerant Consensus to Maintain Data Consistency in Collaborative Environments