Abstarct: One of the problems that is solved by quantum algorithms in a shorter time and higher speed compered to classical algorithms is the search problems. The Grover’s quan tum search algorithm, as one of the best quantum search methods is able to increase the speed of classical search from O(N) to O(√N). For large N this increase in speed is considerable. In this approach using the Clifford algebra we try to formulate Grover’s quantum search. We show firstly, that Clifford’s geometric algebra, provides a significantly simpler rep resentation than the conventional bra-ket notation, and secondly, that the basis defined by the states of maximum and minimum weight in the Grover search space, allows a simple visualization of the Grover search analogous to the precession of a spin 1 2 particle. We do not claim the development of an improved algorithm, but show in a tutorial paper that geometric algebra provides extremely compact and elegant exxpressions with improved clarity for the Grover search algorithm . at the end of the thesis, first we propose a new operat or and show that this unray operator acts like the Hadamard algorithm in Grover’s quantum search algorithm and with a high probability whit O(√N) lgorithm frequencyaccesses to the searched mode. the difrence is that this operator has an interesting physical concepte. the new operator is similar to the pauli matrice σy. next step, we concider another unray operator like T ′. to suporposition, from all basic modes we influence the proposed operator T ′ on the desired mode and the Grover’s quantum search algorithm for this problem. the goal is to find the proposed operator T ′ and first desired mode. we also checked that for how many repeats of new operator we achieve to the desired mode with high probability.