A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM

In this paper, we propose a new quantum algorithm for solving the minimum searching problem. This algorithm has the same order of time and space complexities as the algorithm proposed by Dürr and Høyer, but it provides a quadratic reduction in the number of measurements. In addition to the correctness and complexity analysis of the algorithm, we present simulation results considering an NP-hard problem.