arXiv:2609.21961
Single-atom-based asynchronous photonic interconnect for scalable modular quantum computing
Jérémy Raskop, Nadav Kandel, Geva Arwas, Yaniv Amichy, Yaron Jarach, Tal Kanonich, Andrei Militaru, Johannes Fink, Barak Dayan
Abstract
Scaling quantum computation beyond the capacity of a single quantum processing unit requires quantum interconnects between modular processors. Optical photons are natural carriers for distributing entanglement between these processors. Most loss-resilient protocols use photonic Bell-state measurements based on the linear-optics type-II fusion gate. The resulting entanglement rate scales quadratically with each processor's typically low photon-delivery probability. Here we analyze a memory-assisted quantum interconnect using a near-deterministic, robust photon--atom controlled-$Z$ gate via a single atom trapped in a high-finesse cavity. Detecting and measuring a photon from one processor heralds entanglement between that processor and the atom. This entanglement is preserved while the process repeats with the second processor until the second photon is detected and measured. Reading out the atomic qubit finalizes the entanglement between the processors. As the entanglement is mediated by the atom, the photons from both processors do not need to be indistinguishable, removing a major source of infidelity. Furthermore, by removing the simultaneous photon-arrival requirement, the protocol allows the entanglement rate to scale linearly rather than quadratically with photon-arrival probability over a wide parameter range. We derive entanglement rates under realistic parameters, accounting for decay of the atom's entanglement with the first processor and for decoherence caused by unheralded photon interactions. The nanosecond-scale of the gate and read-out operations leads to orders-of-magnitude entanglement-rate gain over linear optics, removing a key bottleneck in modular quantum computing.
AI Summary
The paper analyzes whether a single midpoint atomic memory can increase remote-entanglement rates when QPUs deliver photons with low probability. It proposes an asynchronous Bell-state measurement using two sequential cavity-reflection photon–atom CZ gates, photonic measurements, and atomic read-out. The first herald establishes a QPU–atom link; the second QPU retries within a finite storage window. The photons need not be mutually indistinguishable, but must match the interface’s resonance and bandwidth. An analytical rate–fidelity model includes stored-link decoherence and dephasing from photons that interact but escape detection. For per-QPU herald probability $q$, attempt rate $R$, and read-out efficiency $\eta_{\rm ro}$, the rate approaches $\Gamma\simeq(2/3)\eta_{\rm ro}qR$ with an unrestricted memory window, rather than quadratic scaling. Finite coherence and post-interaction loss constrain the window; a strict fidelity budget can keep it finite even for arbitrarily long coherence. With 1% photon–atom interaction probability, effective coherence $300\,\mu\mathrm{s}$, detection and read-out efficiencies 0.8, and 5% average memory-induced infidelity, the predicted attempt rate needed for $10^4$ pairs/s is approximately 3.2 MHz, versus 190 MHz for ideal-indistinguishability type-II fusion. Monte Carlo simulations check the model against Gaussian atomic and exponential QPU coherence decay. These are projections, not an experimental demonstration. The implementation assumes a 20 ns CZ gate, 98.4% photon survival, and 98% aggregate preparation/gate/read-out fidelity, separate from the memory-error budget. Input-state errors require additional budgeting; cooling downtime and atom reloading are omitted. Fidelity constraints apply to the accepted ensemble average, not every pair. An extension models transducer-added noise and its conversion-efficiency trade-off.
Error found: The abstract invokes nanosecond-scale atomic read-out without specifying its duration, while the quoted throughput omits explicit read-out overhead and cooling downtime, leaving the fully timed operating rate unestablished.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.