# Is there a toy oracle to show the feasibility of Grover's algorithm?

Is there any small 'toy' oracle that can show the feasibility of Grover's algorithm for searching (without using the geometric rotation interpretation)?

It is confusing that we cannot know the solution of the search problem in one application of the oracle, as

1. The oracle can recognize for any candidate $$x$$ whether it is a solution or not.
2. The oracle is applied simultaneously to all candidates, as it is applied to an equal superposition at the beginning of the algorithm.

An example of an actual small 'toy' oracle would show why the above conjecture (find the solutions in one application of the oracle) cannot hold.

$$|00\rangle \otimes |0\rangle + |01\rangle \otimes |1\rangle + |10\rangle \otimes |0\rangle + |11\rangle \otimes |0\rangle$$
Now you need to figure out which of the basis states that are part of this superposition has the last qubit in the $$|1\rangle$$ state. If you just measure the last qubit, you get only 25% chance of getting the basis state that has 1 in the last bit (and produces the answer), and 75% chance of getting another state that won't produce an answer. It's the same as picking out a random input and checking whether it is the answer to the problem.