1 / 33

Grover. Part 2

Grover. Part 2. Components of Grover Loop. The Oracle -- O The Hadamard Transforms -- H The Zero State Phase Shift -- Z. O is an Oracle. H is Hadamards. Z is Zero State Phase Shift. H is Hadamards. Grover Iterate. Inputs oracle. This is action of quantum oracle.

elisabeth-newton
Download Presentation

Grover. Part 2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Grover. Part 2

  2. Components of Grover Loop • The Oracle -- O • The Hadamard Transforms -- H • The Zero State Phase Shift -- Z O is an Oracle H is Hadamards Z is Zero State Phase Shift H is Hadamards Grover Iterate

  3. Inputs oracle This is action of quantum oracle We need to initialize in a superposed state

  4. This is a typical way how oracle operates This is a typical way how oracle operation is described Encodes input combination with changed sign in a superposition of all

  5. Role of Oracle • We want to encode input combination with changed sign in a superposition of all states. • This is done by Oracle together with Hadamards. • We need a circuit to distinguish somehow globally good and bad states.

  6. Vector of Hadamards

  7. Notation Reminder a Control with value a=1 a a Control with value a=0 Control with value a=0 equivalent

  8. Zero State Phase Shift Circuit All information of oracle is in the phase but how to read it? Flips the data phase This is value of oracle bit This is just an example of a single minterm, but can be any function

  9. Flips the oracle bit when all bits are zero Rewriting matrix Z to Dirac notation, you can change phase globally This is state of all zeros

  10. With accuracy to phase + =

  11. Here you have all components of Grover’s loop This is a global view of Grover. Repeatitions of G In each G

  12. Generality • Observe that a problem is described only by Oracle. • So by changing the Oracle you can have your own quantum algorithm. • You can still improve the Grover loop for particular special cases

  13. Grover iterate has two tasks: (1) invert the solution states and (2) invert all states about the mean Here we explain in detail what happens inside G. This can be generalized to G-like circuits proof

  14. Will be explained in next slide Explanation of the first part of Grover iterate formula Here we prove that |> <  |used inside HZH calculates the mean a Vector of mean values

  15. From previous slide ( ) ( ) What does it mean invert all states about the mean? This proof is easy and it only uses formalisms that we already know.

  16. Positive or negative amplitudes in other explanations Amplitudes of bits after Hadamard For every bit All possible states

  17. Amplitudes of bits after one stage of G This value based on previous slide

  18. This slides explains the basic mechanism of the Grover-like algorithms

  19. Additional Exercise You can verify it also in simulation This is a lot calculations, requires matrix multiplication

  20. Here we calculate analytically when to stop The equations taken from the previous slides “Grover Iterate” For marked state For unmarked state

  21. recursion We want to find how many times to iterate We found k from these equations

  22. But you can do better if you have knowledge, for instance the upper bound of chromatic number in graph coloring

  23. Grover search example. • Here is an example of Grover search for n = 3 qubits, where N = 2n=8. • We omit reference to qubit n+1, which is in state 1 /√2 (|0>−|1>i) and does not change. • The dimension of the unitary operators for this example is thus 2n= 8 also.)

  24. oracle • (Remember that numbering starts with 0 and ends with 7, so that the -1 here is in the slot for |5>.) • This matrix reverses the sign on state |5>, and leaves the other states unchanged. • Suppose the unknown number is |a> = |5>. • The matrix or black box oracle Ufa is

  25. The Walsh matrix W8 is Now we use normalization

  26. The matrix −Uf0 is

  27. This matrix changes the sign on all states except |0>. Finally, we have the repeated step RsRain the Grover algorithm: hadamards oracle shift

  28. After second rotation we get

  29. Summary and our work When you know anything about the problem (symmetry, observation, bounds, function within some classification class) you can design a better Grover like algorithm but for your data only. This is enough in real life like CAD or Image Processing, since data are always specific, not the worst case data as in Mathematic proofs

  30. Problem for students • Build the Grover algorithm for ternary quantum logic. • First you need to generalize Hadamard transform to Chrestenson transform. • Next you need to have some kind of ternary reversible gates to build oracle. • The same gates will be used for Zero State Phase Shift circuit.

More Related