This paper presents a quantum mechanical algorithm for searching an unsorted database of $N$ items, where only one item satisfies a given condition. The classical algorithm would need to examine at least $\frac{N}{2}$ items on average to find the desired item. However, the quantum algorithm can achieve this in only $O(\sqrt{N})$ steps by leveraging the superposition and interference properties of quantum mechanics. The algorithm involves initializing the system to a uniform distribution over all $N$ states, applying a series of quantum operations including phase rotation and diffusion transform, and then sampling the final state. The paper proves that the algorithm converges to the desired state with a probability of at least $\frac{1}{2}$ and shows that it is within a small constant factor of the fastest possible quantum algorithm for this problem. The algorithm is simpler to implement compared to other quantum algorithms due to the use of the Walsh-Hadamard transform and conditional phase shift operations. The paper also discusses potential extensions and applications of the algorithm, such as combining it with other quantum algorithms for more complex problems.This paper presents a quantum mechanical algorithm for searching an unsorted database of $N$ items, where only one item satisfies a given condition. The classical algorithm would need to examine at least $\frac{N}{2}$ items on average to find the desired item. However, the quantum algorithm can achieve this in only $O(\sqrt{N})$ steps by leveraging the superposition and interference properties of quantum mechanics. The algorithm involves initializing the system to a uniform distribution over all $N$ states, applying a series of quantum operations including phase rotation and diffusion transform, and then sampling the final state. The paper proves that the algorithm converges to the desired state with a probability of at least $\frac{1}{2}$ and shows that it is within a small constant factor of the fastest possible quantum algorithm for this problem. The algorithm is simpler to implement compared to other quantum algorithms due to the use of the Walsh-Hadamard transform and conditional phase shift operations. The paper also discusses potential extensions and applications of the algorithm, such as combining it with other quantum algorithms for more complex problems.