We propose a quantum search method based on Grover's algorithm. This algorithm is described and we show that to search for a single marked element from an unsorted search space of "N" elements, the number of queries are required using this algorithm "O(N^(1/3))" when compared to "O(√N)" for the Grover algorithm.