Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Simulation
Hybrid Quantum Repeater Chains with Atom-based Quantum Processing Units and Quantum Memory Multiplexers
arXiv
Authors: Shin Sun, Daniel Bhatti, Shaobo Gao, David Elkouss, Hiroki Takahashi
Year
2025
Paper ID
36234
Status
Preprint
Abstract Read
~2 min
Abstract Words
162
Citations
N/A
Abstract
Quantum repeaters enable the generation of reliable entanglement across long distances despite the underlying channel noise. Nevertheless, realizing quantum repeaters poses a difficult engineering challenge due to various device constraints and design tradeoffs. Herein, we propose and analyze an efficient hybrid quantum repeater design that integrates atom-based quantum processing units, spontaneous parametric down-conversion photon sources, and atomic frequency comb quantum memories. Our design leverages the strong spectro-temporal multiplexing capability of the quantum memory to enable high-rate elementary-link entanglement generation between repeater nodes. Transferring the photonic entanglement into matter-qubit entanglement, together with deterministic quantum operations, further enables reliable long-distance entanglement distribution. We analyze photon-loss channels in the hybrid architecture and propose suitable error-suppression strategies that are natively incorporated into our repeater protocol. Using numerical simulations, we demonstrate the advantages of our hybrid design for end-to-end secret key rates in a linear repeater-chain model. With continued advances in relevant hardware technologies, we envision that the proposed hybrid design is well-suited for large-scale quantum networks.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- Quantum repeaters enable the generation of reliable entanglement across long distances despite the underlying channel noise.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.