Multi-Entanglement Routing Design over Quantum Networks

TL;DR

This paper addresses the challenge of designing efficient multi-routing entanglement protocols in quantum networks by formulating the problem as integer programming and proposing algorithms that outperform existing solutions.

Contribution

It introduces a novel integer programming formulation for quantum entanglement routing and provides efficient algorithms with performance analysis.

Findings

Our algorithms increase the number of quantum-user pairs served.

They improve the network's expected throughput.

They outperform existing solutions in key metrics.

Abstract

Quantum networks are considered as a promising future platform for quantum information exchange and quantum applications, which have capabilities far beyond the traditional communication networks. Remote quantum entanglement is an essential component of a quantum network. How to efficiently design a multi-routing entanglement protocol is a fundamental yet challenging problem. In this paper, we study a quantum entanglement routing problem to simultaneously maximize the number of quantum-user pairs and their expected throughput. Our approach is to formulate the problem as two sequential integer programming steps. We propose efficient entanglement routing algorithms for the two integer programming steps and analyze their time complexity and performance bounds. Results of evaluation highlight that our approach outperforms existing solutions in both served quantum-user pairs numbers and the network expected throughput.