Abstarct: Quantum search algorithm which was proposed by Grover for the first time 1996,could find a particular option in O N ( ) orders among N option in which data was save disorderly. It was faster in comparison to the classic case which was in N/2 stages. Later,It was proved that a quantum algorithm cannot be written faster than it was. However,to enhance the precision of the search algorithm,a lot of efforts have been done to more and more make the possibility of reaching answers after computation . In 2004,Ahmad Younes suggested an algorithm for quantum search in which he could optimize the Graver’s algorithm applying some changes. By adding a target qubit to Ahmad Younes’s algorithm, a new algorithm will be developed and an interaction will be created between the target qubit and other qubits of system. This new target qubit increase the subspace of answers from 2 to 4 and consequently result in increase of probability of access to answers. As seen,in this case,possibility would be more successful rather than Ahmad Younes’s. By extending the case investigated,it will be showen that probability in success of this algorithm is more than Ahmad Younes’s algorithm at point M/N=6/10,7/10,8/10,9/10