Routing and Spectrum Allocation in Broadband Quantum Entanglement Distribution
<|reference_start|>Routing and Spectrum Allocation in Broadband Quantum Entanglement Distribution: We investigate resource allocation for quantum entanglement distribution over an optical network. We characterize and model a network architecture that employs a single quasi-deterministic time-frequency heralded Einstein-Podolsky-Rosen (EPR) pair source, and develop a routing scheme for distributing entangled photon pairs over such a network. We focus on max-min fairness in entanglement distribution and compare the performance of various spectrum allocation schemes by examining the max-min and median number of EPR-pairs assigned by them, and the Jain index associated with this assignment. Since this presents an NP-hard problem, we identify two approximation algorithms that outperform others in minimum and mean EPR-pair rate distribution and are comparable to others in the Jain index. We also analyze how the network size and connectivity affect these metrics using Watts-Strogatz random graphs. We find that a spectrum allocation approach that achieves high minimum EPR-pair rate can perform significantly worse when the median EPR-pair rate, Jain index, and runtimes are considered.<|reference_end|>
@article{bali2024routing,
    title={Routing and Spectrum Allocation in Broadband Quantum Entanglement
  Distribution},
    author={Rohan Bali, Ashley N. Tittelbaugh, Shelbi L. Jenkins, Anuj Agrawal,
  Jerry Horgan, Marco Ruffini, Daniel C. Kilper, Boulat A. Bash},
    journal={arXiv preprint arXiv:2404.08744},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.08744},
    primaryClass={cs.NI cs.ET quant-ph}
}