An on-demand resource allocation algorithm for a quantum network hub and its performance analysis

[2405.18066] An on-demand resource allocation algorithm for a quantum network hub and its performance analysis Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Quantum Physics arXiv:2405.18066 (quant-ph) [Submitted on 28 May 2024] Title: An on-demand resource allocation algorithm for a quantum network hub and its performance analysis Authors: Scarlett Gauthier , Thirupathaiah Vasantam , Gayane Vardoyan View a PDF of the paper titled An on-demand resource allocation algorithm for a quantum network hub and its performance analysis, by Scarlett Gauthier and 2 other authors View PDF HTML (experimental) Abstract: To effectively support the execution of quantum network applications for multiple sets of user-controlled quantum nodes, a quantum network must efficiently allocate shared resources. We study traffic models for a type of quantum network hub called an Entanglement Generation Switch (EGS), a device that allocates resources to enable entanglement generation between nodes in response to user-generated demand. We propose an on-demand resource allocation algorithm, where a demand is either blocked if no resources are available or else results in immediate resource allocation. We model the EGS as an Erlang loss system, with demands corresponding to sessions whose arrival is modelled as a Poisson process. To reflect the operation of a practical quantum switch, our model captures scenarios where a resource is allocated for batches of entanglement generation attempts, possibly interleaved with calibration periods for the quantum network nodes. Calibration periods are necessary to correct against drifts or jumps in the physical parameters of a quantum node that occur on a timescale that is long compared to the duration of an attempt. We then derive a formula for the demand blocking probability under three different traffic scenarios using analytical methods from applied probability and queueing theory. We prove an insensitivity theorem which guarantees that the probability a demand is blocked only depends upon the mean duration of each entanglement generation attempt and calibration period, and is not sensitive to the underlying distributions of attempt and calibration period duration. We provide numerical results to support our analysis. Our work is the first analysis of traffic characteristics at an EGS system and provides a valuable analytic tool for devising performance driven resource allocation algorithms. Subjects: Quantum Physics (quant-ph) ; Networking and Internet Architecture (cs.NI); Performance (cs.PF) Cite as: arXiv:2405.18066 [quant-ph] (or arXiv:2405.18066v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2405.18066 Focus to learn more arXiv-issued DOI via DataCite Related DOI : https://doi.org/10.1109/TQE.2025.3641834 Focus to learn more DOI(s) linking to related resources Submission history From: Scarlett Gauthier [ view email ] [v1] Tue, 28 May 2024 11:25:32 UTC (6,068 KB) Full-text links: Access Paper: View a PDF of the paper titled An on-demand resource allocation algorithm for a quantum network hub and its performance analysis, by Scarlett Gauthier and 2 other authors View PDF HTML (experimental) TeX Source view license Current browse context: quant-ph < prev | next > new | recent | 2024-05 Change to browse by: cs cs.NI cs.PF References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• School network reorganization under educational and spatial constraints using classical and quantum optimization#1048345
• Defining Network Capacity#420327
• Adaptive Policies for Resource Generation in a Quantum Network#1036422
• QC-CCG: Quantum-Classical Algorithm for Two-stage Adaptive Robust Optimization#1071023
• The optimal search on graph by continuous-time quantum walks#821630