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

arXiv:2104.00945 · Physical Review A

Requirements for fault-tolerant quantum computation with cavity-QED-based atom-atom gates mediated by a photon with a finite pulse length

Rui Asaoka, Yuuki Tokunaga, Rina Kanamoto, Hayato Goto, Takao Aoki

Published Oct 7, 2021• 8 citations
arXivHTMLPDF

Abstract

We analyze the requirements for fault-tolerant quantum computation with atom-atom gates based on cavity quantum electrodynamics (cQED) mediated by a photon with a finite pulse length. For short photon pulses, the distorted shape of the reflected pulses from the cQED system is a serious error source. In the previous study by Goto and Ichimura [Phys. Rev. A 82, 032311 (2010)], only the photon loss is minimized without considering the shape distortion to optimize the system parameters. Here we show an improved optimization method to minimize the infidelity due to the shape distortion and the photon losses in a well-balanced manner for the fault-tolerant scheme using probabilistic gates [Phys. Rev. A 80, 040303(R) (2009)]. Under this optimization, we discuss the fault-tolerant quantum computing requirement for short pulses. Finally, we show that reducing the cavity length is an effective way to reduce the errors of this type of gate in the case of short photon pulses.

DOI
10.1103/physreva.104.043702

Related papers

Optimal cavity design for minimizing errors in cavity-QED-based atom-photon entangling gates with finite temporal duration

Takeru Utsugi, Rui Asaoka, Yuuki Tokunaga +1 more

The authors present an optimal cavity design for atom-photon entangling gates based on cavity quantum electrodynamics, considering finite photon-pulse duration. By minimizing both the photon loss probability and the error rate due to temporal mode mismatch, they suggest that a cavity has an optimal length for the atom-photon gate, providing a guideline for implementing quantum information processing.

arXiv:2211.04151•Physical Review A•Jan 23, 2025•5 citations

Condition for fault-tolerant quantum computation with a cavity-QED scheme

Hayato Goto, Kouichi Ichimura

A condition for fault-tolerant quantum computation (FTQC) with cavity schemes is discussed. It is shown that the condition is very hard if the standard error threshold of FTQC is simply applied. To relax the condition, we propose to combine the cavity-quantum-electrodynamics (QED) scheme proposed by Duan et al. [Phys. Rev. A 72, 032333 (2005)] and Xiao et al. [Phys. Rev. A 70, 042314 (2004)] with the recently proposed FTQC scheme with probabilistic two-qubit gates [Goto and Ichimura, Phys. Rev. A 80, 040303(R) (2009)]. It is shown that the condition for FTQC is dramatically relaxed compared to the case of the standard threshold. The optimization of the cavity-QED scheme is also discussed.

Physical Review A•Sep 10, 2010•17 citations

Blueprint for a fault-tolerant compound photon-atom quantum architecture

Geva Arwas, Doron Azoury, Daniel Azses +11 more

Fault-tolerant quantum computing requires architectures that simultaneously address scalability, connectivity, and error correction under realistic noise constraints. We present a compound photonic-atomic quantum computing platform that uses cavity QED to realize near-deterministic entangling operations between flying photonic qubits and stationary atomic qubits. Photons provide long-range connectivity and scalability via measurement-based quantum computing (MBQC), while atoms supply reusable, near-deterministic resources for photon generation and entanglement, overcoming the inefficiency of purely photonic platforms. The core primitive is a symmetrized Duan-Kimble photon-atom controlled-phase (CZ) gate, robust to experimental imperfections and high-fidelity. Using single $^{87}$Rb atoms coupled to optical cavities, we give protocols for state preparation, measurement, photon generation, and entangling gates on tens-of-nanosecond timescales, and show how large-scale cluster states with effectively unrestricted connectivity and reduced overhead can be generated through atomic reuse. We analyze fault tolerance on the Raussendorf-Harrington-Goyal (RHG) lattice with a hardware-aware noise model capturing asymmetric loss and correlated photonic-atomic errors. Logical memory simulations yield a photon-loss threshold near $2.6\%$ per physical gate ($\sim$15\% total per trajectory). The full Clifford set -- Hadamard, phase, CNOT -- is implementable transversally or fold-transversally at thresholds matching the identity channel, and we propose two non-Clifford resource-state routes (code teleportation and magic state cultivation) within the foliated cluster-state architecture.

quant-pharXiv:2606.30385•Jun 30, 2026•0 citations

Suitable fault-tolerant schemes for cavity-QED-based quantum computation

Rui Asaoka, Yuuki Tokunaga, Rina Kanamoto +3 more

We show that the requirement for fault-tolerant quantum computation based on cavity-QED is dramatically relaxed by applying the suitable fault-tolerant schemes and gate error optimization for chosen two-qubit gate method.

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Jan 1, 2020•1 citation

Optimization of a cavity-QED system for fast two-qubit gates

Rui Asaoka, Takeru Utsugi, Yuuki Tokunaga +2 more

Cavity quantum electrodynamics (cQED) enables deterministic controlled gates between neutral atom and photon qubits, such as the controlled phase flip (CPF) gate [1] , which is a key component for implementing quantum computation. The gate fidelity drops sharply when the length of an input-photon pulse is shorter than the inverse of the bandwidth of a cavity, because of the distortion of the output pulse. This limits the operational speed of the gates. One way to boost the limit of gate speed may be to reduce cavity length, since this increases the bandwidth of the cavity with keeping high cooperativity [2] .

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 21, 2021•1 citation

Fault-tolerant logical state construction based on cavity-QED network

Rui Asaoka, Yasunari Suzuki, Yuuki Tokunaga

Exploring an efficient and scalable architecture of fault-tolerant quantum computing (FTQC) is vital for demonstrating useful quantum computing. Here, we propose and evaluate a scalable and practical architecture with a cavity-quantum-electrodynamics (CQED) network. Our architecture takes advantage of the stability of neutral atoms and the flexibility of a CQED network. We show a concrete framework for implementing surface codes and numerically analyze the logical error rate and threshold values beyond the simplified circuit-level noise model on several network structures. Although the requirement of CQED parameters is demanding given the current performance of experimental systems, we show that an error-decoding algorithm tailored to our proposed architecture, where the loss information of ancillary photons is utilized, greatly improves the error threshold. For example, the internal cooperativity, a good figure of merit of the cavity performance for quantum computing, required for FTQC is relaxed to 1/5 compared to the normal error-decoding for the surface code. Since our proposal and results can be extended to other LDPC codes straightforwardly, our approach will lead to achieve more reliable FTQC using CQED.

arXiv:2503.11500•Mar 14, 2025•0 citations
We analyze the requirements for fault-tolerant quantum computation with atom-atom gates based on cavity quantum electrodynamics (cQED) mediated by a photon with a finite pulse length. For short photon pulses, the distorted shape of the reflected pulses from the cQED system is a serious error source. In the previous study by Goto and Ichimura [Phys. Rev. A 82, 032311 (2010)], only the photon loss is minimized without considering the shape distortion to optimize the system parameters. Here we show an improved optimization method to minimize the infidelity due to the shape distortion and the photon losses in a well-balanced manner for the fault-tolerant scheme using probabilistic gates [Phys. Rev. A 80, 040303(R) (2009)]. Under this optimization, we discuss the fault-tolerant quantum computing requirement for short pulses. Finally, we show that reducing the cavity length is an effective way to reduce the errors of this type of gate in the case of short photon pulses.
A condition for fault-tolerant quantum computation (FTQC) with cavity schemes is discussed. It is shown that the condition is very hard if the standard error threshold of FTQC is simply applied. To relax the condition, we propose to combine the cavity-quantum-electrodynamics (QED) scheme proposed by Duan et al. [Phys. Rev. A 72, 032333 (2005)] and Xiao et al. [Phys. Rev. A 70, 042314 (2004)] with the recently proposed FTQC scheme with probabilistic two-qubit gates [Goto and Ichimura, Phys. Rev. A 80, 040303(R) (2009)]. It is shown that the condition for FTQC is dramatically relaxed compared to the case of the standard threshold. The optimization of the cavity-QED scheme is also discussed.
Fault-tolerant quantum computing requires architectures that simultaneously address scalability, connectivity, and error correction under realistic noise constraints. We present a compound photonic-atomic quantum computing platform that uses cavity QED to realize near-deterministic entangling operations between flying photonic qubits and stationary atomic qubits. Photons provide long-range connectivity and scalability via measurement-based quantum computing (MBQC), while atoms supply reusable, near-deterministic resources for photon generation and entanglement, overcoming the inefficiency of purely photonic platforms. The core primitive is a symmetrized Duan-Kimble photon-atom controlled-phase (CZ) gate, robust to experimental imperfections and high-fidelity. Using single 87^{87}87Rb atoms coupled to optical cavities, we give protocols for state preparation, measurement, photon generation, and entangling gates on tens-of-nanosecond timescales, and show how large-scale cluster states with effectively unrestricted connectivity and reduced overhead can be generated through atomic reuse. We analyze fault tolerance on the Raussendorf-Harrington-Goyal (RHG) lattice with a hardware-aware noise model capturing asymmetric loss and correlated photonic-atomic errors. Logical memory simulations yield a photon-loss threshold near 2.6%2.6\%2.6% per physical gate ($\sim$15\% total per trajectory). The full Clifford set -- Hadamard, phase, CNOT -- is implementable transversally or fold-transversally at thresholds matching the identity channel, and we propose two non-Clifford resource-state routes (code teleportation and magic state cultivation) within the foliated cluster-state architecture.
Cavity quantum electrodynamics (cQED) enables deterministic controlled gates between neutral atom and photon qubits, such as the controlled phase flip (CPF) gate [1] , which is a key component for implementing quantum computation. The gate fidelity drops sharply when the length of an input-photon pulse is shorter than the inverse of the bandwidth of a cavity, because of the distortion of the output pulse. This limits the operational speed of the gates. One way to boost the limit of gate speed may be to reduce cavity length, since this increases the bandwidth of the cavity with keeping high cooperativity [2] .
Exploring an efficient and scalable architecture of fault-tolerant quantum computing (FTQC) is vital for demonstrating useful quantum computing. Here, we propose and evaluate a scalable and practical architecture with a cavity-quantum-electrodynamics (CQED) network. Our architecture takes advantage of the stability of neutral atoms and the flexibility of a CQED network. We show a concrete framework for implementing surface codes and numerically analyze the logical error rate and threshold values beyond the simplified circuit-level noise model on several network structures. Although the requirement of CQED parameters is demanding given the current performance of experimental systems, we show that an error-decoding algorithm tailored to our proposed architecture, where the loss information of ancillary photons is utilized, greatly improves the error threshold. For example, the internal cooperativity, a good figure of merit of the cavity performance for quantum computing, required for FTQC is relaxed to 1/5 compared to the normal error-decoding for the surface code. Since our proposal and results can be extended to other LDPC codes straightforwardly, our approach will lead to achieve more reliable FTQC using CQED.