Optimizing Resource Allocation in a Distributed Quantum Computing Cloud: A Game-Theoretic Approach

[2504.18298] Optimizing Resource Allocation in a Distributed Quantum Computing Cloud: A Game-Theoretic Approach Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Quantum Physics arXiv:2504.18298 (quant-ph) [Submitted on 25 Apr 2025 ( v1 ), last revised 11 Apr 2026 (this version, v2)] Title: Optimizing Resource Allocation in a Distributed Quantum Computing Cloud: A Game-Theoretic Approach Authors: Bernard Ousmane Sane , Michal Hajdušek , Rodney Van Meter View a PDF of the paper titled Optimizing Resource Allocation in a Distributed Quantum Computing Cloud: A Game-Theoretic Approach, by Bernard Ousmane Sane and 2 other authors View PDF HTML (experimental) Abstract: Quantum cloud computing is essential for achieving quantum supremacy by utilizing multiple quantum computers connected via an entangling network to deliver high performance for practical applications that require extensive computational resources. With such a platform, various clients can execute their quantum jobs (quantum circuits) without needing to manage the quantum hardware and pay based on resource usage. Hence, defining optimal quantum resource allocation is necessary to avoid overcharging clients and to allow quantum cloud providers to maximize resource utilization. Prior work has mainly focused on minimizing communication delays between nodes using multi-objective techniques. Our approach involves analyzing the problem from a game theory perspective. We propose a quantum circuit partitioning resource allocation game model (QC-PRAGM) that minimizes client costs while maximizing resource utilization in quantum cloud environments. We extend QC-PRAGM to QC-PRAGM++ to maximize local gates in a partition by selecting the best combinations of qubits, thereby minimizing both cost and inter-node communication. We demonstrate analytically that clients are charged appropriately (with a total cost at most $\frac{4}{3}$ the optimal cost) while optimizing quantum cloud resources. Further, our simulations indicate that our solutions perform better than traditional ones in terms of the cost per quantum node, total cost, maximum cost, number of partitions, and number of remote gates. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2504.18298 [quant-ph] (or arXiv:2504.18298v2 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2504.18298 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Bernard Ousmane Sane [ view email ] [v1] Fri, 25 Apr 2025 12:14:14 UTC (4,989 KB) [v2] Sat, 11 Apr 2026 08:08:19 UTC (306 KB) Full-text links: Access Paper: View a PDF of the paper titled Optimizing Resource Allocation in a Distributed Quantum Computing Cloud: A Game-Theoretic Approach, by Bernard Ousmane Sane and 2 other authors View PDF HTML (experimental) TeX Source view license Current browse context: quant-ph < prev | next > new | recent | 2025-04 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

• An End-to-End Threat Model for the Quantum-as-a-Service Pipeline#432457
• The Role of Quantum Computing in Cloud Security#707498
• DreamQAS: Learning a Decision-Useful World Model for VQE-Efficient Quantum Architecture Search#1070898
• A log-depth in-place quantum Fourier transform that rarely needs ancillas#1110088
• Subspace-Confined QAOA with Generalized Dicke States for Multi-Channel Allocation in 5G CBRS Networks#997462