Abstarct: The quantum search algorithms whose basic principles were discovered by L.K.Grover, was able to find a specific element from an unstructured search space of size N, using approximately steps. Later, it was proved that there is no quantum search algorithm faster than this. Nevertheless, efforts continued to increase the accuracy of quantum search so that the probability of finding the answer becomes more and more. Ahmed Younes by modifying Grover’s method increased the probability of success from at least 50% in Grover’s algorithms to at least 87.88%. We formed a new algorithm by adding an extra target to younes’s algorithms and creating entanglement between new target with other qubits of system. Afterwards, we compared the first five iterations of two algorithms. Results of comparison showed that in all iterations the average of probability of success in new algorithms is more than pervious algorithms. Especially in first iteration, the probability of success for is ever more than corresponding iteration of younes’s algorithms.