Quick Navigation
Topics
Trapped Ion Quantum Computing
Efficient nuclear spin - photon entanglement with optical routing
arXiv
Authors: Javid Javadzade, Majid Zahedian, Florian Kaiser, Vadim Vorobyov, Jörg Wrachtrup
Year
2024
Paper ID
64629
Status
Preprint
Abstract Read
~2 min
Abstract Words
171
Citations
N/A
Abstract
Quantum networks and distributed quantum computers rely on entanglement generation between photons and long-lived quantum memories. For large-scale architectures, one of the most crucial parameters is the efficiency at which entanglement can be created and detected. Here, we maximize the efficiency for the detection of hybrid entanglement between a nuclear spin qubit in diamond with a photonic time-bin qubit. Our approach relies on an optimal implementation of the photonic qubit analyzer, for which we use a high-speed electro-optic deflector to direct photons deterministically along the optimal interferometer paths. This way, we completely eliminate all cases in which photons are randomly lost due to the propagation in the wrong interferometer path. In this first demonstration experiment, we use nitrogen-vacancy center in diamond, for which we immediately demonstrate the presence of the entanglement. An extension to other spin-photon entanglement systems is straightforward. Further, our scheme can be used in the framework of quantum repeater networks, including spectral and temporal multiplexing strategies. Our results thus pave the way for the future high-performance quantum networks.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2024 reference point for readers tracking recent quantum research.
- Quantum networks and distributed quantum computers rely on entanglement generation between photons and long-lived quantum memories.
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.