Scalable Timing Coordination of Bell State Analyzers in Quantum Networks
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915114907598848 |
|---|---|
| author | Mori, Yoshihiro Sasaki, Toshihiko Ikuta, Rikizo Teramoto, Kentaro Ohno, Hiroyuki Hajdušek, Michal Van Meter, Rodney Nagayama, Shota |
| author_facet | Mori, Yoshihiro Sasaki, Toshihiko Ikuta, Rikizo Teramoto, Kentaro Ohno, Hiroyuki Hajdušek, Michal Van Meter, Rodney Nagayama, Shota |
| contents | The optical Bell State Analyzer (BSA) plays a key role in the optical generation of entanglement in quantum networks. The optical BSA is effective in controlling the timing of arriving photons to achieve interference. It is unclear whether timing synchronization is possible even in multi-hop and complex large-scale networks, and if so, how efficient it is. We investigate the scalability of BSA synchronization mechanisms over multiple hops for quantum networks both with and without memory in each node. We first focus on the exchange of entanglement between two network nodes via a BSA, especially effective methods of optical path coordination in achieving the simultaneous arrival of photons at the BSA. In optical memoryless quantum networks, including repeater graph state networks, we see that the quantum optical path coordination works well, though some possible timing coordination mechanisms have effects that cascade to adjacent links and beyond, some of which was not going to work well of timing coordination. We also discuss the effect of quantum memory, given that end-to-end extension of entangled states through multi-node entanglement exchange is essential for the practical application of quantum networks. Finally, cycles of all-optical links in the network topology are shown to may not be to synchronize, this property should be taken into account when considering synchronization in large networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_09881 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Scalable Timing Coordination of Bell State Analyzers in Quantum Networks Mori, Yoshihiro Sasaki, Toshihiko Ikuta, Rikizo Teramoto, Kentaro Ohno, Hiroyuki Hajdušek, Michal Van Meter, Rodney Nagayama, Shota Quantum Physics Networking and Internet Architecture The optical Bell State Analyzer (BSA) plays a key role in the optical generation of entanglement in quantum networks. The optical BSA is effective in controlling the timing of arriving photons to achieve interference. It is unclear whether timing synchronization is possible even in multi-hop and complex large-scale networks, and if so, how efficient it is. We investigate the scalability of BSA synchronization mechanisms over multiple hops for quantum networks both with and without memory in each node. We first focus on the exchange of entanglement between two network nodes via a BSA, especially effective methods of optical path coordination in achieving the simultaneous arrival of photons at the BSA. In optical memoryless quantum networks, including repeater graph state networks, we see that the quantum optical path coordination works well, though some possible timing coordination mechanisms have effects that cascade to adjacent links and beyond, some of which was not going to work well of timing coordination. We also discuss the effect of quantum memory, given that end-to-end extension of entangled states through multi-node entanglement exchange is essential for the practical application of quantum networks. Finally, cycles of all-optical links in the network topology are shown to may not be to synchronize, this property should be taken into account when considering synchronization in large networks. |
| title | Scalable Timing Coordination of Bell State Analyzers in Quantum Networks |
| topic | Quantum Physics Networking and Internet Architecture |
| url | https://arxiv.org/abs/2405.09881 |