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.
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.
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.
Abstract: Quantum deep reinforcement learning is an integration of the principles of quantum computing with deep reinforcement learning in an effort to advance robot navigation tasks. Due to the explosion of the state and action spaces, traditionally DRL methods are limited in scalability and efficiency. QDRL, however, uses quantum superposition and entanglement for more efficient processing of big amounts of information-it enables robots to learn optimal policies for navigating complex environments. We introduce here a new QDRL framework in which quantum neural networks encode policy functions and value estimates. We demonstrate how quantum circuits can take advantage of multi-dimensional state representations in order to strengthen the power of a robot in changing its environment over time. Benchmark experiments on navigation tasks reflect phenomenal acceleration in learning performance along with better decision-making accuracy compared to classical DRL methods. We then consider integrating such quantum algorithms, as Grover's search, to improve exploration strategies in sparse reward settings. The experiments show that QDRL speeds up convergence rates and provides robots with the possibility to react more rapidly to unexpected obstacles. It discusses new applications for quantum computing of autonomous systems, potentially applied to robotics, autonomous vehicles, and other environments which require complex decision making. Some lines of work in the future are optimization of the resources needed for quantum computers and hybrid architectures for the resolution of classical problems in navigation
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.
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.
This work proposes a quantum-aided deep reinforcement learning (DRL) framework designed to enhance the accuracy of direction-of-arrival (DoA) estimation and the efficiency of computational task offloading in integrated sensing and communication systems. Traditional DRL approaches face challenges in handling high-dimensional state spaces and ensuring convergence to optimal policies within complex operational environments. The proposed quantum-aided DRL framework that operates in a military surveillance system exploits quantum computing’s parallel processing capabilities to encode operational states and actions into quantum states, significantly reducing the dimensionality of the decision space. For the very first time in literature, we propose a quantum-enhanced actor-critic method, utilizing quantum circuits for policy representation and optimization. Through comprehensive simulations, we demonstrate that our framework improves DoA estimation accuracy by 91.66% and 82.61% over existing DRL algorithms with faster convergence rate, and effectively manages the trade-off between sensing and communication and optimizing task offloading decisions under stringent ultra-reliable low-latency communication requirements. Comparative analysis also reveals that our approach reduces the overall task offloading latency by 43.09% and 32.35% compared to the DRL-based deep deterministic policy gradient and proximal policy optimization algorithms, respectively.
The significant rise in wireless communication, driven by sixth-generation (6G) networks, underscores the urgent need for innovative resource allocation methods to achieve efficiency, scalability, and reliability. This survey explores the integration of Quantum Deep Reinforcement Learning (QDRL) as a strategy to address the challenges posed by dynamic and complex wireless environments. By leveraging quantum computing features such as superposition and entanglement, QDRL enhances computational efficiency and mitigates the scalability limitations of classical and deep reinforcement learning (DRL) in high-dimensional optimization. The study reviews recent QDRL approaches for key resource allocation tasks, including power distribution, user scheduling, and channel assignment, and examines quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) and Quantum Neural Networks (QNN) for improved decision-making in wireless systems. Furthermore, it emphasizes the connection between quantum computing and DRL, highlighting hybrid architectures that balance computational cost, energy efficiency, and scalability. Finally, the survey identifies research gaps and outlines future directions, paving the way for robust QDRL strategies to support next-generation wireless networks.