Please use this identifier to cite or link to this item:
Repeat-until-success quantum computing using stationary and flying qubits
Issue Date: 
Lim, Y. L., Barrett, S. D., Beige, A., Kok, P., & Kwek, L. C. (2006). Repeat-until-success quantum computing using stationary and flying qubits. Physical Review A, 73(1), 012304.
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 nonhybrid 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 nonideal 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 analyze the generation of graph states.
1094-1622 (online)
1050-2947 (print)
Other Identifiers: 
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
PRA-73-1-012304.pdf260.91 kBAdobe PDFView/Open
Show full item record

Page view(s) 50

checked on Feb 22, 2019

Download(s) 20

checked on Feb 22, 2019