We introduce an architecture for robust and scalable quantum computation
using both stationary qubits (e.g. single photon sources made out of trapped
atoms, molecules, ions, quantum dots, or defect centers in solids) and flying
qubits (e.g. photons). Our scheme solves some of the most pressing problems in
existing non-hybrid proposals, which include the difficulty of scaling
conventional stationary qubit approaches, and the lack of practical means for
storing single photons in linear optics setups. We combine elements of two
previous proposals for distributed quantum computing, namely the efficient
photon-loss tolerant build up of cluster states by Barrett and Kok [Phys. Rev.
A 71, 060310(R) (2005)] with the idea of Repeat-Until-Success (RUS) quantum
computing by Lim et al. [Phys. Rev. Lett. 95, 030505 (2005)]. This idea can be
used to perform eventually deterministic two-qubit logic gates on spatially
separated stationary qubits via photon pair measurements. Under non-ideal
conditions, where photon loss is a possibility, the resulting gates can still
be used to build graph states for one-way quantum computing. In this paper, we
describe the RUS method, present possible experimental realizations, and
analyse the generation of graph states.Comment: 14 pages, 7 figures, minor changes, references and a discussion on
the effect of photon dark counts adde