[2025.4]Author Note:

• We will provide the code of this work on SimQN simulator recently from QNLab, please pay attention or contact me if you are interested.

Fidelity-Guaranteed Entanglement Routing in Quantum Networks

• Simulation code for routing algorithms: Q-PATH and Q-LEAP
• Please refer to the publication "Li J, Wang M, Xue K, et al. Fidelity-guaranteed entanglement routing in quantum networks[J]. IEEE Transactions on Communications, 2022, 70(10): 6748-6763." PDF Link
• Please cite this work if you adopt our open-source code:

@article{li2022fidelity,
title={Fidelity-guaranteed entanglement routing in quantum networks},
author={Li, Jian and Wang, Mingjun and Xue, Kaiping and Li, Ruidong and Yu, Nenghai and Sun, Qibin and Lu, Jun},
journal={IEEE Transactions on Communications},
volume={70},
number={10},
pages={6748--6763},
year={2022},
publisher={IEEE}
}

Usage Note:

Run simulation.py

#simulation1 : Single S-D pair scenairos vs. Fidelity Threshold

#simulation2 : Single S-D pair scenairos vs. Channel Capacity

#simulation3 : Multiple S-D pair scenairos vs. Fidelity Threshold

#simulation4 : Multiple S-D pair scenairos vs. Channel Capacity

#simulation5 : Performance Comparison vs. Number of S-D Pairs

Notation:

Q-PATH: alg1

Q-LEAP: alg2

Hopspf: shortpathfirst