Question

5. (Grover's Algorithm) Let > be the uniform superposition of all possible ΤΣΙΧ >2. Assume that the inputs for the case n-2, that is. Ιφ >2 distinguishsed value that is the object of the search is a12210>2. (a) Define an oracle f that determines whether or not a two bit integer is the special value a being sought. (b) If V 1-12 >2. (c) If w 2|ф >2 110 >2? (e) How many applications n of the composite operator WV are required to bring (WV)" Ip >2 as close to la > as possible prior to measurement?

Answer 1

ふ.sd./ all swe. 0 aus um e s PYocerm ea Me reps So apryig 1 m on 197-12>< 21の v 147 : e)e-) CSI Scanned W, \K) -내0)

e Wo hen 2 2 1 Note s the en m uamtu Foun ien Scannedwith

LAm We we th e 2. 0 ト1 2 1 n