Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

New Journal of Physics

A repeat-until-success quantum computing scheme

Almut Beige, Y. L. Lim, L. C. Kwek

Published Jun 29, 2007• 10 citations
Publisher

Abstract

Recently we proposed a hybrid architecture for quantum computing based on stationary and flying qubits: the repeat-until-success (RUS) quantum computing scheme. The scheme is largely implementation independent. Despite the incompleteness theorem for optical Bell-state measurements in any linear optics set-up, it allows for the implementation of a deterministic entangling gate between distant qubits. Here we review this distributed quantum computation scheme, which is ideally suited for integrated quantum computation and communication purposes.

DOI
10.1088/1367-2630/9/6/197

Related papers

Hybrid quantum computation based on repeat-until-success scheme

L. C. Kwek, Xun‐Li Feng

In this paper, we focus on a hybrid quantum computing architecture using stationary qubits inside an optical cavity and flying qubits (photons). It has been shown that direct qubit–qubit interactions for two-qubit gate implementations can be replaced by the experimentally less demanding generation of single photons on demand and linear optics photon pair measurements. The outcomes of these measurements indicate either the completion of the gate or the presence of the original qubits such that the operation can be repeated until success.

Journal of Physics A Mathematical and Theoretical•Jun 27, 2007•0 citations

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

Yuan Liang Lim, S. D. Barrett, Almut Beige +2 more

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.

arXiv:quant-ph/0508218•Physical Review A•Jan 9, 2006•138 citations

Repeat-until-success distributed quantum computation by using single-photon interference at a beam splitter

Xun‐Li Feng, Jun Qian, L. C. Kwek +1 more

A repeat-until-success (RUS) measurement-based scheme for the implementation of the distributed quantum computation by using single-photon interference at a 50:50 beam splitter is proposed. It is shown that the 50:50 beam splitter can naturally project a suitably encoded matter-photon state to either a desired entangling gate-operated state of the matter qubits or to their initial state when the photon is detected. The recurrence of the initial state permits us to implement the desired entangling gate in a RUS way. To implement a distributed quantum computation we suggest an encoding method by means of the effect of dipole-induced transparency proposed recently [E. Waks and J. Vuckovic, Phys. Rev. Lett. 96, 153601 (2006)]. The effects of the unfavorable factors on our scheme are also discussed.

Physical Review A•Jul 28, 2008•4 citations

CLUSTER STATE QUANTUM COMPUTATION AND THE REPEAT-UNTIL-SUCCESS SCHEME

L. C. Kwek

Cluster state computation or the one way quantum computation (1WQC) relies on an initially highly entangled state (called a cluster state) and an appropriate sequence of single qubit measurements along different directions, together with feed-forward based on the measurement results, to realize a quantum computation process. The final result of the computation is obtained by measuring the last remaining qubits in the computational basis. In this short tutorial on cluster state quantum computation, we will also describe the basic ideas of a cluster state and proceed to describe how a single qubit operation can be done on a cluster state. Recently, we proposed a repeat-until-success (RUS) scheme that could effectively be used to realize one-way quantum computer on a hybrid system of photons and atoms. We will briefly describe this RUS scheme and show how it can be used to entangled two distant stationary qubits.

International Journal of Modern Physics B•Jan 20, 2008•1 citation

Repeat-Until-Success Linear Optics Distributed Quantum Computing

Yuan Liang Lim, Almut Beige, L. C. Kwek

We demonstrate the possibility to perform distributed quantum computing using only single-photon sources (atom-cavity-like systems), linear optics, and photon detectors. The qubits are encoded in stable ground states of the sources. To implement a universal two-qubit gate, two photons should be generated simultaneously and pass through a linear optics network, where a measurement is performed on them. Gate operations can be repeated until a success is heralded without destroying the qubits at any stage of the operation. In contrast with other schemes, this does not require explicit qubit-qubit interactions, a priori entangled ancillas, nor the feeding of photons into photon sources.

arXiv:quant-ph/0408043•Physical Review Letters•Jul 13, 2005•268 citations

The hybrid quantum computer

L. C. Kwek, Y. L. Lim, Chunfeng Wu +6 more

In this paper, we look at the possibility of realizing one-way quantum computing through a hybrid quantum computing architecture based on stationary qubits inside an optical cavity and flying qubits (photons). It has been shown that direct qubit-qubit interactions for two-qubit gate implementations can be replaced by the experimentally less demanding generation of single photons on demand and linear optics photon pair measurements. The outcomes of these measurements indicate either the completion of the gate or the presence of the original qubits, such that the operation can be repeated until success.

Laser Physics•Aug 1, 2007•0 citations
Recently we proposed a hybrid architecture for quantum computing based on stationary and flying qubits: the repeat-until-success (RUS) quantum computing scheme. The scheme is largely implementation independent. Despite the incompleteness theorem for optical Bell-state measurements in any linear optics set-up, it allows for the implementation of a deterministic entangling gate between distant qubits. Here we review this distributed quantum computation scheme, which is ideally suited for integrated quantum computation and communication purposes.
In this paper, we focus on a hybrid quantum computing architecture using stationary qubits inside an optical cavity and flying qubits (photons). It has been shown that direct qubit–qubit interactions for two-qubit gate implementations can be replaced by the experimentally less demanding generation of single photons on demand and linear optics photon pair measurements. The outcomes of these measurements indicate either the completion of the gate or the presence of the original qubits such that the operation can be repeated until success.
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.
A repeat-until-success (RUS) measurement-based scheme for the implementation of the distributed quantum computation by using single-photon interference at a 50:50 beam splitter is proposed. It is shown that the 50:50 beam splitter can naturally project a suitably encoded matter-photon state to either a desired entangling gate-operated state of the matter qubits or to their initial state when the photon is detected. The recurrence of the initial state permits us to implement the desired entangling gate in a RUS way. To implement a distributed quantum computation we suggest an encoding method by means of the effect of dipole-induced transparency proposed recently [E. Waks and J. Vuckovic, Phys. Rev. Lett. 96, 153601 (2006)]. The effects of the unfavorable factors on our scheme are also discussed.
Cluster state computation or the one way quantum computation (1WQC) relies on an initially highly entangled state (called a cluster state) and an appropriate sequence of single qubit measurements along different directions, together with feed-forward based on the measurement results, to realize a quantum computation process. The final result of the computation is obtained by measuring the last remaining qubits in the computational basis. In this short tutorial on cluster state quantum computation, we will also describe the basic ideas of a cluster state and proceed to describe how a single qubit operation can be done on a cluster state. Recently, we proposed a repeat-until-success (RUS) scheme that could effectively be used to realize one-way quantum computer on a hybrid system of photons and atoms. We will briefly describe this RUS scheme and show how it can be used to entangled two distant stationary qubits.
We demonstrate the possibility to perform distributed quantum computing using only single-photon sources (atom-cavity-like systems), linear optics, and photon detectors. The qubits are encoded in stable ground states of the sources. To implement a universal two-qubit gate, two photons should be generated simultaneously and pass through a linear optics network, where a measurement is performed on them. Gate operations can be repeated until a success is heralded without destroying the qubits at any stage of the operation. In contrast with other schemes, this does not require explicit qubit-qubit interactions, a priori entangled ancillas, nor the feeding of photons into photon sources.
In this paper, we look at the possibility of realizing one-way quantum computing through a hybrid quantum computing architecture based on stationary qubits inside an optical cavity and flying qubits (photons). It has been shown that direct qubit-qubit interactions for two-qubit gate implementations can be replaced by the experimentally less demanding generation of single photons on demand and linear optics photon pair measurements. The outcomes of these measurements indicate either the completion of the gate or the presence of the original qubits, such that the operation can be repeated until success.