Quantum Physics

posted by .

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.

  • Quantum Physics -

    Please help!

  • Quantum Physics -

    display.cgi?id=1366086762

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. Quantum Physics

    In this problem, we will carry out some steps of the quantum factoring algorithm for N = 15 (a) What is the period k of the periodic superposition set up by the quantum factoring algorithm if it chooses x = 2 ?
  2. Quantum Physics

    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?
  3. Quantum Physics

    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⟩. If we run for m+1 additional steps (i.e. total of 2m+1 steps from the initial …
  4. physics

    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⟩. If we run for m+1 additional steps (i.e. total of 2m+1 steps from the initial …
  5. Quantum physics

    1] Let |ψ⟩=(2+i/3)|0>−(2/3)|1>. If we measure |ψ⟩ in the basis |u⟩=(1+i/2)|0>+(1−i/2)|1>, |u⊥>=1−i/2|0>−1+i/2|1>, what is the probability our outcome …
  6. quantum physics

    ass 6 q6:Now, consider the case where N4 elements are marked instead of just one. If we run one iteration of Grover's algorithm and measure, what is the probability that we see a marked element?
  7. Quantum Physics

    We will carry out some steps of the quantum factoring algorithm for N=91 (a) What is the period k of the periodic superposition set up by the quantum factoring algorithm if it chooses x=8?
  8. physics

    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⟩. If we run for m+1 additional steps (i.e. total of 2m+1 steps from the initial …
  9. Quantum computers

    PROBLEM 5 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⟩. PROBLEM 5A (4 points possible) If we run for m+1 additional steps (i.e. …
  10. Quantum Physics

    The variance σ2X=⟨(X^−⟨X^⟩)2⟩ of an operator, X^, is a measure of how large a range its possible values are spread over (the standard deviation is given by σ=σ2−−√). …

More Similar Questions