Quantum Physics
posted by helpless .
Let f:{0,1}^3→{0,1} with f(101)=1 and f(x)=0 for x≠101. In this question, we will run through two iterations of the algorithm.
(a) What is the superposition after the initialization step? Note that you can describe the superposition ∑x∈{0,1}3αxx> by specifying two numbers α101 and αx for x≠101.
Answer in this format: α101: αx for x≠101:
(b) After the phase inversion in iteration 1?
Answer in this format: α101: αx for x≠101:
(c) After the inversion about mean in iteration 1?
Answer in this format: α101: αx for x≠101:
(d) After the phase inversion in iteration 2?
Answer in this format: α101: αx for x≠101:
(e) After the inversion about mean in iteration 2?
Answer in this format: α101: αx for x≠101:
Respond to this Question
Similar Questions

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 ? 
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? 
Quantum Physics
Let f:{0,1}>{0,1} with f(101)=1 and f(x)=0 for x ≠ 101 . In this question, we will run through two iterations of the algorithm. (a) What is the superposition after the initialization step? 
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? 
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 … 
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 … 
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? 
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 … 
quantum physics
the quantum factor algorithm for N=91 is carried out. What is the period k of the periodic superposition set up if it chooses x=8? 
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. …