Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Quantum Computing and Engineering (QCE)

QUBO Formulation for Task Offloading in Mobile Cloud Computing

Annika Daspal, Olivia Das

Published Aug 30, 2025• 1 citation
Publisher

Abstract

The execution of delay-sensitive mobile applications on an end-user mobile device is challenging due to its resource limitations. To improve application execution time, one can offload its compute-intensive tasks from the device to cloud servers. Still, communication delay between hosts (device and servers) can increase execution time. This calls for finding an optimal allocation of tasks across hosts that minimizes execution time. Finding an optimal task allocation is an NP-hard optimization problem. In this work, we formulate a novel QUBO for task offloading. We then demonstrate its use by applying QAOA on an example workflow, and our best allocation obtained matches that of the exhaustive approach. Here, we aim to provide insight as to how task offloading can be approached using quantum methodology.

DOI
10.1109/qce65121.2025.10367

Related papers

QAOA-Based Dependency-Aware Task Offloading in Vehicular Edge Computing

Mamta Kumari, Mayukh Sarkar, Rohit Kumar Nonia

As the number of interdependent tasks increases, the problem of task offloading in vehicular edge computing (VEC) networks becomes more challenging due to limited resources at the nodes. This paper addresses the dependency-aware task offloading problem by framing it as a Quadratic Unconstrained Binary Optimization (QUBO) problem. The model incorporates factors such as computational delays, transmission latencies, and inter-task communication costs, linking these variables to an Ising Hamiltonian for processing with the Quantum Approximate Optimization Algorithm (QAOA). This hybrid approach, combining both quantum and classical methods, offers an efficient means of exploring potential solutions. Experimental results indicate that the end-to-end delay was reduced by 54.9% compared to purely local execution, all while satisfying the constraints of node capacity using the QAOA method.

IEEE International Conference on Instrumentation (INSTCon)•Jul 1, 2026•0 citations

Towards quantum-ready optimization: A QUBO model for task assignment to autonomous mobile robots

Ole Christian Prüfer, Jens Heger

Autonomous Mobile Robots (AMRs) play an increasingly important role in flexible and reconfigurable production systems. Assigning heterogeneous tasks to multiple AMRs constitutes a combinatorial optimization problem that becomes computationally intractable as system complexity grows. This paper presents a Quadratic Unconstrained Binary Optimization (QUBO) model for AMR task assignment, integrating scheduling and resource allocation within a Hamiltonian formulation. The model is parameterized and evaluated using both exact and heuristic solvers to analyze scalability and validity across benchmark scenarios. Results demonstrate the trade-off between computational effort and solution optimality, confirming the feasibility of the QUBO representation for this problem class. The formulated model creates a basis for future implementation on quantum hardware for optimization using Quantum Annealing (QA) or the Quantum Approximate Optimization Algorithm (QAOA), thereby bridging the gap between classical optimization methods and new quantum computing paradigms.

Procedia CIRP•Jan 1, 2026•0 citations

A Quantum Reinforcement Learning Approach for Joint Resource Allocation and Task Offloading in Mobile Edge Computing

Xinliang Wei, Xitong Gao, Kejiang Ye +2 more

Mobile edge computing (MEC) has revolutionized the way computational tasks are offloaded and latency is reduced by leveraging edge servers close to end devices. Efficient resource allocation and task offloading are crucial for enhancing system performance in MEC environments. Traditional reinforcement learning (RL) approaches have shown promise in optimizing resource allocation and task offloading problems. However, they often face challenges such as high computational complexity and the need for extensive training data. Quantum reinforcement learning (QRL) emerges as a promising solution to overcome these limitations by leveraging quantum computing principles to enhance efficiency and scalability. In this paper, we propose a hybrid quantum-classical non-sequential model for joint resource allocation and task offloading in MEC systems. Our model combines the advantages of RL in handling environmental dynamics and quantum computing in reducing adjustable parameters and accelerating the training process. Extensive experiments demonstrate that our proposed algorithm can achieve higher training and inference performance under various parameter settings compared to traditional RL models and previous QRL models.

IEEE Transactions on Mobile Computing•Nov 13, 2024•25 citations

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 Advances•Jan 28, 2026•0 citations

A System Aware Resource Allocation for Distributed Workflows in Quantum Computing Environments

Abhishek Sawaika, Udaya Parampalli, Rajkumar Buyya

Rapid advancements in cloud based platforms providing access to quantum computing capabilities have opened up several challenges for efficient usage of these highly delicate and costly devices. Although most of the current systems use a priority based access protocol, they are unable to fully support reliable, efficient, and scalable execution of larger-scale applications. To overcome this limitation, we propose a comprehensive solution for efficient allocation of quantum programs to appropriate quantum devices, considering all the relevant cost metrics into account including, fidelity, execution time and communication overhead. We also formulate use-cases for distributed quantum workflow and propose modified graph based algorithms to solve for allocation of such use-cases, assuming a hybrid classical-quantum network. Since hardware advancements in large standalone devices is an ongoing process, it is critical to investigate such distributed workflows to maximize the best utilization of current NISQ devices. Our empirical study shows that the proposed techniques perform better than state-of-the-art methods for almost all evaluation parameters, with average improvements of approximately $5\%$ in execution time, $30\%$ in communication overhead, $40\%$ in wait time and $2\%$ in fidelity, providing better solutions to efficient allocation strategies.

quant-pharXiv:2605.17944•May 19, 2026•0 citations

Resource Allocation Optimization Study of Cloud-Edge-End Collaboration Based on QUBO Model

Liangyu Qin

The core of this article is to construct an effective QUBO model to solve the problem of cloud edge end computing resource allocation, including two key scenarios: optimization of server maximum computing demand coverage and optimization of cloud edge server computing network layout. Each scenario provides a detailed description of the model's process from analysis, establishment to solution, overcoming several major difficulties in establishing a QUBO model, including using binary variables to express the objective function, transforming the objective function into QUBO expressions, and transforming inequality constraints. A scheme for the number of constraint relaxation factors is introduced, which effectively reduces the number of quantum bits and computational complexity. Finally, statistical analysis of the solution results, non parametric testing based on data characteristics, and detailed analysis are conducted, demonstrating the potential application of the QUBO model and quantum computing in dealing with complex combinatorial optimization problems. During the solving process, China's first optical quantum computing power cloud platform and corresponding quantum computing library Kaiwu SDK were utilized for research. Multiple solvers were used and their performance was compared to select the best performing taboo search solver, and then detailed results were calculated. The final results were fully visualized to make them more intuitive. The results indicate that quantum computing can provide an efficient, accurate, and stable solution for cloud edge end computing resource allocation. Through these studies, this article not only confirms the efficiency of quantum computing in solving specific optimization problems, but also provides some experience and reference for exploring the application of quantum computing in a wider field.

IEEE International Conference on Power, Intelligent Computing and Systems (ICPICS)•Jul 26, 2024•0 citations
The execution of delay-sensitive mobile applications on an end-user mobile device is challenging due to its resource limitations. To improve application execution time, one can offload its compute-intensive tasks from the device to cloud servers. Still, communication delay between hosts (device and servers) can increase execution time. This calls for finding an optimal allocation of tasks across hosts that minimizes execution time. Finding an optimal task allocation is an NP-hard optimization problem. In this work, we formulate a novel QUBO for task offloading. We then demonstrate its use by applying QAOA on an example workflow, and our best allocation obtained matches that of the exhaustive approach. Here, we aim to provide insight as to how task offloading can be approached using quantum methodology.
As the number of interdependent tasks increases, the problem of task offloading in vehicular edge computing (VEC) networks becomes more challenging due to limited resources at the nodes. This paper addresses the dependency-aware task offloading problem by framing it as a Quadratic Unconstrained Binary Optimization (QUBO) problem. The model incorporates factors such as computational delays, transmission latencies, and inter-task communication costs, linking these variables to an Ising Hamiltonian for processing with the Quantum Approximate Optimization Algorithm (QAOA). This hybrid approach, combining both quantum and classical methods, offers an efficient means of exploring potential solutions. Experimental results indicate that the end-to-end delay was reduced by 54.9% compared to purely local execution, all while satisfying the constraints of node capacity using the QAOA method.
Autonomous Mobile Robots (AMRs) play an increasingly important role in flexible and reconfigurable production systems. Assigning heterogeneous tasks to multiple AMRs constitutes a combinatorial optimization problem that becomes computationally intractable as system complexity grows. This paper presents a Quadratic Unconstrained Binary Optimization (QUBO) model for AMR task assignment, integrating scheduling and resource allocation within a Hamiltonian formulation. The model is parameterized and evaluated using both exact and heuristic solvers to analyze scalability and validity across benchmark scenarios. Results demonstrate the trade-off between computational effort and solution optimality, confirming the feasibility of the QUBO representation for this problem class. The formulated model creates a basis for future implementation on quantum hardware for optimization using Quantum Annealing (QA) or the Quantum Approximate Optimization Algorithm (QAOA), thereby bridging the gap between classical optimization methods and new quantum computing paradigms.
Mobile edge computing (MEC) has revolutionized the way computational tasks are offloaded and latency is reduced by leveraging edge servers close to end devices. Efficient resource allocation and task offloading are crucial for enhancing system performance in MEC environments. Traditional reinforcement learning (RL) approaches have shown promise in optimizing resource allocation and task offloading problems. However, they often face challenges such as high computational complexity and the need for extensive training data. Quantum reinforcement learning (QRL) emerges as a promising solution to overcome these limitations by leveraging quantum computing principles to enhance efficiency and scalability. In this paper, we propose a hybrid quantum-classical non-sequential model for joint resource allocation and task offloading in MEC systems. Our model combines the advantages of RL in handling environmental dynamics and quantum computing in reducing adjustable parameters and accelerating the training process. Extensive experiments demonstrate that our proposed algorithm can achieve higher training and inference performance under various parameter settings compared to traditional RL models and previous QRL models.
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.
Rapid advancements in cloud based platforms providing access to quantum computing capabilities have opened up several challenges for efficient usage of these highly delicate and costly devices. Although most of the current systems use a priority based access protocol, they are unable to fully support reliable, efficient, and scalable execution of larger-scale applications. To overcome this limitation, we propose a comprehensive solution for efficient allocation of quantum programs to appropriate quantum devices, considering all the relevant cost metrics into account including, fidelity, execution time and communication overhead. We also formulate use-cases for distributed quantum workflow and propose modified graph based algorithms to solve for allocation of such use-cases, assuming a hybrid classical-quantum network. Since hardware advancements in large standalone devices is an ongoing process, it is critical to investigate such distributed workflows to maximize the best utilization of current NISQ devices. Our empirical study shows that the proposed techniques perform better than state-of-the-art methods for almost all evaluation parameters, with average improvements of approximately 5%5\%5% in execution time, 30%30\%30% in communication overhead, 40%40\%40% in wait time and 2%2\%2% in fidelity, providing better solutions to efficient allocation strategies.
The core of this article is to construct an effective QUBO model to solve the problem of cloud edge end computing resource allocation, including two key scenarios: optimization of server maximum computing demand coverage and optimization of cloud edge server computing network layout. Each scenario provides a detailed description of the model's process from analysis, establishment to solution, overcoming several major difficulties in establishing a QUBO model, including using binary variables to express the objective function, transforming the objective function into QUBO expressions, and transforming inequality constraints. A scheme for the number of constraint relaxation factors is introduced, which effectively reduces the number of quantum bits and computational complexity. Finally, statistical analysis of the solution results, non parametric testing based on data characteristics, and detailed analysis are conducted, demonstrating the potential application of the QUBO model and quantum computing in dealing with complex combinatorial optimization problems. During the solving process, China's first optical quantum computing power cloud platform and corresponding quantum computing library Kaiwu SDK were utilized for research. Multiple solvers were used and their performance was compared to select the best performing taboo search solver, and then detailed results were calculated. The final results were fully visualized to make them more intuitive. The results indicate that quantum computing can provide an efficient, accurate, and stable solution for cloud edge end computing resource allocation. Through these studies, this article not only confirms the efficiency of quantum computing in solving specific optimization problems, but also provides some experience and reference for exploring the application of quantum computing in a wider field.