We investigate the query complexity of quantum biased oracles.
Supposϵ that the biased oracles answer queries correctly with probability at least
1/2+ϵ .Given such an oracle, we present an algorithm to simulate a single query to an oracle that answers queries
COαecuy with probability at least 2/3, using
0(1/ϵ) queries to the given oracle.For searching problems, combining the algorithm with a known result.we can obtain an optimal algorithm.The simulating algorithm works effectively when we know the value of
ϵ .We also consider the situation where no knowledge about
ϵ is given.