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

New Mathematics and Natural Computation

QUANTUM INSPIRED REINFORCEMENT LEARNING IN CHANGING ENVIRONMENT

Pegah Fakhari, Karthikeyan Rajagopal, Sivasubramanya Nadar Balakrishnan, Jerome R. Busemeyer

Published Oct 3, 2013• 16 citations
Publisher

Abstract

Inspired by quantum theory and reinforcement learning, a new framework of learning in unknown probabilistic environment is proposed. Several simulated experiments are given; the results demonstrate the robustness of the new algorithm for some complex problems. Also we generalized the Grover algorithm to improve the rate of converging to an optimal path. In other words, the new generalized algorithm helps to increase the probability of selecting good actions with better weights' adjustments.

DOI
10.1142/s1793005713400073

Related papers

Quantum Reinforcement Learning

Daoyi Dong, Chunlin Chen, Han‐Xiong Li +1 more

The key approaches for machine learning, particularly learning in unknown probabilistic environments, are new representations and computation mechanisms. In this paper, a novel quantum reinforcement learning (QRL) method is proposed by combining quantum theory and reinforcement learning (RL). Inspired by the state superposition principle and quantum parallelism, a framework of a value-updating algorithm is introduced. The state (action) in traditional RL is identified as the eigen state (eigen action) in QRL. The state (action) set can be represented with a quantum superposition state, and the eigen state (eigen action) can be obtained by randomly observing the simulated quantum state according to the collapse postulate of quantum measurement. The probability of the eigen action is determined by the probability amplitude, which is updated in parallel according to rewards. Some related characteristics of QRL such as convergence, optimality, and balancing between exploration and exploitation are also analyzed, which shows that this approach makes a good tradeoff between exploration and exploitation using the probability amplitude and can speedup learning through the quantum parallelism. To evaluate the performance and practicability of QRL, several simulated experiments are given, and the results demonstrate the effectiveness and superiority of the QRL algorithm for some complex problems. This paper is also an effective exploration on the application of quantum computation to artificial intelligence.

arXiv:0810.3828•IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)•Aug 4, 2008•410 citations

Quantum-Inspired Algorithms for Reinforcement Learning

Jincheng Zhang

This paper investigates the application of quantum-inspired algorithms to the field of reinforcement learning (RL). Traditional RL methods often struggle with exploration challenges and can be computationally expensive, particularly in complex environments. We propose a novel RL algorithm that leverages concepts from quantum mechanics, specifically superposition and entanglement, to address these limitations. The core idea is to represent states, actions, and rewards using quantum-inspired representations, allowing the agent to explore the environment more efficiently and potentially converge to optimal policies faster. This work presents a detailed formulation of the algorithm, including the mathematical framework and key considerations for implementation. The potential benefits of this approach, including improved exploration and reduced computational complexity, are discussed. The algorithm is designed to iteratively refine its policy based on simulated quantum measurements, aiming to minimize the expected return. The exploration strategy is guided by the inherent probabilistic nature of quantum states, leading to a more diverse and potentially faster learning process. Further research is warranted to fully explore the capabilities and limitations of this approach across various RL benchmark problems.

•Sep 1, 2026•0 citations

Quantum-inspired reinforcement learning for decision-making of Markovian state transition

Daoyi Dong, Chunlin Chen

A novel quantum-inspired reinforcement learning (QiRL) algorithm is proposed for decision-making of Markovian state transition. The QiRL algorithm adopts a probabilistic action selection policy to better balance the tradeoff between exploration and exploitation, which is inspired by the collapse phenomenon in quantum measurement. Several simulated experiments of Markovian state transition demonstrate that QiRL is more robust to learning rates and initial states than traditional reinforcement learning. The QiRL approach provides an effective method for complex decision-making problems.

International Conference on Intelligent Systems and Knowledge Engineering (ISKE)•Nov 1, 2010•4 citations

Quantum-Inspired Algorithms for Reinforcement Learning Policy Optimization

Jincheng Zhang

This paper investigates the potential of quantum-inspired algorithms to improve reinforcement learning (RL) policy optimization. Traditional RL methods often struggle with slow convergence and exploration challenges, particularly in complex environments. We propose a novel approach that draws inspiration from quantum mechanics, specifically superposition and entanglement, to address these limitations. Our algorithms aim to exploit superposition to simultaneously evaluate multiple action possibilities and utilize entanglement to model correlations between states, thereby accelerating the learning process. We present a framework for incorporating these concepts into RL, focusing on algorithmic design rather than a direct quantum simulation. The theoretical analysis suggests that our approach could significantly enhance exploration efficiency and, consequently, policy convergence rates. This work represents a direct application of quantum-inspired ideas to RL policy optimization, offering a potentially transformative pathway for developing more efficient and robust RL agents.

•Sep 7, 2026•0 citations

Quantum Machine Learning: A Reinforcement Learning Framework

Jincheng Zhang

Quantum Machine Learning (QML) represents a paradigm shift in machine learning, leveraging quantum mechanical principles to accelerate computation and potentially unlock new algorithms. This paper investigates a novel reinforcement learning (RL) framework, termed "Adaptive Neural Network Reinforcement Learning" (ANNR), which employs dynamic parameter adjustment within a self-adaptive neural network to enhance learning efficiency and generalization capabilities. We demonstrate that this approach overcomes limitations of traditional RL methods, offering a promising path towards more robust and adaptable reinforcement learning agents. The core mechanism focuses on iteratively refining neural network weights through a feedback loop, enabling the system to explore complex environments effectively. The research explores the impact of parameter adjustment on both training speed and final performance across various RL tasks.

•Aug 31, 2026•0 citations

基于量子机器学习的非线性强化学习的自适应算法

Jincheng Zhang

This paper presents a novel approach to reinforcement learning, leveraging the unique capabilities of quantum machine learning to develop an adaptive learning algorithm. Traditional reinforcement learning algorithms often struggle with complex environments due to the computational limitations of classical systems. We propose a quantum-enhanced learning framework that dynamically adjusts the learning strategy based on environmental changes, resulting in enhanced adaptation and exploration. This paper explores the potential of quantum mechanics to accelerate learning and improve the ability to navigate challenging environments. The core mechanism focuses on utilizing quantum entanglement and superposition to represent and update the state space more efficiently, facilitating faster convergence and the discovery of optimal policies. The proposed algorithm demonstrates promising results across a range of scenarios, showcasing its potential to overcome the limitations of classical reinforcement learning.

•Aug 31, 2026•0 citations
Inspired by quantum theory and reinforcement learning, a new framework of learning in unknown probabilistic environment is proposed. Several simulated experiments are given; the results demonstrate the robustness of the new algorithm for some complex problems. Also we generalized the Grover algorithm to improve the rate of converging to an optimal path. In other words, the new generalized algorithm helps to increase the probability of selecting good actions with better weights' adjustments.
The key approaches for machine learning, particularly learning in unknown probabilistic environments, are new representations and computation mechanisms. In this paper, a novel quantum reinforcement learning (QRL) method is proposed by combining quantum theory and reinforcement learning (RL). Inspired by the state superposition principle and quantum parallelism, a framework of a value-updating algorithm is introduced. The state (action) in traditional RL is identified as the eigen state (eigen action) in QRL. The state (action) set can be represented with a quantum superposition state, and the eigen state (eigen action) can be obtained by randomly observing the simulated quantum state according to the collapse postulate of quantum measurement. The probability of the eigen action is determined by the probability amplitude, which is updated in parallel according to rewards. Some related characteristics of QRL such as convergence, optimality, and balancing between exploration and exploitation are also analyzed, which shows that this approach makes a good tradeoff between exploration and exploitation using the probability amplitude and can speedup learning through the quantum parallelism. To evaluate the performance and practicability of QRL, several simulated experiments are given, and the results demonstrate the effectiveness and superiority of the QRL algorithm for some complex problems. This paper is also an effective exploration on the application of quantum computation to artificial intelligence.
This paper investigates the application of quantum-inspired algorithms to the field of reinforcement learning (RL). Traditional RL methods often struggle with exploration challenges and can be computationally expensive, particularly in complex environments. We propose a novel RL algorithm that leverages concepts from quantum mechanics, specifically superposition and entanglement, to address these limitations. The core idea is to represent states, actions, and rewards using quantum-inspired representations, allowing the agent to explore the environment more efficiently and potentially converge to optimal policies faster. This work presents a detailed formulation of the algorithm, including the mathematical framework and key considerations for implementation. The potential benefits of this approach, including improved exploration and reduced computational complexity, are discussed. The algorithm is designed to iteratively refine its policy based on simulated quantum measurements, aiming to minimize the expected return. The exploration strategy is guided by the inherent probabilistic nature of quantum states, leading to a more diverse and potentially faster learning process. Further research is warranted to fully explore the capabilities and limitations of this approach across various RL benchmark problems.
A novel quantum-inspired reinforcement learning (QiRL) algorithm is proposed for decision-making of Markovian state transition. The QiRL algorithm adopts a probabilistic action selection policy to better balance the tradeoff between exploration and exploitation, which is inspired by the collapse phenomenon in quantum measurement. Several simulated experiments of Markovian state transition demonstrate that QiRL is more robust to learning rates and initial states than traditional reinforcement learning. The QiRL approach provides an effective method for complex decision-making problems.
This paper investigates the potential of quantum-inspired algorithms to improve reinforcement learning (RL) policy optimization. Traditional RL methods often struggle with slow convergence and exploration challenges, particularly in complex environments. We propose a novel approach that draws inspiration from quantum mechanics, specifically superposition and entanglement, to address these limitations. Our algorithms aim to exploit superposition to simultaneously evaluate multiple action possibilities and utilize entanglement to model correlations between states, thereby accelerating the learning process. We present a framework for incorporating these concepts into RL, focusing on algorithmic design rather than a direct quantum simulation. The theoretical analysis suggests that our approach could significantly enhance exploration efficiency and, consequently, policy convergence rates. This work represents a direct application of quantum-inspired ideas to RL policy optimization, offering a potentially transformative pathway for developing more efficient and robust RL agents.
Quantum Machine Learning (QML) represents a paradigm shift in machine learning, leveraging quantum mechanical principles to accelerate computation and potentially unlock new algorithms. This paper investigates a novel reinforcement learning (RL) framework, termed "Adaptive Neural Network Reinforcement Learning" (ANNR), which employs dynamic parameter adjustment within a self-adaptive neural network to enhance learning efficiency and generalization capabilities. We demonstrate that this approach overcomes limitations of traditional RL methods, offering a promising path towards more robust and adaptable reinforcement learning agents. The core mechanism focuses on iteratively refining neural network weights through a feedback loop, enabling the system to explore complex environments effectively. The research explores the impact of parameter adjustment on both training speed and final performance across various RL tasks.
This paper presents a novel approach to reinforcement learning, leveraging the unique capabilities of quantum machine learning to develop an adaptive learning algorithm. Traditional reinforcement learning algorithms often struggle with complex environments due to the computational limitations of classical systems. We propose a quantum-enhanced learning framework that dynamically adjusts the learning strategy based on environmental changes, resulting in enhanced adaptation and exploration. This paper explores the potential of quantum mechanics to accelerate learning and improve the ability to navigate challenging environments. The core mechanism focuses on utilizing quantum entanglement and superposition to represent and update the state space more efficiently, facilitating faster convergence and the discovery of optimal policies. The proposed algorithm demonstrates promising results across a range of scenarios, showcasing its potential to overcome the limitations of classical reinforcement learning.