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

arXiv:2504.08134

Hybrid Reinforcement Learning-based Sustainable Multi-User Computation Offloading for Mobile Edge-Quantum Computing

Minrui Xu, Dusit Tao Niyato, Jiawen Kang, Zehui Xiong, Mingzhe Chen, Dong In Kim, Xuemin, Xuemin Shen

Published Apr 10, 2025• 0 citations
arXivHTMLPDF

Abstract

Exploiting quantum computing at the mobile edge holds immense potential for facilitating large-scale network design, processing multimodal data, optimizing resource management, and enhancing network security. In this paper, we propose a pioneering paradigm of mobile edge quantum computing (MEQC) that integrates quantum computing capabilities into classical edge computing servers that are proximate to mobile devices. To conceptualize the MEQC, we first design an MEQC system, where mobile devices can offload classical and quantum computation tasks to edge servers equipped with classical and quantum computers. We then formulate the hybrid classical-quantum computation offloading problem whose goal is to minimize system cost in terms of latency and energy consumption. To solve the offloading problem efficiently, we propose a hybrid discrete-continuous multi-agent reinforcement learning algorithm to learn long-term sustainable offloading and partitioning strategies. Finally, numerical results demonstrate that the proposed algorithm can reduce the MEQC system cost by up to 30% compared to existing baselines.

DOI
10.48550/arxiv.2504.08134

Related papers

Learning-based Sustainable Multi-User Computation Offloading for Mobile Edge-Quantum Computing

Minrui Xu, Dusit Tao Niyato, Jiawen Kang +2 more

In this paper, a novel paradigm of mobile edge-quantum computing (MEQC) is proposed, which brings quantum computing capacities to mobile edge networks that are closer to mobile users (i.e., edge devices). First, we propose an MEQC system model where mobile users can offload computational tasks to scalable quantum computers via edge servers with cryogenic components and fault-tolerant schemes. Second, we show that it is NP-hard to obtain a centralized solution to the partial offloading problem in MEQC in terms of the optimal latency and energy cost of classical and quantum computing. Third, we propose a multi-agent hybrid discrete-continuous deep reinforcement learning using proximal policy optimization to learn the long-term sustainable offloading strategy without prior knowledge. Finally, experimental results demonstrate that the proposed algorithm can reduce at least 30% of the cost compared with the existing baseline solutions under different system settings.

arXiv:2211.06681•Nov 12, 2022•0 citations

Learning-Based Sustainable Multi-User Computation Offloading for Mobile Edge-Quantum Computing

Minrui Xu, Dusit Tao Niyato, Jiawen Kang +2 more

In this paper, a novel paradigm of mobile edgequantum computing (MEQC) is proposed, which brings quantum computing capacities to mobile edge networks that are closer to mobile users (i.e., edge devices). First, we propose an MEQC system model where mobile users can offload computational tasks to scalable quantum computers via edge servers with cryogenic components and fault-tolerant schemes. Second, we show that it is NP-hard to obtain a centralized solution to the partial offloading problem in MEQC in terms of the optimal latency and energy cost of classical and quantum computing. Third, we propose a multi-agent hybrid discrete-continuous deep reinforcement learning using proximal policy optimization to learn the long-term sustainable offloading strategy without prior knowledge. Finally, experimental results demonstrate that the proposed algorithm can reduce at least 30% of the cost compared with the existing baseline solutions under different system settings.

International Conference on Communications•May 28, 2023•16 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•21 citations

Smart Healthcare with Hybrid Mobile Edge-Quantum Computing: Dynamic Computation Offloading for Latency Improvement

Ziqiaing Ye, Yulan Gao, Yue Xiao +3 more

As healthcare becomes increasingly data-driven, integrating hybrid mobile edge-quantum computing (MEQC) into smart healthcare systems emerges as a promising solution for handling growing computational demand, especially for latency-sensitive tasks. Therefore, this paper proposes a deep reinforcement learning (DRL)-based Lyapunov approach for schedule computation offloading, aiming to minimize the total latency in hybrid MEQC-based smart healthcare systems. In this framework, a sustainable computation offloading strategy is obtained while guaranteeing the individual latency constraints and the required success ratio for each computation task. More precisely, the original latency minimization problem is transformed into a stepwise mixed-integer non-convex optimization problem using Lyapunov techniques. Subsequently, a Deep Q-Network (DQN) is adopted for computation offloading mode selection. The effectiveness of the proposed approach and its dependency on various system parameters are validated and assessed through numerical simulations.

IEEE Vehicular Technology Conference•Oct 10, 2023•5 citations

Quantum Deep Reinforcement Learning for Dynamic Resource Allocation in Mobile Edge Computing-Based IoT Systems

James Adu Ansere, Eric Gyamfi, Vishal Sharma +3 more

This paper exploits a quantum-empowered machine learning algorithm to enhance computation learning speed. We leverage quantum phenomena such as superposition and entanglement to work on large-scale multi-dimensional data represented by quantum states. Under stochastic behaviors and quantum uncertainty, we examine the offloading problem to maximize the computational task processing efficiency, considering the computation latency, energy consumption, and quantum network adaptability. From the Markov decision process, the paper proposes a novel quantum-empowered deep reinforcement learning (Qe-DRL) approach, combining quantum computing theory and machine learning to achieve exploration and exploitation trade-off via quantum parallelism significantly. Furthermore, we develop a modified Grover’s algorithm with exponential convergence speed to provide a searching strategy for transition quantum states probabilities. Simulation results establish the effectiveness of the proposed Qe-DRL algorithm and its superior computational learning speed. Our proposed Qe-DRL algorithm outperforms other benchmarks in terms of energy efficiency performance.

IEEE Transactions on Wireless Communications•Nov 14, 2023•51 citations

Quantum Deep Reinforcement Learning for 6G Mobile Edge Computing-based IoT Systems

James Adu Ansere, Trung Q. Duong, Saeed R. Khosravirad +3 more

This paper exploits a quantum-empowered machine learning algorithm to enhance computation learning speed. Under stochastic behaviours and quantum uncertainty, we examine the offloading problem to maximize the computational task processing efficiency, considering the computation latency, energy consumption, and quantum network adaptability. From the Markov decision process, the paper proposes a novel quantumempowered deep reinforcement learning (Qe-DRL) approach, combining quantum computing theory and machine learning to achieve exploration and exploitation trade-off via quantum parallelism significantly. Furthermore, we develop a modified Grover’s algorithm with exponential convergence speed to provide a searching strategy for transition quantum states probabilities. Simulation results establish the effectiveness of the proposed QeDRL algorithm and its superior computational learning speed.

International Wireless Communications and Mobile Computing Conference (IWCMC)•Jun 19, 2023•15 citations
Exploiting quantum computing at the mobile edge holds immense potential for facilitating large-scale network design, processing multimodal data, optimizing resource management, and enhancing network security. In this paper, we propose a pioneering paradigm of mobile edge quantum computing (MEQC) that integrates quantum computing capabilities into classical edge computing servers that are proximate to mobile devices. To conceptualize the MEQC, we first design an MEQC system, where mobile devices can offload classical and quantum computation tasks to edge servers equipped with classical and quantum computers. We then formulate the hybrid classical-quantum computation offloading problem whose goal is to minimize system cost in terms of latency and energy consumption. To solve the offloading problem efficiently, we propose a hybrid discrete-continuous multi-agent reinforcement learning algorithm to learn long-term sustainable offloading and partitioning strategies. Finally, numerical results demonstrate that the proposed algorithm can reduce the MEQC system cost by up to 30% compared to existing baselines.
In this paper, a novel paradigm of mobile edge-quantum computing (MEQC) is proposed, which brings quantum computing capacities to mobile edge networks that are closer to mobile users (i.e., edge devices). First, we propose an MEQC system model where mobile users can offload computational tasks to scalable quantum computers via edge servers with cryogenic components and fault-tolerant schemes. Second, we show that it is NP-hard to obtain a centralized solution to the partial offloading problem in MEQC in terms of the optimal latency and energy cost of classical and quantum computing. Third, we propose a multi-agent hybrid discrete-continuous deep reinforcement learning using proximal policy optimization to learn the long-term sustainable offloading strategy without prior knowledge. Finally, experimental results demonstrate that the proposed algorithm can reduce at least 30% of the cost compared with the existing baseline solutions under different system settings.
In this paper, a novel paradigm of mobile edgequantum computing (MEQC) is proposed, which brings quantum computing capacities to mobile edge networks that are closer to mobile users (i.e., edge devices). First, we propose an MEQC system model where mobile users can offload computational tasks to scalable quantum computers via edge servers with cryogenic components and fault-tolerant schemes. Second, we show that it is NP-hard to obtain a centralized solution to the partial offloading problem in MEQC in terms of the optimal latency and energy cost of classical and quantum computing. Third, we propose a multi-agent hybrid discrete-continuous deep reinforcement learning using proximal policy optimization to learn the long-term sustainable offloading strategy without prior knowledge. Finally, experimental results demonstrate that the proposed algorithm can reduce at least 30% of the cost compared with the existing baseline solutions under different system settings.
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.
As healthcare becomes increasingly data-driven, integrating hybrid mobile edge-quantum computing (MEQC) into smart healthcare systems emerges as a promising solution for handling growing computational demand, especially for latency-sensitive tasks. Therefore, this paper proposes a deep reinforcement learning (DRL)-based Lyapunov approach for schedule computation offloading, aiming to minimize the total latency in hybrid MEQC-based smart healthcare systems. In this framework, a sustainable computation offloading strategy is obtained while guaranteeing the individual latency constraints and the required success ratio for each computation task. More precisely, the original latency minimization problem is transformed into a stepwise mixed-integer non-convex optimization problem using Lyapunov techniques. Subsequently, a Deep Q-Network (DQN) is adopted for computation offloading mode selection. The effectiveness of the proposed approach and its dependency on various system parameters are validated and assessed through numerical simulations.
This paper exploits a quantum-empowered machine learning algorithm to enhance computation learning speed. We leverage quantum phenomena such as superposition and entanglement to work on large-scale multi-dimensional data represented by quantum states. Under stochastic behaviors and quantum uncertainty, we examine the offloading problem to maximize the computational task processing efficiency, considering the computation latency, energy consumption, and quantum network adaptability. From the Markov decision process, the paper proposes a novel quantum-empowered deep reinforcement learning (Qe-DRL) approach, combining quantum computing theory and machine learning to achieve exploration and exploitation trade-off via quantum parallelism significantly. Furthermore, we develop a modified Grover’s algorithm with exponential convergence speed to provide a searching strategy for transition quantum states probabilities. Simulation results establish the effectiveness of the proposed Qe-DRL algorithm and its superior computational learning speed. Our proposed Qe-DRL algorithm outperforms other benchmarks in terms of energy efficiency performance.
This paper exploits a quantum-empowered machine learning algorithm to enhance computation learning speed. Under stochastic behaviours and quantum uncertainty, we examine the offloading problem to maximize the computational task processing efficiency, considering the computation latency, energy consumption, and quantum network adaptability. From the Markov decision process, the paper proposes a novel quantumempowered deep reinforcement learning (Qe-DRL) approach, combining quantum computing theory and machine learning to achieve exploration and exploitation trade-off via quantum parallelism significantly. Furthermore, we develop a modified Grover’s algorithm with exponential convergence speed to provide a searching strategy for transition quantum states probabilities. Simulation results establish the effectiveness of the proposed QeDRL algorithm and its superior computational learning speed.