Deep reinforcement learning (DRL) is a standard approach to sequential decision-making under uncertainty, where value functions are often approximated with deep neural networks such as Deep Q-Networks (DQNs). Parameterized quantum circuits (PQCs) have emerged as a flexible modeling primitive for near-term quantum hardware, enabling hybrid quantum–classical predictors in which a PQC produces bounded expectation-value features that are processed by classical layers. A practical limitation of many quantum learning approaches, however, is the need for quantum hardware not only during training but also at deployment time. In this work, we study PQC-driven value-based agents in the CartPole control benchmark. Using a common DQN-style training loop, we compare classical DQN baselines, a PQC-based Q-network, and a hybrid workflow that leverages classical shadows for evaluation-only deployment. To probe near-term practicality, we further examine robustness by injecting additive Gaussian perturbations into the quantum feature vector across multiple noise amplitudes.
Deep reinforcement learning (DRL) is a standard approach to sequential decision-making under uncertainty, where value functions are often approximated with deep neural networks such as Deep Q-Networks (DQNs). Parameterized quantum circuits (PQCs) have emerged as a flexible modeling primitive for near-term quantum hardware, enabling hybrid quantum–classical predictors in which a PQC produces bounded expectation-value features that are processed by classical layers. A practical limitation of many quantum learning approaches, however, is the need for quantum hardware not only during training but also at deployment time. In this work, we study PQC-driven value-based agents in the CartPole control benchmark. Using a common DQN-style training loop, we compare classical DQN baselines, a PQC-based Q-network, and a hybrid workflow that leverages classical shadows for evaluation-only deployment. To probe near-term practicality, we further examine robustness by injecting additive Gaussian perturbations into the quantum feature vector across multiple noise amplitudes.
We utilize hybrid quantum deep reinforcement learning to learn navigation tasks for a simple, wheeled robot in simulated environments of increasing complexity. For this, we train parameterized quantum circuits (PQCs) with two different encoding strategies in a hybrid quantum-classical setup as well as a classical neural network baseline with the double deep Q network (DDQN) reinforcement learning algorithm. Quantum deep reinforcement learning (QDRL) has previously been studied in several relatively simple benchmark environments, mainly from the OpenAI gym suite. However, scaling behavior and applicability of QDRL to more demanding tasks closer to real-world problems e.g., from the robotics domain, have not been studied previously. Here, we show that quantum circuits in hybrid quantum-classic reinforcement learning setups are capable of learning optimal policies in multiple robotic navigation scenarios with notably fewer trainable parameters compared to a classical baseline. Across a large number of experimental configurations, we find that the employed quantum circuits outperform the classical neural network baselines when equating for the number of trainable parameters. Yet, the classical neural network consistently showed better results concerning training times and stability, with at least one order of magnitude of trainable parameters more than the best-performing quantum circuits. However, validating the robustness of the learning methods in a large and dynamic environment, we find that the classical baseline produces more stable and better performing policies overall. For the two encoding schemes, we observed better results for consecutively encoding the classical state vector on each qubit compared to encoding each component on a separate qubit. Our findings demonstrate that current hybrid quantum machine-learning approaches can be scaled to simple robotic problems while yielding sufficient results, at least in an idealized simulated setting, but there are yet open questions regarding the application to considerably more demanding tasks. We anticipate that our work will contribute to introducing quantum machine learning in general and quantum deep reinforcement learning in particular to more demanding problem domains and emphasize the importance of encoding techniques for classic data in hybrid quantum-classical settings.
Parameterized quantum circuits (PQC) have emerged as a quantum analogue of deep neural networks and can be trained for discriminative or generative tasks and can be trained with gradient-based optimization on near-term quantum devices [1], [2], [3]. In the current era of quantum computing, known as the noisy intermediate scale quantum (NISQ) era [4], these devices contain a moderate number of qubits (< 100), and algorithmic performance is strongly impacted by hardware noise. Additionally, the training of PQCs are hybrid algorithms, in which the computational workflow is split between quantum and classical computing platforms.
Quantum Neural Networks (QNNs) represent a compelling convergence of quantum mechanics and machine learning, yet their practical deployment remains constrained by noise, limited qubit counts, and the cost of full quantum execution. Hybrid quantum-classical (HQC) training offers a pragmatic path forward: parameterized quantum circuits (PQCs) process information in exponentially large Hilbert spaces while classical optimizers update parameters via gradient methods accessible on today's hardware. We present a modular HQC training framework, formalising the parameter-shift rule for hardware-compatible gradient estimation, characterising the barren-plateau phenomenon through a variance-decay analysis, and introducing noise-aware training strategies for NISQ devices. Empirical results from state-vector and shot-based simulation confirm measurable quantum advantage on quantum-structured tasks, with the phase classification benchmark improving +12.1% over a classical MLP baseline. The accompanying open-source library provides a clean abstraction between quantum simulation and classical optimisation, serving as a foundation for near-term quantum machine learning research.
Research on quantum computing is still in its infancy, but it has a lot of potential uses. One topic with potential is machine learning, namely in the field of reinforcement learning. This work examines the integration of parametrized quantum circuits (PQC) into reinforcement learning (RL) algorithms, assessing the potential of quantum-enhanced models to solve classical RL tasks. It closely follows the example found on the TensorFlow website. This paper reviews applications of quantum reinforcement learning (QRL). We examine PQCs in a standard RL scenario, the CartPole-v1 environment from Gym, using TensorFlow Quantum and Cirq, to evaluate the relative performance of quantum versus conventional models. In comparison to conventional deep neural network (ONN) models, PQCs show slower convergence and higher processing needs, even if they are still able to learn the task and perform competitively. After they are fully trained, the quantum models show unique difficulties during the early training stages and reach a performance stability level like classical methods. This study sheds light on the present constraints as well as possible uses of quantum computing in reinforcement learning, particularly in situations with intricate, high-dimensional settings that prove difficult for classical computers to handle effectively. As we look to the future, we suggest that investigating hybrid quantum-classical algorithms, developing quantum hardware, and using quantum RL for increasingly difficult tasks are essential first steps. The study presents findings from both a classical reinforcement learning algorithm and a quantum integrated reinforcement learning algorithm. To provide a reliable comparison between quantum reinforcement algorithms and their classical equivalents, further work remains. This work lays the groundwork for future advances in the field by investigating the viability and use of quantum algorithms in reinforcement learning, even if it is not particularly unique. The purpose of this work is to help newcomers to this emerging field of study.
Abstract This work introduces a novel hybrid quantum-classical machine learning framework in which a Reinforcement Learning (RL) agent autonomously constructs quantum circuits to optimize kernels for a Quantum Support Vector Classifier (QSVC). Unlike traditional approaches that rely on fixed or manually designed quantum feature maps, the proposed method employs a Deep Q-Network (DQN) agent to dynamically select quantum gates and their parameters. These configurations define a parameterized quantum circuit whose fidelity-based kernel is used to perform classification tasks. The RL agent is trained to maximize classification accuracy by interacting with an environment that evaluates circuit performance. Experiments conducted on a realistic and potentially biased educational dataset demonstrate that the RL-optimized QSVC outperforms both classical SVC and standard QSVC baselines in terms of accuracy and fairness. Furthermore, SHAP-based explainability analysis reveals a reduction in model bias, suggesting improved interpretability and robustness. This study highlights the potential of reinforcement learning for automated quantum circuit design and kernel optimization in quantum machine learning.
The purpose of this research is to show the capabilities that quantum computing has to offer for AI. Therefore, the scheduling problem was chosen in order to demonstrate and compare the classical reinforcement learning (CRL) agent with the quantum computing reinforcement learning (QC-RL) agent. This constrained combinatorial optimization problem involves scheduling an oil field with several drilling rigs which are limited in capacity, area limitations, mandatory maintenance periods, weather restrictions and a mobilization costs which is considered along with well priorities and deadlines. Deep reinforcement learning (DRL) can learn adaptive scheduling policies, but value-based agents such as Deep Q-Networks (DQN) are known to exhibit high variance across random initializations. This paper investigates whether a hybrid quantum-classical value function can improve this reliability. We formulate realistic multi-rig drilling scheduling as a Markov Decision Process with action masking over an eight-constraint simulator (24 wells, 6 rigs, 3 areas, 80-day horizon) and compare a classical DQN against a hybrid Quantum DQN in which the value network’s core is a variational quantum circuit via a 4-qubit ZFeatureMap encoding followed by a RealAmplitudes ansatz with 12 trainable quantum parameters, executed using a PyTorch-Qiskit interface. Both agents share an identical training and evaluation protocol (3 seeds × 30 episodes, greedy evaluation) to ensure a controlled comparison. Under greedy evaluation, the hybrid Quantum DQN completes 22.3/24 wells on average versus 17/24 for the classical DQN, achieves an 12.87% higher mean reward (9.12M vs 8.08M), and most significantly reduces the across-seed reward standard deviation by roughly 6.8× (0.202M vs 1.38M). These results indicate that the structurally constrained quantum value function acts as an implicit regularizer, yielding scheduling policies that are markedly more consistent across initializations than a substantially larger classical network. This simulated quantum computing experiment demonstrates the potential for quantum computing in the field of AI.