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

Journal of Physics A Mathematical and Theoretical

Hybrid quantum computation based on repeat-until-success scheme

L. C. Kwek, Xun‐Li Feng

Published Jun 27, 2007• 0 citations
Publisher

Abstract

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.

DOI
10.1088/1751-8113/40/28/s21

Related papers

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

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

A repeat-until-success quantum computing scheme

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

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.

New Journal of Physics•Jun 29, 2007•10 citations

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

Investigating Photonic Quantum Computation

Casey R. Myers

The use of photons as qubits is a promising implementation for quantum computation. The inability of photons to interact, especially with the environment, makes them an ideal physical candidate. However, this also makes them a difficult system to perform two qubit gates on. Recent breakthroughs in photonic quantum computing have shown methods around the requirement of direct photon-photon interaction. In this thesis we study three recently discovered schemes for optical quantum computation. \n \n We first investigate the so called linear optical quantum computing (LOQC) scheme, exploring a method to improve the original proposal by constructing a photon-number QND detector that succeeds with a high probability. In doing this we present a new type of LOQC teleporter, one that can detect the presence of a single photon in an arbitrary polarisation state when the input state is a sum of vacuum and multi-photon terms. This new type of teleporter is an improvement on the original scheme in that the entangled states required can be made offline with fewer entangling operations. \n \n We next investigate the so called quantum bus (qubus) scheme for photonic quantum computing. We show a scheme to measure the party of n qubit states by using a single qubus mode, controlled rotations and displacements. This allows for the syndrome measurements of any stabilizer quantum error correcting code. We extend these results to a fault tolerant scheme to measure an arbitrary Pauli operator of weight n, incorporating so called single bit teleportations. We investigate the construction of a Toffoli gate by using a single qubus mode, controlled rotations and displacements that works with a success probability of at least 25%. We also investigate the use of single bit teleportations to construct a universal set of gates on coherent state type logic and in the construction of cluster states. \n \nWe finally investigate the optical Zeno gate, a gate that uses the Zeno effect in the form of two photon absorbers to induce a CSIGN. We model realistic two photon absorption and include realistic single photon loss for this gate, examining the use of encoding to overcome the single photon loss, showing that our results are competitive with the leading equivalent LOQC scheme.

•Sep 28, 2007•0 citations

Quantum logic gates based on off-resonant cavity-assisted interaction between three-level atoms and single photons

M Akbari, S N Andrianov, А. А. Калачев

Abstract A scheme for implementing quantum gates on the basis of a hybrid system that consists of flying photons and a stationary three-level atom interacting with each other in a microring resonator is developed. By employing the Schrieffer–Wolf transformation, it is shown that various two-qubit gates can be implemented under conditions of dispersive interaction without the need for orthogonal Λ structure of optical transitions. As a promising system for implementation, NV centers are considered.

Laser Physics•Jun 22, 2017•2 citations
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.
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.
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.
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.
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.
The use of photons as qubits is a promising implementation for quantum computation. The inability of photons to interact, especially with the environment, makes them an ideal physical candidate. However, this also makes them a difficult system to perform two qubit gates on. Recent breakthroughs in photonic quantum computing have shown methods around the requirement of direct photon-photon interaction. In this thesis we study three recently discovered schemes for optical quantum computation. \n \n We first investigate the so called linear optical quantum computing (LOQC) scheme, exploring a method to improve the original proposal by constructing a photon-number QND detector that succeeds with a high probability. In doing this we present a new type of LOQC teleporter, one that can detect the presence of a single photon in an arbitrary polarisation state when the input state is a sum of vacuum and multi-photon terms. This new type of teleporter is an improvement on the original scheme in that the entangled states required can be made offline with fewer entangling operations. \n \n We next investigate the so called quantum bus (qubus) scheme for photonic quantum computing. We show a scheme to measure the party of n qubit states by using a single qubus mode, controlled rotations and displacements. This allows for the syndrome measurements of any stabilizer quantum error correcting code. We extend these results to a fault tolerant scheme to measure an arbitrary Pauli operator of weight n, incorporating so called single bit teleportations. We investigate the construction of a Toffoli gate by using a single qubus mode, controlled rotations and displacements that works with a success probability of at least 25%. We also investigate the use of single bit teleportations to construct a universal set of gates on coherent state type logic and in the construction of cluster states. \n \nWe finally investigate the optical Zeno gate, a gate that uses the Zeno effect in the form of two photon absorbers to induce a CSIGN. We model realistic two photon absorption and include realistic single photon loss for this gate, examining the use of encoding to overcome the single photon loss, showing that our results are competitive with the leading equivalent LOQC scheme.
Abstract A scheme for implementing quantum gates on the basis of a hybrid system that consists of flying photons and a stationary three-level atom interacting with each other in a microring resonator is developed. By employing the Schrieffer–Wolf transformation, it is shown that various two-qubit gates can be implemented under conditions of dispersive interaction without the need for orthogonal Λ structure of optical transitions. As a promising system for implementation, NV centers are considered.