SimQN: A Network-Layer Simulator for the Quantum Network Investigation

被引:21
作者
Chen, Lutong [1 ]
Xue, Kaiping [1 ]
Li, Jian [1 ]
Yu, Nenghai [1 ]
Li, Ruidong [2 ]
Sun, Qibin [1 ]
Lu, Jun [3 ]
机构
[1] Univ Sci & Technol China, Sch Cyber Sci & Technol, Hefei 230027, Anhui, Peoples R China
[2] Kanazawa Univ, Coll Sci & Engn, Kakuma, Kanazawa 9201192, Japan
[3] Univ Sci & Technol China, Sch Cyber Sci & Technol, Dept Elect Engn & Informat Sci, Hefei 230027, Anhui, Peoples R China
来源
IEEE NETWORK | 2023年 / 37卷 / 05期
关键词
Quantum networks; Qubit; Computational modeling; Protocols; Numerical models; Routing protocols; Relays; Information technology; Quantum state; Discrete-event systems; Discrete event simulation; ENTANGLEMENT;
D O I
10.1109/MNET.130.2200481
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Along with the rapid development of quantum information technologies, quantum networks that transmit quantum states have gradually shifted from laboratory to reality. However, the high cost of building a quantum network testbed seriously hinders the research progress of quantum networks, and the existing simulators have been developed with less exposure to network models. To overcome those deficiencies, this article proposes a new discrete-event driven network-layer simulation framework named SimQN, available at https://github.com/ertuil/SimQN, to provide full functionalities of the quantum networking simulation. The design goal of SimQN is to make it easy-to-configure while providing high performance and accurate simulation capability. We present multiple simulation physical backends to enable different functionalities and reduce computational overhead. The modularized SimQN also provides reusable network protocols and utilities to release the large-scale quantum networking evaluation burden. We present several demonstrations and analyses to illustrate the protocol design and the performance of SimQN.
引用
收藏
页码:182 / 189
页数:8
相关论文
共 14 条
[1]  
Bechmann-Pasquinucci H, 2005, Arxiv, DOI arXiv:quant-ph/0505089
[2]   TELEPORTING AN UNKNOWN QUANTUM STATE VIA DUAL CLASSICAL AND EINSTEIN-PODOLSKY-ROSEN CHANNELS [J].
BENNETT, CH ;
BRASSARD, G ;
CREPEAU, C ;
JOZSA, R ;
PERES, A ;
WOOTTERS, WK .
PHYSICAL REVIEW LETTERS, 1993, 70 (13) :1895-1899
[3]   Purification of noisy entanglement and faithful teleportation via noisy channels [J].
Bennett, CH ;
Brassard, G ;
Popescu, S ;
Schumacher, B ;
Smolin, JA ;
Wootters, WK .
PHYSICAL REVIEW LETTERS, 1996, 76 (05) :722-725
[4]   A Heuristic Remote Entanglement Distribution Algorithm on Memory-Limited Quantum Paths [J].
Chen, Lutong ;
Xue, Kaiping ;
Li, Jian ;
Yu, Nenghai ;
Li, Ruidong ;
Liu, Jianqing ;
Sun, Qibin ;
Lu, Jun .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (11) :7491-7504
[5]   NetSquid, a NETwork Simulator for QUantum Information using Discrete events [J].
Coopmans, Tim ;
Knegjens, Robert ;
Dahlberg, Axel ;
Maier, David ;
Nijsten, Loek ;
de Oliveira Filho, Julio ;
Papendrecht, Martijn ;
Rabbie, Julian ;
Rozpedek, Filip ;
Skrzypczyk, Matthew ;
Wubben, Leon ;
de Jong, Walter ;
Podareanu, Damian ;
Torres-Knoop, Ariana ;
Elkouss, David ;
Wehner, Stephanie .
COMMUNICATIONS PHYSICS, 2021, 4 (01)
[6]   Long-distance entanglement swapping with photons from separated sources [J].
de Riedmatten, H ;
Marcikic, I ;
van Houwelingen, JAW ;
Tittel, W ;
Zbinden, H ;
Gisin, N .
PHYSICAL REVIEW A, 2005, 71 (05)
[7]   Quantum privacy amplification and the security of quantum cryptography over noisy channels [J].
Deutsch, D ;
Ekert, A ;
Jozsa, R ;
Macchiavello, C ;
Popescu, S ;
Sanpera, A .
PHYSICAL REVIEW LETTERS, 1996, 77 (13) :2818-2821
[8]   QuNetSim: A Software Framework for Quantum Networks [J].
Diadamo, Stephen ;
Notzel, Janis ;
Zanger, Benjamin ;
Bese, Mehmet Mert .
IEEE TRANSACTIONS ON QUANTUM ENGINEERING, 2021, 2
[9]  
Li J., 2022, IEEE Transactions on Quantum Engineering, V3, P1
[10]   Connection-Oriented and Connectionless Remote Entanglement Distribution Strategies in Quantum Networks [J].
Li, Zhonghui ;
Xue, Kaiping ;
Li, Jian ;
Yu, Nenghai ;
Wei, David S. L. ;
Li, Ruidong .
IEEE NETWORK, 2022, 36 (06) :150-156