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.
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.
Quadratic unconstrained binary optimization (QUBO) tasks are very important in chemistry, finance, job scheduling, and so on, which can be represented using graph structures, with the variables as nodes and the interaction between them as edges. Variational quantum algorithms, especially the Quantum Approximate Optimization Algorithm (QAOA) and its variants, present a promising way, potentially exceeding the capabilities of classical algorithms, for addressing QUBO tasks. However, the possibility of using message-passing machines, inspired by classical graph neural networks, to enhance the power and performance of these quantum algorithms for QUBO tasks was not investigated. This study introduces a novel variational quantum graph optimization algorithm that integrates the message-passing mechanism, which demonstrates significant improvements in performance for solving QUBO problems in terms of resource efficiency and solution precision, compared to QAOA, its variants, and other quantum graph neural networks. Furthermore, in terms of scalability on QUBO tasks, our algorithm shows superior performance compared to QAOA, presenting a substantial advancement in the field of quantum approximate optimization.
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.
With the advances in artificial intelligence and communication technologies, vehicular edge computing (VEC), as a newly developed computing paradigm, is gaining more and more attention from both academia and industry. Complex demands and on-board applications need to be offloaded to edge servers for Quality of Experience (QoE). Nevertheless, the offloading process increases the risk of user privacy leakage, and the effectiveness of resource allocation algorithms is urgently desired in latency-sensitive tasks. To this end, we employ quantum key distribution (QKD) and blockchain to secure communication and computation, where key generation rate (KGR) associated with transmission and computation-aware is investigated for resource allocation problem. In consideration of the number of existing qubits and technical bottlenecks, we propose a tensor network preprocessing-based quantum deep reinforcement learning algorithm (TN-QDRL), which exploits amplitude encoding and the unique properties of quantum superposition and entanglement states to tackle the complex Markov decision process in a multi-dimensional state space. Additionally, we provide a search strategy for quantum state probabilistic transformations integrated with an improved Grover's algorithm. Simulation results indicate that our algorithm achieves a convergence speed that is 62.11% faster in high-dimensional real-world VEC scenarios and consumes 58.19% fewer quantum resources compared to other benchmarks.
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.
Task scheduling with constrained time intervals and limited resources remains a fundamental challenge across domains such as manufacturing, logistics, cloud computing, and healthcare. This study presents a novel variant of the Quantum Approximate Optimization Algorithm (QAOA) designed to address the task scheduling problem formulated as a Quadratic Unconstrained Binary Optimization (QUBO) model. The proposed method, referred to as Quantum Time Interval Scheduler (QTIS), integrates an ancilla-assisted quantum circuit to dynamically detect and penalize overlapping tasks, enhancing the enforcement of scheduling constraints. Two complementary implementations are explored for overlap detection: a quantum approach based on RY rotations and CCNOT gates, and a classical alternative relying on preprocessed interval comparisons. QTIS decomposes the problem Hamiltonian, Hp, into two components, each parameterized by a distinct angle. The first component encodes the objective function, while the second captures penalty terms associated with overlapping intervals, which are controlled by the auxiliary circuit. Subsequently, three minimization strategies are evaluated: standard QAOA, T-QAOA, and HT-QAOA, showing that employing separate parameters for the different components of the problem Hamiltonian leads to lower energy values and improved solution quality. Results confirm the efficiency of QTIS in scheduling tasks with fixed temporal windows while minimizing conflicts, demonstrating its potential to advance hybrid quantum-classical optimization in complex scheduling environments.
Quantum Edge Computing (QEC) enables Smart Mobile Devices (SMDs) offload intensive tasks to quantum-enabled edge servers (ESs) and Unmanned Aerial Vehicles (UAVs). Effective offloading must jointly optimize latency, energy, carbon footprint, resource utilization, and execution cost under deadline and budget constraints, while considering task urgency. We formulate the Cost-Aware Quantum Partial Task Offloading (CAQPTO) problem as a multi-objective optimization problem and prove that it is NP-hard via a polynomial-time reduction from the multidimensional knapsack problem. To address this, we propose a Quantum-enhanced Modified Differential Evolution (QMDE) algorithm that integrates: (i) a probabilistic quantum-inspired task–node encoding, (ii) a feasibility-preserving cuckoo-hashing-based decoder, and (iii) a penalty-aware fitness function for deadline-and budget-constrained optimization. Simulations show that QMDE outperforms state-of-the-art baselines, yielding up to 30% improvement in resource utilization while maintaining competitive latency, carbon emissions, and energy consumption.