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

Laser Physics

The hybrid quantum computer

L. C. Kwek, Y. L. Lim, Chunfeng Wu, Jiale Chen, X. Liu, Xun‐Li Feng, D. M. Tong, Keng Wah Choo, C. H. Oh

Published Aug 1, 2007• 0 citations
Publisher

Abstract

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.

DOI
10.1134/s1054660x07080129

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

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

Quantum computing without qubit-qubit interactions

Almut Beige

Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed. However, finding a really scalable and robust quantum computing architecture remains a challenge for both, experimentalists and theoreticians. In most setups decoherence becomes non-negligible when one tries to perform entangling gate operations using the coherent control of qubit-qubit interactions. However, in this proceedings we show that two-qubit gate operations can be implemented even without qubit-qubit interactions and review a recent quantum computing scheme by Lim et al. [Phys. Rev. Lett. 95, 030505 (2005)] using only single photon sources (e.g. atom-cavity systems, NV colour centres or quantum dots) and photon pair measurements.

arXiv:cond-mat/0512121•Dec 6, 2005•1 citation

Quantum Computing: Linear Optics Implementations

Pål Sundsøy, Egil Fjeldberg

One of the main problems that optical quantum computing has to overcome is the efficient construction of two-photon gates. Theoretically these gates can be realized using Kerr-nonlinearities, but the techniques involved are experimentally very difficult. We therefore employ linear optics with projective measurements to generate these non-linearities. The downside is that the measurement-induced nonlinearities achieved with linear optics are less versatile and the success rate can be quite low. This project is mainly the result of a literature study but also a theoretical work on the physics behind quantum optical multiports which is essential for realizing two-photon gates. By applying different postcorrection techniques we increase the probability of success in a modifed non-linear sign shift gate which is foundational for the two photon controlled-NOT gate. We prove that it's not possible to correct the states by only using a single beam splitter. We show that it might be possible to increase the probability of success using a more complex setup with at least two error-correcting beam splitters.

arXiv:1607.03935•Jul 13, 2016•2 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

Linear optical quantum computing with photonic qubits

Pieter Kok, William J. Munro, Kae Nemoto +3 more

Linear optics with photon counting is a prominent candidate for practical quantum computing. The protocol by Knill, Laflamme, and Milburn [2001, Nature (London) 409, 46] explicitly demonstrates that efficient scalable quantum computing with single photons, linear optical elements, and projective measurements is possible. Subsequently, several improvements on this protocol have started to bridge the gap between theoretical scalability and practical implementation. The original theory and its improvements are reviewed, and a few examples of experimental two-qubit gates are given. The use of realistic components, the errors they induce in the computation, and how these errors can be corrected is discussed.

arXiv:quant-ph/0512071•Reviews of Modern Physics•Jan 24, 2007•2,840 citations
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.
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.
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.
Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed. However, finding a really scalable and robust quantum computing architecture remains a challenge for both, experimentalists and theoreticians. In most setups decoherence becomes non-negligible when one tries to perform entangling gate operations using the coherent control of qubit-qubit interactions. However, in this proceedings we show that two-qubit gate operations can be implemented even without qubit-qubit interactions and review a recent quantum computing scheme by Lim et al. [Phys. Rev. Lett. 95, 030505 (2005)] using only single photon sources (e.g. atom-cavity systems, NV colour centres or quantum dots) and photon pair measurements.
One of the main problems that optical quantum computing has to overcome is the efficient construction of two-photon gates. Theoretically these gates can be realized using Kerr-nonlinearities, but the techniques involved are experimentally very difficult. We therefore employ linear optics with projective measurements to generate these non-linearities. The downside is that the measurement-induced nonlinearities achieved with linear optics are less versatile and the success rate can be quite low. This project is mainly the result of a literature study but also a theoretical work on the physics behind quantum optical multiports which is essential for realizing two-photon gates. By applying different postcorrection techniques we increase the probability of success in a modifed non-linear sign shift gate which is foundational for the two photon controlled-NOT gate. We prove that it's not possible to correct the states by only using a single beam splitter. We show that it might be possible to increase the probability of success using a more complex setup with at least two error-correcting beam splitters.
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.
Linear optics with photon counting is a prominent candidate for practical quantum computing. The protocol by Knill, Laflamme, and Milburn [2001, Nature (London) 409, 46] explicitly demonstrates that efficient scalable quantum computing with single photons, linear optical elements, and projective measurements is possible. Subsequently, several improvements on this protocol have started to bridge the gap between theoretical scalability and practical implementation. The original theory and its improvements are reviewed, and a few examples of experimental two-qubit gates are given. The use of realistic components, the errors they induce in the computation, and how these errors can be corrected is discussed.