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

Repeat-Until-Success Cubic Phase Gate

Kevin Marshall, Raphael C. Pooser, George Siopsis, Christian Weedbrook

Published Jan 1, 2015• 0 citations
Publisher

Abstract

Here we introduce an experimentally viable ‘repeat-until-success’ implementation of the cubic phase gate, required for universal quantum computation, using sequential photon subtractions. Our scheme offers benefits in the expected time until success, although we require a primitive quantum memory.
DOI
10.1364/cleo_qels.2015.ftu4a.8

Related papers

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

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

All-optical quantum computing using cubic phase gates

Niklas Budinger, Akira Furusawa, Peter van Loock

If suitable quantum optical interactions were available, transforming the field mode operators in a nonlinear fashion, the all-photonics platform could be one of the strongest contenders for realizing a quantum computer. While single-photon qubits may be processed directly, “brighter” logical qubits may be embedded in individual oscillator modes, using so-called bosonic codes, for an in-principle fault-tolerant processing. In this paper, we show how elements of all-optical, universal, and fault-tolerant quantum computation can be implemented using only beam splitters together with single-mode cubic phase gates in reasonable numbers, and possibly off-line squeezed-state or single-photon resources. Our approach is based on a decomposition technique combining exact gate decompositions and approximate Trotterization. This allows for efficient decompositions of certain nonlinear continuous-variable multimode gates into the elementary gates, where the few cubic gates needed may even be weak or all identical, thus facilitating potential experiments. The final gate operations include two-mode controlled phase rotation and three-mode Rabi-type Hamiltonian gates, which are shown to be employable for realizing high-fidelity single-photon two-qubit entangling gates or creating high-quality Gottesman-Kitaev-Preskill states. We expect our method to be of general use with various applications, including those that rely on quartic Kerr-type interactions. Published by the American Physical Society 2024

arXiv:2211.09060•Physical Review Research•Jun 28, 2024•30 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

A Proposal for Nonlinear - Optics Based Quantum Gates in Integrated Photonic Circuits

A. L. Aguayo-Alvarado, A. Acevedo-Carrera, Francisco A. Domínguez-Serna +2 more

A proposal for the implementation of single-qubit quantum gates based on a third order nonlinear process in integrated quantum circuits is presented.

Frontiers in Optics•Jan 1, 2020•2 citations

Repeat-until-success cubic phase gate for universal continuous-variable quantum computation

Kevin Marshall, Raphael C. Pooser, George Siopsis +1 more

To achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very difficult to implement in practice. Here we introduce an experimentally viable ``repeat-until-success'' approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations. We find that our scheme offers benefits in terms of the expected time until success, as well as the fact that we do not require any complex off-line resource state, although we require a primitive quantum memory.

arXiv:1412.0336•Physical Review A•Mar 24, 2015•78 citations
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 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.
If suitable quantum optical interactions were available, transforming the field mode operators in a nonlinear fashion, the all-photonics platform could be one of the strongest contenders for realizing a quantum computer. While single-photon qubits may be processed directly, “brighter” logical qubits may be embedded in individual oscillator modes, using so-called bosonic codes, for an in-principle fault-tolerant processing. In this paper, we show how elements of all-optical, universal, and fault-tolerant quantum computation can be implemented using only beam splitters together with single-mode cubic phase gates in reasonable numbers, and possibly off-line squeezed-state or single-photon resources. Our approach is based on a decomposition technique combining exact gate decompositions and approximate Trotterization. This allows for efficient decompositions of certain nonlinear continuous-variable multimode gates into the elementary gates, where the few cubic gates needed may even be weak or all identical, thus facilitating potential experiments. The final gate operations include two-mode controlled phase rotation and three-mode Rabi-type Hamiltonian gates, which are shown to be employable for realizing high-fidelity single-photon two-qubit entangling gates or creating high-quality Gottesman-Kitaev-Preskill states. We expect our method to be of general use with various applications, including those that rely on quartic Kerr-type interactions. Published by the American Physical Society 2024
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.
To achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very difficult to implement in practice. Here we introduce an experimentally viable ``repeat-until-success'' approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations. We find that our scheme offers benefits in terms of the expected time until success, as well as the fact that we do not require any complex off-line resource state, although we require a primitive quantum memory.