Investigation the problem of the shortest path in the movement of drones using adiabatic quantum computing

Davoodi Yeganeh, Hossein

Investigation the problem of the shortest path in the movement of drones using adiabatic quantum computing

Document Type : Original Article

Author

Hossein Davoodi Yeganeh

Quantum Research Center, Shahid Sattari University of Aeronautical Sciences and Technology Tehran, Iran

Abstract

Quantum computing can be more efficient than classical computing for many problems that have no solution with classical methods. Among the various quantum computing models, the adiabatic quantum computing model is widely used in the field of graph theory. The problem of finding the shortest path can be modeled using graphs, and this problem is of great interest due to its practical applications, such as in the movement of drones. In this article, the problem of the shortest path is investigated and solved using quantum adiabatic calculations. The problem is first mapped to a Hamiltonian expression, and then the dynamics of this Hamiltonian are studied using quantum adiabatic calculations. This model is then applied to a problem in the movement of drones, and the results show that quantum computing can be used effectively to solve shortest path problems in the movement of drones.

Keywords

Adiabatic quantum computing

shortest path

graph

quantum technology

drones