A New Searching Problem Solved by Quantum Computers

It is well known that a quantum computer can search more quickly than a classical computer in solving the so-called Grover-searching problem. We present a new searching problem which cannot be classified into Grover's problem and can be solved by using the modified searching iterations with the same efficiency of Grover's problem.