Let Bn denote the set of all n-bit strings and write N=2n. Let I denote the identity operator on n qubits and for G={x1,x2,…,xk}⊂Bn introduce the n-qubit operator
Q=−HnI0HnIG
where Hn=H⊗…⊗H is the Hadamard operation on each of the n qubits, and I0 and IG are given by
(a) Show that Q maps P to itself, and derive a geometrical interpretation of the action of Q on P, stating clearly any results from Euclidean geometry that you use.
(b) Let f:Bn→B1 be the Boolean function such that f(x)=1 iff x∈G. Suppose that k=N/4. Show that we can obtain an x∈G with certainty by using just one application of the standard quantum oracle Uf for f (together with other operations that are independent of f ).