Comparison between New Quantum Approaches for Finding the Minimum or the Maximum of an Unsorted Set of Integers

摘要

The change has already begun. It is not a simple change but a revolution in the sense of speed and its impact. In this paper, we are going to discuss on Quantum Computer as a Physical System and discuss on its main weakness and then based on our new approach, we have solved a problem for finding the minimum or the maximum of a set of integers, which has not been solved based on previous. Quantum Computing Approach with Time Complexity about O(1) and then we Evaluate and Comprise it with another Quantum Algorithm with Time Complexity about O(1+n{sup}(1/n)), which also is given by us and as a result we show that if the size of Quantum Resister is low then our first Quantum Approach which has lower. Time Complexity is satisfactory and if the size of Quantum Register is high, then as the Probability of Success of our first Approach decreases so our Second Approach is more convenient.