Blueprint for a fault-tolerant compound photon-atom quantum architecture
- URL: http://arxiv.org/abs/2606.30385v1
- Date: Mon, 29 Jun 2026 14:40:27 GMT
- Title: Blueprint for a fault-tolerant compound photon-atom quantum architecture
- Abstract summary: We present a compound photonic-atomic quantum computing platform that uses cavity QED to realize near-deterministic entangling operations.<n> Photons provide long-range connectivity and scalability via measurement-based quantum computing.<n>We show how large-scale cluster states with effectively unrestricted connectivity and reduced overhead can be generated through atomic reuse.
- Score: 26.831715552066694
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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.
Related papers
- Practical blueprint for low-depth photonic quantum computing with quantum dots [0.0]
Fusion-based quantum computing is an attractive model for fault-tolerant computation based on photonics.<n>We propose a complete blueprint for a photonic quantum computer using quantum dots and linear optics.<n>It features time-bin qubit encoding, reconfigurable entangled-photon sources, and a fusion-based architecture with low optical connectivity.
arXiv Detail & Related papers (2025-07-22T01:59:25Z) - Analytical Fidelity Calculations for Photonic Linear Cluster State Generation [4.122012401752171]
We develop an algorithm that tracks the global density matrix through the process of the protocol for generating linear-cluster states.<n>We show that a near-unity entangling gate fidelity as well as near-unity state fidelity for 3-photon and 7-photon linear cluster states can be reached.
arXiv Detail & Related papers (2025-05-16T10:08:37Z) - Tailoring fusion-based photonic quantum computing schemes to quantum emitters [0.0]
Fusion-based quantum computation is a promising quantum computing model where small-sized photonic resource states are simultaneously entangled and measured by fusion gates.<n>Here, we propose fusion-based architectures tailored to the capabilities and noise models in quantum emitters.<n>We show that high tolerance to dominant physical error mechanisms can be achieved, with fault-tolerance thresholds of 8% for photon loss, 4% for photon distinguishability between emitters, and spin noise thresholds well above memory-induced errors.
arXiv Detail & Related papers (2024-10-09T11:31:49Z) - Deterministic generation of concatenated graph codes from quantum emitters [0.0]
Concatenation of a fault-tolerant construction with a code able to efficiently correct loss is a promising approach to achieve this.
We propose schemes for generatingd graph codes using multi-photon emission from two quantum emitters or a single quantum emitter coupled to a memory.
We show that these schemes enable fault-tolerant fusion-based quantum regimes in practical computation with high photon loss and standard fusion gates.
arXiv Detail & Related papers (2024-06-24T14:44:23Z) - Loss-tolerant architecture for quantum computing with quantum emitters [0.0]
We develop an architecture for measurement-based quantum computing using photonic quantum emitters.
We exploit spin-photon entanglement as resource states and standard Bell measurements of photons for fusing them into a large spin-qubit cluster state.
arXiv Detail & Related papers (2023-04-07T18:00:25Z) - QUICK$^3$ -- Design of a satellite-based quantum light source for
quantum communication and extended physical theory tests in space [73.86330563258117]
Single photon source can enhance secure data rates in satellite-based quantum key distribution scenarios.
payload is being integrated into a 3U CubeSat and scheduled for launch in 2024 into low Earth orbit.
arXiv Detail & Related papers (2023-01-26T15:34:11Z) - Simulation of Entanglement Generation between Absorptive Quantum
Memories [56.24769206561207]
We use the open-source Simulator of QUantum Network Communication (SeQUeNCe), developed by our team, to simulate entanglement generation between two atomic frequency comb (AFC) absorptive quantum memories.
We realize the representation of photonic quantum states within truncated Fock spaces in SeQUeNCe.
We observe varying fidelity with SPDC source mean photon number, and varying entanglement generation rate with both mean photon number and memory mode number.
arXiv Detail & Related papers (2022-12-17T05:51:17Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - Multidimensional cluster states using a single spin-photon interface
coupled strongly to an intrinsic nuclear register [48.7576911714538]
Photonic cluster states are a powerful resource for measurement-based quantum computing and loss-tolerant quantum communication.
We propose the generation of multi-dimensional lattice cluster states using a single, efficient spin-photon interface coupled strongly to a nuclear register.
arXiv Detail & Related papers (2021-04-26T14:41:01Z) - Interleaving: Modular architectures for fault-tolerant photonic quantum
computing [50.591267188664666]
Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays.
We present a modular architecture for FBQC in which these components are combined to form "interleaving modules"
Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
arXiv Detail & Related papers (2021-03-15T18:00:06Z) - Hybrid quantum photonics based on artificial atoms placed inside one
hole of a photonic crystal cavity [47.187609203210705]
Hybrid quantum photonics with SiV$-$-containing nanodiamonds inside one hole of a one-dimensional, free-standing, Si$_3$N$_4$-based photonic crystal cavity is presented.
The resulting photon flux is increased by more than a factor of 14 as compared to free-space.
Results mark an important step to realize quantum network nodes based on hybrid quantum photonics with SiV$-$- center in nanodiamonds.
arXiv Detail & Related papers (2020-12-21T17:22:25Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.