  The one-way quantum computing model introduced by Raussendorf and Briegel
[Phys. Rev. Lett. 86 (22), 5188-5191 (2001)] shows that it is possible to
quantum compute using only a fixed entangled resource known as a cluster state,
and adaptive single-qubit measurements. This model is the basis for several
practical proposals for quantum computation, including a promising proposal for
optical quantum computation based on cluster states [M. A. Nielsen,
arXiv:quant-ph/0402005, accepted to appear in Phys. Rev. Lett.]. A significant
open question is whether such proposals are scalable in the presence of
physically realistic noise. In this paper we prove two threshold theorems which
show that scalable fault-tolerant quantum computation may be achieved in
implementations based on cluster states, provided the noise in the
implementations is below some constant threshold value. Our first threshold
theorem applies to a class of implementations in which entangling gates are
applied deterministically, but with a small amount of noise. We expect this
threshold to be applicable in a wide variety of physical systems. Our second
threshold theorem is specifically adapted to proposals such as the optical
cluster-state proposal, in which non-deterministic entangling gates are used. A
critical technical component of our proofs is two powerful theorems which
relate the properties of noisy unitary operations restricted to act on a
subspace of state space to extensions of those operations acting on the entire
state space.
