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

Lecture notes in computer science

Exploring Hamiltonian Control of a Quantum Walk Environment via Reinforcement Learning: A Case Study on the Traveling Salesman Problem

Paweł Kotzbach, Wojciech Bożejko

Published Sep 20, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-36868-3_11

Related papers

Noise resilient quantum learning: Adaptive policy guided error mitigation in quantum reinforcement learning for the traveling salesman problem

Bisma Majid, Shabir Ahmad Sofi, Zamrooda Jabeen

Applied Soft Computing•Nov 21, 2025•2 citations

Reinforcement Learning for Quantum Control

Barry C. Sanders, Pantita Palittapongarnpim, Seyed Shakib Vedaie

Bulletin of the American Physical Society•Mar 7, 2018•0 citations

Quantum Walk-Based Optimization of Reinforcement Learning Policies

Jincheng Zhang

This paper investigates the potential of utilizing quantum walks to enhance the optimization of reinforcement learning (RL) policies. Traditional RL algorithms often struggle with exploring complex state spaces efficiently, leading to slow learning rates and suboptimal solutions. We propose a novel approach that leverages the inherent properties of quantum walks – superposition and interference – to accelerate the learning process. Specifically, we represent the RL environment as a graph and perform a quantum walk on this graph. The walk's quantum superposition allows for simultaneous exploration of multiple actions, drastically reducing the time required to converge to an optimal policy. We outline the theoretical framework, detailing the mathematical formulation of the quantum walk and its interaction with the RL environment. The core contribution lies in demonstrating how quantum walk's ability to explore multiple states concurrently can provide a significant advantage over classical approaches in optimizing RL policies. We present a conceptual model and a set of equations describing the process, highlighting the key elements for implementation. The results, while theoretical, demonstrate the feasibility and potential impact of this hybrid quantum-classical approach for tackling complex RL problems.

•Sep 3, 2026•0 citations

Reinforcement Learning Methods for Quantum Control

Michèle Desouter-Lecomte

•May 23, 2023•0 citations

Solving the Traveling Salesman Problem with Quantum Self-Attention Networks

Hao Li, Yue Ruan

The Traveling Salesman Problem (TSP), a well-known NP-hard problem, has intrigued computer scientists and mathematicians for over two centuries. In recent years, end-to-end deep reinforcement learning algorithms have been increasingly employed to tackle the TSP. However, these algorithms typically rely on classical neural networks, which face challenges such as a high number of training parameters and the necessity for large training datasets. This paper proposes a novel approach that integrates quantum computing with transformer modeling to address these challenges. By utilizing variational quantum circuits within the encoder and employing a quantum self-attentive neural network, we train the model using deep reinforcement learning algorithms. Experimental results on benchmark datasets demonstrate that the quantum self-attentive neural network model significantly outperforms existing classical neural network models. This new approach not only substantially reduces the number of training parameters and the size of the training dataset while solving the TSP problem, but also achieves superior optimization results compared to classical neural networks.

Cross Strait Radio Science and Wireless Technology Conference (CSRSWTC)•Nov 4, 2024•0 citations

Experimentally realizing efficient quantum control with reinforcement learning

Ming-Zhong Ai, Yongcheng Ding, Yue Ban +7 more

arXiv:2101.09020•Science China Physics Mechanics and Astronomy•Mar 10, 2022•31 citations
This paper investigates the potential of utilizing quantum walks to enhance the optimization of reinforcement learning (RL) policies. Traditional RL algorithms often struggle with exploring complex state spaces efficiently, leading to slow learning rates and suboptimal solutions. We propose a novel approach that leverages the inherent properties of quantum walks – superposition and interference – to accelerate the learning process. Specifically, we represent the RL environment as a graph and perform a quantum walk on this graph. The walk's quantum superposition allows for simultaneous exploration of multiple actions, drastically reducing the time required to converge to an optimal policy. We outline the theoretical framework, detailing the mathematical formulation of the quantum walk and its interaction with the RL environment. The core contribution lies in demonstrating how quantum walk's ability to explore multiple states concurrently can provide a significant advantage over classical approaches in optimizing RL policies. We present a conceptual model and a set of equations describing the process, highlighting the key elements for implementation. The results, while theoretical, demonstrate the feasibility and potential impact of this hybrid quantum-classical approach for tackling complex RL problems.
The Traveling Salesman Problem (TSP), a well-known NP-hard problem, has intrigued computer scientists and mathematicians for over two centuries. In recent years, end-to-end deep reinforcement learning algorithms have been increasingly employed to tackle the TSP. However, these algorithms typically rely on classical neural networks, which face challenges such as a high number of training parameters and the necessity for large training datasets. This paper proposes a novel approach that integrates quantum computing with transformer modeling to address these challenges. By utilizing variational quantum circuits within the encoder and employing a quantum self-attentive neural network, we train the model using deep reinforcement learning algorithms. Experimental results on benchmark datasets demonstrate that the quantum self-attentive neural network model significantly outperforms existing classical neural network models. This new approach not only substantially reduces the number of training parameters and the size of the training dataset while solving the TSP problem, but also achieves superior optimization results compared to classical neural networks.