Quantum computers

posted by .

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. total of 2m+1 steps from the initial state), what is the resulting superposition? Note that you can describe the superposition by specifying two numbers, αy and αx for x≠y. You may use K to denote the total number of elements. (K should be uppercase.) HINT: You may want to review Problems 2, 3, and 5 of Assignment 6.

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. physics

    n 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?
  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>. (a) What was the state after the (m−1)th step?
  4. 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?
  5. 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 …
  6. 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 …
  7. 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 …
  8. Quantum Computing

    In this problem, we will carry out some steps of the quantum factoring algorithm for N=21. (a) What is the period k of the periodic superposition set up by the quantum factoring algorithm if it chooses x=2?
  9. 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?
  10. 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 …

More Similar Questions