quantum physics

posted by .

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?

q7: Which of the following observables correspond to a standard basis measurement?

q8: Which of the following observables correspond to a sign basis measurement?

q5: uppose 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.
(b) Now, if we run one more step (total of m+1 steps), what is the resulting superposition?
(c) What if you now apply another phase inversion?

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. maths

    1. A die labelled A has one face marked 1, one face marked 2 and the other four faces marked 3. A die labelled B has four faces marked 2 and two faces marked 3. The dice A and B are thrown. Calculate the probability is 5. I got 18/36 …
  2. 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 ?
  3. 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?
  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⟩. (a) What was the state after the (m−1)-th step?
  6. 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 …
  7. 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 …
  8. 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?
  9. 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 …
  10. 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. …

More Similar Questions