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:2212.09431 · EPJ Quantum Technology

Robustness of quantum reinforcement learning under hardware errors

Andrea Skolik, Stefano Mangini, Thomas Bäck, Chiara Macchiavello, Vedran Dunjko

Published Feb 28, 2023• 36 citations
arXivHTMLPDF

Abstract

Abstract Variational quantum machine learning algorithms have become the focus of recent research on how to utilize near-term quantum devices for machine learning tasks. They are considered suitable for this as the circuits that are run can be tailored to the device, and a big part of the computation is delegated to the classical optimizer. It has also been hypothesized that they may be more robust to hardware noise than conventional algorithms due to their hybrid nature. However, the effect of training quantum machine learning models under the influence of hardware-induced noise has not yet been extensively studied. In this work, we address this question for a specific type of learning, namely variational reinforcement learning, by studying its performance in the presence of various noise sources: shot noise, coherent and incoherent errors. We analytically and empirically investigate how the presence of noise during training and evaluation of variational quantum reinforcement learning algorithms affect the performance of the agents and robustness of the learned policies. Furthermore, we provide a method to reduce the number of measurements required to train Q-learning agents, using the inherent structure of the algorithm.

DOI
10.1140/epjqt/s40507-023-00166-1

Related papers

Variational quantum policies for reinforcement learning.

Sofiène Jerbi, Casper Gyurik, Simon Marshall +2 more

Variational quantum circuits have recently gained popularity as quantum machine learning models. While considerable effort has been invested to train them in supervised and unsupervised learning settings, relatively little attention has been given to their potential use in reinforcement learning. In this work, we leverage the understanding of quantum policy gradient algorithms in a number of ways. First, we investigate how to construct and train reinforcement learning policies based on variational quantum circuits. We propose several designs for quantum policies, provide their learning algorithms, and test their performance on classical benchmarking environments. Second, we show the existence of task environments with a provable separation in performance between quantum learning agents and any polynomial-time classical learner, conditioned on the widely-believed classical hardness of the discrete logarithm problem. We also consider more natural settings, in which we show an empirical quantum advantage of our quantum policies over standard neural-network policies. Our results constitute a first step towards establishing a practical near-term quantum advantage in a reinforcement learning setting. Additionally, we believe that some of our design choices for variational quantum policies may also be beneficial to other models based on variational quantum circuits, such as quantum classifiers and quantum regression models.

•Mar 9, 2021•29 citations

Robustness and Generalization in Quantum Reinforcement Learning via Lipschitz Regularization

Nico Meyer, Julian Berberich, Christopher Mutschler +1 more

Quantum machine learning leverages quantum computing to enhance accuracy and reduce model complexity compared to classical approaches, promising significant advancements in various fields. Within this domain, quantum reinforcement learning has garnered attention, often realized using variational quantum circuits to approximate the policy function. This paper addresses the robustness and generalization of quantum reinforcement learning by combining principles from quantum computing and control theory. Leveraging recent results on robust quantum machine learning, we utilize Lipschitz bounds to propose a regularized version of a quantum policy gradient approach, named the RegQPG algorithm. We show that training with RegQPG improves the robustness and generalization of the resulting policies. Furthermore, we introduce an algorithmic variant that incorporates curriculum learning, which minimizes failures during training. Our findings are validated through numerical experiments, demonstrating the practical benefits of our approach.

arXiv:2410.21117•Oct 28, 2024•4 citations

Quantum agents in the Gym: a variational quantum algorithm for deep Q-learning

Andrea Skolik, Sofiène Jerbi, Vedran Dunjko

Quantum machine learning (QML) has been identified as one of the key fields that could reap advantages from near-term quantum devices, next to optimization and quantum chemistry. Research in this area has focused primarily on variational quantum algorithms (VQAs), and several proposals to enhance supervised, unsupervised and reinforcement learning (RL) algorithms with VQAs have been put forward. Out of the three, RL is the least studied and it is still an open question whether VQAs can be competitive with state-of-the-art classical algorithms based on neural networks (NNs) even on simple benchmark tasks. In this work, we introduce a training method for parametrized quantum circuits (PQCs) that can be used to solve RL tasks for discrete and continuous state spaces based on the deep Q-learning algorithm. We investigate which architectural choices for quantum Q-learning agents are most important for successfully solving certain types of environments by performing ablation studies for a number of different data encoding and readout strategies. We provide insight into why the performance of a VQA-based Q-learning algorithm crucially depends on the observables of the quantum model and show how to choose suitable observables based on the learning task at hand. To compare our model against the classical DQN algorithm, we perform an extensive hyperparameter search of PQCs and NNs with varying numbers of parameters. We confirm that similar to results in classical literature, the architectural choices and hyperparameters contribute more to the agents' success in a RL setting than the number of parameters used in the model. Finally, we show when recent separation results between classical and quantum agents for policy gradient RL can be extended to inferring optimal Q-values in restricted families of environments.

arXiv:2103.15084•Quantum•May 24, 2022•242 citations

Asynchronous training of quantum reinforcement learning

Samuel Yen-Chi Chen

The development of quantum machine learning (QML) has received a lot of interest recently thanks to developments in both quantum computing (QC) and machine learning (ML). One of the ML paradigms that can be utilized to address challenging sequential decision-making issues is reinforcement learning (RL). It has been demonstrated that classical RL can successfully complete many difficult tasks. A leading method of building quantum RL agents relies on the variational quantum circuits (VQC). However, training QRL algorithms with VQCs requires significant amount of computational resources. This issue hurdles the exploration of various QRL applications. In this paper, we approach this challenge through asynchronous training QRL agents. Specifically, we choose the asynchronous training of advantage actor-critic variational quantum policies. We demonstrate the results via numerical simulations that within the tasks considered, the asynchronous training of QRL agents can reach performance comparable to or superior than classical agents with similar model sizes and architectures.

arXiv:2301.05096•Procedia Computer Science•Jan 1, 2023•50 citations

Exploring the impact of noise on quantum DDPG in portfolio allocation

Annette Zapf, Sabine Wölk

In the era of Noisy Intermediate-Scale Quantum devices, Variational Quantum Circuits in Quantum Machine Learning are gaining attention, advancing towards practical quantum computing applications on NISQ devices. Reinforcement Learning (RL), known for its humanlike, trial-and-error learning, excels in adapting to changing financial environments. In particular, classical algorithms such as Deep Deterministic Policy Gradient (DDPG) and Proximal Policy Optimization (PPO) show promise, while emerging quantum neural networks offer potential for improved function approximation, better generalization capabilities and reduced parameters. In light of these advancements, we introduce a quantum-enhanced version of the DDPG agent (QDDPG), aiming to leverage these quantum capabilities for more efficient financial decisionmaking processes. The quantum part of the model utilizes a parameterized quantum policy, which consists of a sequential reuploading variational circuit with trainable input scaling parameters. Our objective is to explore the practicality and potential benefits of QRL in finance, aiming to realize viable quantum computing applications on NISQ devices. The QDDPG model surpasses traditional analytic strategies in portfolio allocation, achieving higher returns with fewer parameters and a favourable Sharpe ratio. In a simple configuration using a RAW-parameterized quantum policy, the model achieves an average Sharpe ratio of 1.20 across 15 trained agents, compared to 0.96 for the minimum-variance strategy and 0.81 for the buy-and-hold baseline. Furthermore we investigate the impact of quantum noise, a significant challenge for NISQ devices. We analyze various types of noise, such as general depolarization, amplitude damping, phase damping, measurement noise, and shot noise, which uniquely affect quantum computations. Our study quantifies how these noise types influence the performance, reliability, and robustness of the QRL model. We study new techniques to harness quantum noise as hyperparameter to control the exploration-exploitation balance of the agent, using noise as regularization method and to stabilize the training of the agents. This comprehensive analysis aims to not only highlight the challenges posed by quantum noise but also to explore innovative methods to mitigate these effects and enhance the applicability of quantum algorithms in real-world applications.

•Sep 10, 2024•0 citations

Adversarial Robust Quantum Reinforcement Learning: Defending Variational Policies Against Quantum-State Perturbations

Kainat Rizwan, Mir Wajid Ali

Quantum reinforcement learning (QRL) has shown potential significant potential for solving difficult sequence decision-making with the power of representation of quantum computing. However quantum states and their measurements are sensitive, and this implies that such systems are vulnerable to adversarial perturbation together with hardware noise. Avoiding variational quantum policy being misled by any but small, intelligible perturbations of quantum states, inputs or measurement outcomes can generate incorrect actions and unstable learning behaviour. This paper has provided an adversarially resilient quantum reinforcement learning (AR-QRL) architecture, which specifically aims to address these security and dependability challenges. It is a mixture of adversarial training, robust quantum states encoding and variance-sensitive policy optimization, which defends variational quantum policies against malicious quantumstate perturbation. Benchmarking quantum-control experiments have demonstrated improvements of 30%-40% in control fidelity to that of standard QRL, up to a 75% decreased reward variance, and a 40% acceleration of convergence under adversarial conditions.. These findings suggest the impact of adversarial robustness in improving effective and secure quantum reinforcement learning of noisy intermediate-scale quantum (NISQ) devices.

International Bhurban Conference on Applied Sciences and Technology (IBCAST)•Aug 1, 2026•0 citations
Abstract Variational quantum machine learning algorithms have become the focus of recent research on how to utilize near-term quantum devices for machine learning tasks. They are considered suitable for this as the circuits that are run can be tailored to the device, and a big part of the computation is delegated to the classical optimizer. It has also been hypothesized that they may be more robust to hardware noise than conventional algorithms due to their hybrid nature. However, the effect of training quantum machine learning models under the influence of hardware-induced noise has not yet been extensively studied. In this work, we address this question for a specific type of learning, namely variational reinforcement learning, by studying its performance in the presence of various noise sources: shot noise, coherent and incoherent errors. We analytically and empirically investigate how the presence of noise during training and evaluation of variational quantum reinforcement learning algorithms affect the performance of the agents and robustness of the learned policies. Furthermore, we provide a method to reduce the number of measurements required to train Q-learning agents, using the inherent structure of the algorithm.
Variational quantum circuits have recently gained popularity as quantum machine learning models. While considerable effort has been invested to train them in supervised and unsupervised learning settings, relatively little attention has been given to their potential use in reinforcement learning. In this work, we leverage the understanding of quantum policy gradient algorithms in a number of ways. First, we investigate how to construct and train reinforcement learning policies based on variational quantum circuits. We propose several designs for quantum policies, provide their learning algorithms, and test their performance on classical benchmarking environments. Second, we show the existence of task environments with a provable separation in performance between quantum learning agents and any polynomial-time classical learner, conditioned on the widely-believed classical hardness of the discrete logarithm problem. We also consider more natural settings, in which we show an empirical quantum advantage of our quantum policies over standard neural-network policies. Our results constitute a first step towards establishing a practical near-term quantum advantage in a reinforcement learning setting. Additionally, we believe that some of our design choices for variational quantum policies may also be beneficial to other models based on variational quantum circuits, such as quantum classifiers and quantum regression models.
Quantum machine learning leverages quantum computing to enhance accuracy and reduce model complexity compared to classical approaches, promising significant advancements in various fields. Within this domain, quantum reinforcement learning has garnered attention, often realized using variational quantum circuits to approximate the policy function. This paper addresses the robustness and generalization of quantum reinforcement learning by combining principles from quantum computing and control theory. Leveraging recent results on robust quantum machine learning, we utilize Lipschitz bounds to propose a regularized version of a quantum policy gradient approach, named the RegQPG algorithm. We show that training with RegQPG improves the robustness and generalization of the resulting policies. Furthermore, we introduce an algorithmic variant that incorporates curriculum learning, which minimizes failures during training. Our findings are validated through numerical experiments, demonstrating the practical benefits of our approach.
Quantum machine learning (QML) has been identified as one of the key fields that could reap advantages from near-term quantum devices, next to optimization and quantum chemistry. Research in this area has focused primarily on variational quantum algorithms (VQAs), and several proposals to enhance supervised, unsupervised and reinforcement learning (RL) algorithms with VQAs have been put forward. Out of the three, RL is the least studied and it is still an open question whether VQAs can be competitive with state-of-the-art classical algorithms based on neural networks (NNs) even on simple benchmark tasks. In this work, we introduce a training method for parametrized quantum circuits (PQCs) that can be used to solve RL tasks for discrete and continuous state spaces based on the deep Q-learning algorithm. We investigate which architectural choices for quantum Q-learning agents are most important for successfully solving certain types of environments by performing ablation studies for a number of different data encoding and readout strategies. We provide insight into why the performance of a VQA-based Q-learning algorithm crucially depends on the observables of the quantum model and show how to choose suitable observables based on the learning task at hand. To compare our model against the classical DQN algorithm, we perform an extensive hyperparameter search of PQCs and NNs with varying numbers of parameters. We confirm that similar to results in classical literature, the architectural choices and hyperparameters contribute more to the agents' success in a RL setting than the number of parameters used in the model. Finally, we show when recent separation results between classical and quantum agents for policy gradient RL can be extended to inferring optimal Q-values in restricted families of environments.
The development of quantum machine learning (QML) has received a lot of interest recently thanks to developments in both quantum computing (QC) and machine learning (ML). One of the ML paradigms that can be utilized to address challenging sequential decision-making issues is reinforcement learning (RL). It has been demonstrated that classical RL can successfully complete many difficult tasks. A leading method of building quantum RL agents relies on the variational quantum circuits (VQC). However, training QRL algorithms with VQCs requires significant amount of computational resources. This issue hurdles the exploration of various QRL applications. In this paper, we approach this challenge through asynchronous training QRL agents. Specifically, we choose the asynchronous training of advantage actor-critic variational quantum policies. We demonstrate the results via numerical simulations that within the tasks considered, the asynchronous training of QRL agents can reach performance comparable to or superior than classical agents with similar model sizes and architectures.
In the era of Noisy Intermediate-Scale Quantum devices, Variational Quantum Circuits in Quantum Machine Learning are gaining attention, advancing towards practical quantum computing applications on NISQ devices. Reinforcement Learning (RL), known for its humanlike, trial-and-error learning, excels in adapting to changing financial environments. In particular, classical algorithms such as Deep Deterministic Policy Gradient (DDPG) and Proximal Policy Optimization (PPO) show promise, while emerging quantum neural networks offer potential for improved function approximation, better generalization capabilities and reduced parameters. In light of these advancements, we introduce a quantum-enhanced version of the DDPG agent (QDDPG), aiming to leverage these quantum capabilities for more efficient financial decisionmaking processes. The quantum part of the model utilizes a parameterized quantum policy, which consists of a sequential reuploading variational circuit with trainable input scaling parameters. Our objective is to explore the practicality and potential benefits of QRL in finance, aiming to realize viable quantum computing applications on NISQ devices. The QDDPG model surpasses traditional analytic strategies in portfolio allocation, achieving higher returns with fewer parameters and a favourable Sharpe ratio. In a simple configuration using a RAW-parameterized quantum policy, the model achieves an average Sharpe ratio of 1.20 across 15 trained agents, compared to 0.96 for the minimum-variance strategy and 0.81 for the buy-and-hold baseline. Furthermore we investigate the impact of quantum noise, a significant challenge for NISQ devices. We analyze various types of noise, such as general depolarization, amplitude damping, phase damping, measurement noise, and shot noise, which uniquely affect quantum computations. Our study quantifies how these noise types influence the performance, reliability, and robustness of the QRL model. We study new techniques to harness quantum noise as hyperparameter to control the exploration-exploitation balance of the agent, using noise as regularization method and to stabilize the training of the agents. This comprehensive analysis aims to not only highlight the challenges posed by quantum noise but also to explore innovative methods to mitigate these effects and enhance the applicability of quantum algorithms in real-world applications.
Quantum reinforcement learning (QRL) has shown potential significant potential for solving difficult sequence decision-making with the power of representation of quantum computing. However quantum states and their measurements are sensitive, and this implies that such systems are vulnerable to adversarial perturbation together with hardware noise. Avoiding variational quantum policy being misled by any but small, intelligible perturbations of quantum states, inputs or measurement outcomes can generate incorrect actions and unstable learning behaviour. This paper has provided an adversarially resilient quantum reinforcement learning (AR-QRL) architecture, which specifically aims to address these security and dependability challenges. It is a mixture of adversarial training, robust quantum states encoding and variance-sensitive policy optimization, which defends variational quantum policies against malicious quantumstate perturbation. Benchmarking quantum-control experiments have demonstrated improvements of 30%-40% in control fidelity to that of standard QRL, up to a 75% decreased reward variance, and a 40% acceleration of convergence under adversarial conditions.. These findings suggest the impact of adversarial robustness in improving effective and secure quantum reinforcement learning of noisy intermediate-scale quantum (NISQ) devices.