S C Benjamin et al 2005 New J. Phys. 7 194 doi:10.1088/1367-2630/7/1/194
S C Benjamin1, J Eisert2,3 and T M Stace4
Show affiliationsWe present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple three-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph-state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph-state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus.
03.67.Lx Quantum computation architectures and implementations
42.50.Dv Quantum state engineering and measurements
03.67.Mn Entanglement measures, witnesses, and other characterizations
Issue 1 (September 2005)
Received 21 June 2005
Published 16 September 2005
S C Benjamin et al 2005 New J. Phys. 7 194
Chui-Ping Yang et al 2002 J. Opt. B: Quantum Semiclass. Opt. 4 256
V Chawla et al 1994 Smart Mater. Struct. 3 107
Susumu Goto and J C Vassilicos 2004 New J. Phys. 6 65
Nigel Davies et al 1999 Distrib. Syst. Engng. 6 1
Michael Mussinger et al 2000 New J. Phys. 2 19
Nien Fan Zhang 2006 Metrologia 43 195
Bruno Dumant et al 1999 Distrib. Syst. Engng. 6 3
J Hietarinta et al 1994 J. Phys. A: Math. Gen. 27 3149
Changsong Zhou and Jürgen Kurths 2005 New J. Phys. 7 18