Posted by
**plz help** on
.

Suppose we ran m steps of Grover's algorithm on some function f (which has one marked element y) and the resulting superposition was exactly |y⟩.

(a) What was the state after the (m−1)-th step? Note that you can describe the superposition by specifying two numbers, αy and αx for x≠y. Use K to denote the total number of elements. (Sorry for not using the conventional letter N, but EdX grader doesn't seem to allow the use of that letter.) Please fully simply your answer. It has been pointed out on the forum that the grader does not understand that KK is equal to 1, so if you have an expression of this form, please convert it to 1 before submitting your answer.