A Multiple-Entanglement Routing Framework for Quantum Networks

TL;DR

This paper introduces a novel multiple-entanglement routing framework for quantum networks, proposing two algorithms to improve reliability and traffic flexibility, validated through realistic simulations.

Contribution

It presents the first framework for k-entangled routing in quantum networks and develops two algorithms to optimize entanglement distribution.

Findings

Algorithms significantly improve traffic flexibility.

Simulation results validate effectiveness of proposed methods.

Framework lays foundation for future entanglement routing research.

Abstract

Quantum networks are gaining momentum in finding applications in a wide range of domains. However, little research has investigated the potential of a quantum network framework to enable highly reliable communications. The goal of this work is to investigate and design the multiple-entanglement routing framework, namely k-entangled routing. In particular, the $k$-entangled routing will enable k paths connecting all demands (source-destination pairs) in the network. To design the $k$-entangled routing, we propose two algorithms that are called Sequential Multi-path Scheduling Algorithm and Min-Cut-based Multi-path Scheduling Algorithm. In addition, we evaluate the performance of the proposed algorithms and models through a realistic quantum network simulator, NetSquid, that models the stochastic processes underlying quantum communications. The results show that the proposed algorithms (SMPSA and MCSA) largely enhance the network's traffic flexibility. The proposed paradigms would lay the foundation for further research on the area of entanglement routing.