QUANTUM PATHFINDERS: NAVIGATE THE SHORTEST ROUTE
Mohammad Sahil, Sapna Jain, Jamia Hamdard · International Journal of Engineering Applied Sciences and Technology · 2023
The problem of finding the shortest path between two points in a graph is a fundamental problem in computer science and has many applications in fields such as transportation, logistics, and networking. Dijkstra's algorithm is a classical algorithm commonly used to solve this problem, but its time complexity can be prohibitively high for large graphs. Quantum computing, on the other hand, offers a promising approach to solving this problem with significantly improved time complexity. In this research paper, we explore the potential of quantum computing for solving the shortest path problem, including an overview of Dijkstra's algorithm and its limitations, the quantum computing approach using quantum phase estimation, and a comparison of the time complexities of classical and quantum algorithms. We also discuss the challenges that need to be addressed for quantum computing to realize its potential in solving practical shortest-path problems.