You are not logged in to this journal. Log in    |   Subscription Information

Phys. Rev. A 73, 012304 (2006) [14 pages]

Repeat-until-success quantum computing using stationary and flying qubits

Yuan Liang Lim,1 Sean D. Barrett,2 Almut Beige,1 Pieter Kok,2 and Leong Chuan Kwek3,4
1Blackett Laboratory, Imperial College London, Prince Consort Road, London SW7 2BZ, United Kingdom
2Hewlett-Packard Laboratories, Filton Road, Stoke Gifford, Bristol BS34 8QZ, United Kingdom
3National Institute of Education, Nanyang Technological University, Singapore 63 9798, Singapore
4Department of Physics, National University of Singapore, Singapore 11 7542, Singapore

Received 29 August 2005; published 9 January 2006

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.

©2006 The American Physical Society

URL: http://link.aps.org/doi/10.1103/PhysRevA.73.012304
DOI: 10.1103/PhysRevA.73.012304
PACS: 03.67.Lx; 42.50.Dv
  • 03.67.Lx
    Quantum computation
  • 42.50.Dv
    Nonclassical states of the electromagnetic field, including entangled photon states; quantum state engineering and measurements
  • YEAR: 2006
KEYWORDS: quantum computing, graph theory

REFERENCES (84)

For access to fully linked references, you need to log in. For access to fully linked references, you need to Log in.

CITING ARTICLES

For access to citing articles, you need to log in.
For access to citing articles, you need to Log in.



A new free weekly publication from APS

Physics - A new free weekly publication from APS
Please visit physics.aps.org
 
Article Tools