English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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

Matching Game for Optimized Association in Quantum Communication Networks