Sunday
December 21, 2014

Homework Help: Quantum Physics

Posted by helpless on Sunday, March 24, 2013 at 2:53am.

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. Please fully simply your answer.
Answer in this format: αy: αx for x≠y:

(b) Now, if we run one more step (total of m+1 steps), what is the resulting superposition?
Answer in this format: αy: αx for x≠y:

(c) What if you now apply another phase inversion?
Answer in this format: αy: αx for x≠y:

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

physics - Suppose we ran m steps of Grover's algorithm on some function f (which...
Quantum Physics - Suppose we ran m steps of Grover's algorithm on some function ...
Quantum computers - PROBLEM 5 Suppose we ran m steps of Grover's algorithm on ...
physics - Suppose we ran m steps of Grover's algorithm on some function f (which...
quantum physics - ass 6 q6:Now, consider the case where N4 elements are marked ...
Quantum Physics - Suppose we ran m steps of Grover's algorithm on some function ...
Quantum Physics - In this problem, we will carry out some steps of the quantum ...
Quantum Physics - We will carry out some steps of the quantum factoring ...
physics - n this problem, we will carry out some steps of the quantum factoring ...
physics - In this problem, we will carry out some steps of the quantum factoring...

Search
Members