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 networks and systems

Quantum Maze Solver: A Hybrid Quantum-Classical Approach for Pathfinding

Prashant Verma, Dinesh Kumar Vishwakarma

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-30008-9_3

Related papers

Quantum and classical processes combine to solve mazes

Physics Today•Feb 9, 2015•0 citations

Quantum vs Classical Pathfinding: Optimizing Time and Distance with QAOA, Grover’s, and Modified Dijkstra

Shaurya Pandey, Aditya Raj Thakur

International Conference on Computing, Communication and Automation•Nov 28, 2025•0 citations

The Shortest Pathfinding by a Quantum Walk

Leo Matsuoka, Kenta Yuki, Hynek Lavička +1 more

The Japan Society of Applied Physics•Jul 6, 2021•0 citations

Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing

Yuto Ishikawa, Takuma Yoshihara, Keita Okamura +1 more

In this study, the maze generation using quantum annealing is proposed. We reformulate a standard algorithm to generate a maze into a specific form of a quadratic unconstrained binary optimization problem suitable for the input of the quantum annealer. To generate more difficulty mazes, we introduce an additional cost function Qupdate to increase the difficulty. The difficulty of the mazes was evaluated by the time to solve the maze of 12 human subjects. To check the efficiency of our scheme to create the maze, we investigated the time-to-solution of a quantum processing unit, classical computer, and hybrid solver. The results show that Qupdate generates difficult mazes tailored to the individual. Furthermore, it show that the quantum processing unit is more efficient at generating mazes than other solvers. Finally, we also present applications how our results could be used in the future.

arXiv:2309.04792•Frontiers in Computer Science•Dec 7, 2023•7 citations

Extending the Hybrid Agent for Reinforcement Learning Beyond Fixed-Length Scenarios

Sefrin, Oliver, Wölk, Sabine Esther

In Quantum Reinforcement Learning, the "hybrid agent for quantum-accessible reinforcement learning" (Hamann and Wölk, 2022) provides a quadratic speed-up in terms of sample complexity over classical algorithms. This hybrid agent may be used in deterministic and strictly episodic environments, for which the maze problem is a standard example. With the current algorithm, however, the episode length (i.e., the number of actions to be played in an episode) is a hyperparameter which needs to be set. For scenarios such as mazes with an unknown distance towards the goal, this poses a problem, since a feasible episode length value is not known initially. In this work, we propose an adaption to the hybrid algorithm that uses a variable episode length selection strategy, allowing its usage in a wider range of maze problem scenarios. We test our novel approach against classical agents in various maze scenarios. Finally, we reason about conditions for which a quantum advantage persists.

•Mar 1, 2024•0 citations

Exponential speedup of quantum algorithms for the pathfinding problem

Jianqiang Li

arXiv:2307.12492•Quantum Information Processing•Feb 24, 2025•3 citations
In this study, the maze generation using quantum annealing is proposed. We reformulate a standard algorithm to generate a maze into a specific form of a quadratic unconstrained binary optimization problem suitable for the input of the quantum annealer. To generate more difficulty mazes, we introduce an additional cost function Qupdate to increase the difficulty. The difficulty of the mazes was evaluated by the time to solve the maze of 12 human subjects. To check the efficiency of our scheme to create the maze, we investigated the time-to-solution of a quantum processing unit, classical computer, and hybrid solver. The results show that Qupdate generates difficult mazes tailored to the individual. Furthermore, it show that the quantum processing unit is more efficient at generating mazes than other solvers. Finally, we also present applications how our results could be used in the future.
In Quantum Reinforcement Learning, the "hybrid agent for quantum-accessible reinforcement learning" (Hamann and Wölk, 2022) provides a quadratic speed-up in terms of sample complexity over classical algorithms. This hybrid agent may be used in deterministic and strictly episodic environments, for which the maze problem is a standard example. With the current algorithm, however, the episode length (i.e., the number of actions to be played in an episode) is a hyperparameter which needs to be set. For scenarios such as mazes with an unknown distance towards the goal, this poses a problem, since a feasible episode length value is not known initially. In this work, we propose an adaption to the hybrid algorithm that uses a variable episode length selection strategy, allowing its usage in a wider range of maze problem scenarios. We test our novel approach against classical agents in various maze scenarios. Finally, we reason about conditions for which a quantum advantage persists.