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

International Conference on Computing, Communication and Automation

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

Shaurya Pandey, Aditya Raj Thakur

Published Nov 28, 2025• 0 citations
Publisher
DOI
10.1109/iccca66364.2025.11325258

Related papers

Quantum vs. Classical Routing: A Hardware-Aware Study of QAOA and Dijkstra with Constrained Shortest Path and Constraint-Preserving Mixers

Quang Bui

•Jan 1, 2026•0 citations

Adaptive Quantum Search for Service Path Optimization in Edge-Cloud and 6G Networks

Engin Zeydan, Madhusanka Liyanage

Service path optimization in large-scale edge–cloud 6G networks is computationally intensive due to multiple constraints, including latency, bandwidth, and energy. This article presentsGrover Adaptive Search (GAS)-enhanced Dijkstra, a hybrid classical-quantum approach that embeds an adaptive Grover schedule in a Dijkstra-based service path computation. By progressively narrowing the candidate set at each search step, GAS-enhanced Dijkstra reduces the oracle query count beyond what fixed-iteration quantum search achieves, while preserving path optimality. We evaluate it against seven classical routing algorithms and a fixed-iteration Grover baseline over six topology families. Under an idealized marked-item sampling model of the Grover subroutine, on 50-node graphs at edge density 0.7, GAS-enhanced Dijkstra needs 55% fewer oracle queries than a fixed-iteration Grover baseline running the identical threshold-descent loop, and a 4.8-fold lower quantum oracle-query count than the number of edge relaxations performed by classical Dijkstra, while retaining those classical relaxations itself. Benefits are limited in small or sparse networks.

IEEE Network•Jan 1, 2026•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

HYBRID QUANTUM ALGORITHMS FOR AUTONOMOUS VEHICLE NAVIGATION: DIRECTED PATH PLANNING WITH GROVER-QAOA

IDRIS KAGAN DEMIR, Seda Nur Gungor, Mehmet Karaköse

Path planning in complex and obstacle-constrained environments remains a challenging combinatorial optimization problem due to the exponential growth of the solution space and the limitations of classical algorithms in dynamic decision-making scenarios. Traditional approaches such as Dijkstra or A* may experience high computational costs and susceptibility to local optima when dealing with large-scale directed graphs containing obstacles. This study proposes a hybrid quantum computing approach that integrates the Grover Search Algorithm and the Quantum Approximate Optimization Algorithm (QAOA) to address optimal path planning on obstacle-oriented directed graphs. The Grover algorithm is first employed as an oracle-based filtering mechanism to detect and eliminate obstacle-containing edges, thereby generating a valid subgraph of feasible paths. Following this preprocessing step, QAOA is applied to the filtered graph within a nonlinear optimization framework to determine the minimum-cost path between source and destination nodes. The optimization model represents the graph as G=(V,E), where binary decision variables indicate whether an edge is included in the selected route while satisfying flow conservation constraints. By narrowing the solution space through Grover-based obstacle detection and performing optimization only on valid edges, the proposed method significantly reduces computational complexity compared to conventional approaches. Experimental analysis demonstrates that the hybrid quantum model effectively identifies optimal routes and adapts to different obstacle configurations while maintaining efficient convergence behavior. The results highlight the potential of integrating quantum search and quantum optimization techniques for solving combinatorial graph problems. This work contributes to the growing body of research on quantum-assisted optimization and demonstrates the feasibility of applying hybrid quantum algorithms to directed path planning problems relevant to autonomous navigation systems.

Quantum Journal of Engineering Science and Technology•Mar 31, 2026•1 citation

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

Prashant Verma, Dinesh Kumar Vishwakarma

Lecture notes in networks and systems•Jan 1, 2026•0 citations

Quantum Computing for Graph Optimization: An Approach to the Shortest Path Problem

Aniket Bembale, Nagendra Singh, P. Vinayaka +1 more

Lecture notes in networks and systems•Dec 1, 2025•0 citations
Service path optimization in large-scale edge–cloud 6G networks is computationally intensive due to multiple constraints, including latency, bandwidth, and energy. This article presentsGrover Adaptive Search (GAS)-enhanced Dijkstra, a hybrid classical-quantum approach that embeds an adaptive Grover schedule in a Dijkstra-based service path computation. By progressively narrowing the candidate set at each search step, GAS-enhanced Dijkstra reduces the oracle query count beyond what fixed-iteration quantum search achieves, while preserving path optimality. We evaluate it against seven classical routing algorithms and a fixed-iteration Grover baseline over six topology families. Under an idealized marked-item sampling model of the Grover subroutine, on 50-node graphs at edge density 0.7, GAS-enhanced Dijkstra needs 55% fewer oracle queries than a fixed-iteration Grover baseline running the identical threshold-descent loop, and a 4.8-fold lower quantum oracle-query count than the number of edge relaxations performed by classical Dijkstra, while retaining those classical relaxations itself. Benefits are limited in small or sparse networks.
Path planning in complex and obstacle-constrained environments remains a challenging combinatorial optimization problem due to the exponential growth of the solution space and the limitations of classical algorithms in dynamic decision-making scenarios. Traditional approaches such as Dijkstra or A* may experience high computational costs and susceptibility to local optima when dealing with large-scale directed graphs containing obstacles. This study proposes a hybrid quantum computing approach that integrates the Grover Search Algorithm and the Quantum Approximate Optimization Algorithm (QAOA) to address optimal path planning on obstacle-oriented directed graphs. The Grover algorithm is first employed as an oracle-based filtering mechanism to detect and eliminate obstacle-containing edges, thereby generating a valid subgraph of feasible paths. Following this preprocessing step, QAOA is applied to the filtered graph within a nonlinear optimization framework to determine the minimum-cost path between source and destination nodes. The optimization model represents the graph as G=(V,E), where binary decision variables indicate whether an edge is included in the selected route while satisfying flow conservation constraints. By narrowing the solution space through Grover-based obstacle detection and performing optimization only on valid edges, the proposed method significantly reduces computational complexity compared to conventional approaches. Experimental analysis demonstrates that the hybrid quantum model effectively identifies optimal routes and adapts to different obstacle configurations while maintaining efficient convergence behavior. The results highlight the potential of integrating quantum search and quantum optimization techniques for solving combinatorial graph problems. This work contributes to the growing body of research on quantum-assisted optimization and demonstrates the feasibility of applying hybrid quantum algorithms to directed path planning problems relevant to autonomous navigation systems.