Comment on “Efficient high-fidelity quantum computation using matter qubits and linear optics”

Recently Barrett and Kok proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. Here I argue that their strategy considerably underrates the power and utility of their EO. By viewing their EO as a graph fusion event, one perceives that each successful event introduces an ideal redundant graph edge, which growth strategies should exploit. For example, if each EO succeeds with probability p≳0.4 then a highly connected graph can be formed with an overhead of only about ten EO attempts per graph edge. The Barrett and Kok (BK) scheme then becomes competitive with the more elaborate entanglement procedures designed to permit p to approach unity [Phys. Rev. Lett. 95, 030505 (2005)].