Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2022/ii/paper-4/10d/d/solution

Use the construction in part (c) for the marked-state phase reflection in each Grover search algorithm iteration. Every such reflection costs one query to ; the identity-oracle circuit, Hadamard gates, and are independent of .
Starting from , after iterations the success probability is
by the Grover rotation angle. Choose an integer
Then differs from by at most , so
For every sufficiently large this is greater than , while
Thus measuring the search register determines the faulty input with the required constant success probability using oracle queries.

New to topics? Read the docs here!