  We propose a new quantum circuit for the quantum search problem. The quantum
circuit is superior to Grover's algorithm in some realistic cases. The reasons
for the superiority are in short as follows: In the quantum circuit proposed in
this paper, all the operators except for the oracle can be written as direct
products of single-qubit gates. Such separable operators can be executed much
faster than multi-particle operators, such as c-NOT gates and Toffoli gates, in
many realistic systems. The idea of this quantum circuit is inspired by the
Hamiltonian used in the adiabatic quantum computer. In addition, the scaling of
the number of oracle calls for this circuit is the same as that for Grover's
algorithm, i.e. $O(2^{n/2})$.
