This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: April 6, 2006 Physics 681481; CS 483: Assignment #6 Searching for one of 4 items (please hand in after the lecture, Thursday, April 20) We explore here Grovers algorithm when it is applied to identify one of only four items. This turns out to be a special case in two ways. (1) The probability of success after just a single query of the oracle turns out to be exactly 1. (2) The general procedure for constructing W = 2  ih   1 out of Toffoli gates does not apply when the input register has only two qubits, and a different (simpler) construction must be used, special to the case  i = 1 2 (  00 i +  01 i +  10 i +  11 i ) . 1. To convince yourself that Grovers algorithm is not entirely uninteresting when N = 4, note that if you have a classical oracle that indicates which of four items is special, all you can do is apply the oracle to one randomly selected item after another. What is the mean number of queries of the classical oracle required to determine which item is special?mean number of queries of the classical oracle required to determine which item is special?...
View
Full
Document
 Spring '08
 Ginsparg

Click to edit the document details