arXiv:2210.12343 · IEEE/IFIP Network Operations and Management Symposium (NOMS)

Stochastic Qubit Resource Allocation for Quantum Cloud Computing

Rakpong Kaewpuang, Minrui Xu, Dusit Tao Niyato, Han Yu, Zehui Xiong, Jiawen Kang

Published May 8, 2023• 14 citations

Abstract

Quantum cloud computing is a promising paradigm for efficiently provisioning quantum resources (i.e., qubits) to users. In quantum cloud computing, quantum cloud providers provision quantum resources in reservation and on-demand plans for users. Literally, the cost of quantum resources in the reservation plan is expected to be cheaper than the cost of quantum resources in the on-demand plan. However, quantum resources in the reservation plan have to be reserved in advance without information about the requirement of quantum circuits beforehand, and consequently, the resources are insufficient, i.e., under-reservation. Hence, quantum resources in the on-demand plan can be used to compensate for the unsatisfied quantum resources required. To end this, we propose a quantum resource allocation for the quantum cloud computing system in which quantum resources and the minimum waiting time of quantum circuits are jointly optimized. Particularly, the objective is to minimize the total costs of quantum circuits under uncertainties regarding qubit requirement and minimum waiting time of quantum circuits. In experiments, practical circuits of quantum Fourier transform are applied to evaluate the proposed qubit resource allocation. The results illustrate that the proposed qubit resource allocation can achieve the optimal total costs.

DOI: 10.1109/noms56928.2023.10154430

Related papers

Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing

Rakpong Kaewpuang, Minrui Xu, Dinh Thai Hoang +5 more

Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources, such as quantum computers, to perform resource-intensive tasks. Like traditional cloud computing platforms, QCC providers can offer both reservation and on-demand plans for quantum resource provisioning to satisfy users' requirements. However, the fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. Furthermore, in distributed QCC, entanglement routing is a critical component of quantum networks that enables remote entanglement communication between users and QCC providers. Further, maintaining entanglement fidelity in quantum networks is challenging due to the requirement for high-quality entanglement routing, especially when accessing the providers over long distances. To address these challenges, we propose a resource allocation model to provision quantum computing and networking resources. In particular, entangled pairs, entanglement routing, qubit resources, and circuits' waiting time are jointly optimized to achieve minimum total costs. We formulate the proposed model based on the two-stage stochastic programming, which takes into account the uncertainties of fidelity and qubit requirements, and quantum circuits' waiting time. Furthermore, we apply the Benders decomposition algorithm to divide the proposed model into sub-models to be solved simultaneously. Experimental results demonstrate that our model can achieve the optimal total costs and reduce total costs at most 49.43\% in comparison to the baseline model.

arXiv:2307.13185Jul 25, 20231 citation

Optimal Stochastic Resource Allocation for Distributed Quantum Computing

Napat Ngoenriang, Minrui Xu, Sucha Supittayapornpong +4 more

With the advent of interconnected quantum computers, i.e., distributed quantum computing (DQC), multiple quantum computers can now collaborate via quantum networks to perform massively complex computational tasks. However, DQC faces problems sharing quantum information because it cannot be cloned or duplicated between quantum computers. Thanks to advanced quantum mechanics, quantum computers can teleport quantum information across quantum networks. However, challenges to utilizing efficiently quantum resources, e.g., quantum computers and quantum channels, arise in DQC due to their capabilities and properties, such as uncertain qubit fidelity and quantum channel noise. In this paper, we propose a resource allocation scheme for DQC based on stochastic programming to minimize the total deployment cost for quantum resources. Essentially, the two-stage stochastic programming model is formulated to handle the uncertainty of quantum computing demands, computing power, and fidelity in quantum networks. The performance evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers while minimizing the overall cost of provisioning under uncertainty.

arXiv:2210.02886Sep 16, 20225 citations

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

Bernard Ousmane Sane, Michal Hajdušek, Rodney Van Meter

Quantum cloud computing will play a vital role in achieving quantum supremacy by providing flexible allocation of resources for applications that demand extensive computational power. Such a platform allows various clients to run their quantum jobs (quantum circuits) without managing the quantum hardware and to pay based on resource usage. Therefore, defining optimal quantum resource allocation is essential to prevent overcharging clients and to help quantum cloud providers maximize resource utilization. Our approach involves examining the problem from a game theory perspective. We introduce a quantum circuit partitioning resource allocation game model (QC-PRAGM) designed to minimize client costs and inter-node communication. This is achieved by solving a convex optimization problem that finds the system's optimal cost while maximizing the number of local gates within a partition through the selection of the best qubit combinations. We demonstrate analytically that clients are charged fairly. Additionally, our simulations show that our solutions outperform traditional methods.

arXiv:2504.18298International Conference on Quantum Communications, Networking, and Computing (QCNC)Apr 6, 20261 citation

Quantum–Inspired Resource Optimization for Cloud Computing Environments: A Hybrid Quantum–Classical Framework

N. Purandhar, M. Rajendiran, Ahmed Mudassar +1 more

Cloud computing has fundamentally transformed digital infrastructure by providing on-demand access to scalable computational resources. Yet the inherent unpredictability of workloads alongside surging demands for efficient resource distribution continues to present substantial operational hurdles. This investigation introduces a Quantum-Driven Optimization framework that synergistically combines quantum and classical computational paradigms to improve resource allocation efficacy within cloud ecosystems. The proposed methodology employs Quantum Annealing alongside Variational Quantum Eigensolver algorithms to optimize resource distribution through simultaneous minimization of energy expenditure and operational overhead while maximizing throughput and utilization rates. Empirical validation demonstrates that our framework achieves measurable improvements over conventional heuristic methodologies, specifically showing enhanced resource utilization, reduced operational costs, and accelerated task completion times. The hybrid architecture effectively distributes computational burden by delegating preprocessing and decision-making functions to classical systems while quantum processors tackle inherently complex optimization problems. The solution demonstrates scalability and adaptability across diverse cloud deployment scenarios while exhibiting reduced Service Level Agreement violations, thereby ensuring superior Quality of Service for end-users. This research contributes meaningful insights regarding the practical implementation of hybrid quantum-classical approaches for addressing contemporary resource allocation challenges within cloud computing infrastructures.

CompSci & AI AdvancesJan 28, 20260 citations

A Quantum Optimization Model for Dynamic Resource Allocation in Cloud Computing

Tahir Alyas

Quantum Computing and Cloud Computing technologieshave potential capability to change the dynamic of futurecomputing. Similarly, both Complexities, time and Space are the basicconstraints which can determine the efficient cloud service performance.Quantum optimization for the cloud resources in dynamic environmentprovides a way to deal with the present classical cloud computationmodel’s challenges. By combining the fields of quantum computing andcloud computing, will result in evolutionary technology. Virtual resourceallocation is a major challenge facing cloud computing with dynamiccharacteristics, a single aspect for the evaluation of resource allocationstrategy cannot satisfy the real world demands in this case. QuantumOptimization resource allocation mechanism on the cloud computingenvironment based two-way factors, improving user satisfaction and bestuse of resource utilization of cloud computing systems.A dynamic resource allocation mechanism for cloud services, based onnegotiation by keeping the focus on preferences and pricing factor istherefore proposed.

Lahore Garrison University Research Journal of Computer Science and Information TechnologyMar 31, 20170 citations

Predictive Resource Allocation in Quantum Operating Systems Using Static Circuit Analysis

Tunjay Akbarli

This paper introduces a lightweight predictive resource allocation framework for Quantum Operating Systems in cloud quantum computing. Current platforms often run user-submitted circuits serially on Quantum Processing Units (QPUs), leaving many qubits idle even when smaller circuits could execute in parallel on disjoint partitions. The proposed approach performs static analysis on the transpiled circuit at submission time, extracting three key metrics: qubit count (n), circuit depth (d), and total gate count (g). These metrics enable accurate estimation of each job’s resource needs and predicted execution time without runtime profiling. The framework combines two scheduling strategies: Resource-Aware FCFS (RA-FCFS) with crosstalk-aware bin-packing, which packs compatible circuits into idle qubit fragments while enforcing a minimum separation constraint (δ_sep = 2 edges on heavy-hex topologies) to control ZZ crosstalk and preserve fidelity. Quantum Highest Response Ratio Next (Q-HRRN), a priority policy that prevents starvation of long/deep circuits while maintaining fast response for short jobs. Discrete-event simulations on 27-qubit to 127-qubit heavy-hex devices using VQE, QAOA, and QFT workloads show significant gains: qubit utilization rises from 31–38% (serial baseline) to 79–87%, and average wait times decrease by 1.8× to 3.4×. The crosstalk guard limits additional error-budget to only 3.1%. This low-overhead solution requires no hardware changes and offers a practical path to improve efficiency in NISQ-era quantum cloud services.

Apr 15, 20260 citations