Matching Game for Optimized Association in Quantum Communication Networks

by   Mahdi Chehimi, et al.

Enabling quantum switches (QSs) to serve requests submitted by quantum end nodes in quantum communication networks (QCNs) is a challenging problem due to the heterogeneous fidelity requirements of the submitted requests and the limited resources of the QCN. Effectively determining which requests are served by a given QS is fundamental to foster developments in practical QCN applications, like quantum data centers. However, the state-of-the-art on QS operation has overlooked this association problem, and it mainly focused on QCNs with a single QS. In this paper, the request-QS association problem in QCNs is formulated as a matching game that captures the limited QCN resources, heterogeneous application-specific fidelity requirements, and scheduling of the different QS operations. To solve this game, a swap-stable request-QS association (RQSA) algorithm is proposed while considering partial QCN information availability. Extensive simulations are conducted to validate the effectiveness of the proposed RQSA algorithm. Simulation results show that the proposed RQSA algorithm achieves a near-optimal (within 5 terms of the percentage of served requests and overall achieved fidelity, while outperforming benchmark greedy solutions by over 13 RQSA algorithm is shown to be scalable and maintain its near-optimal performance even when the size of the QCN increases.


ESDI: Entanglement Scheduling and Distribution in the Quantum Internet

Quantum entanglement distribution between remote nodes is key to many pr...

Early Acceptance Matching Game for User Association in 5G Cellular HetNet

In this paper we examine the use of matching theory for user association...

Fidelity-Guarantee Entanglement Routing in Quantum Networks

Entanglement routing establishes remote entanglement connection between ...

Multi-sided Matching for the Association of Space-Air-Ground Integrated Systems

Space-air-ground integrated networks (SAGINs) will play a key role in 6G...

Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis

Inspired by quantum switches, we consider a discrete-time multi-way matc...

Scalable Quantum Repeater Deployment Modeling

Long-distance quantum communication presents a significant challenge as ...

Please sign up or login with your details

Forgot password? Click here to reset