Grover Algorithm

1
Grover Algorithm

• Anuj Dawar

2
(No Transcript)
3
(No Transcript)
4
(No Transcript)
5
(No Transcript)
6
Another example
7
(No Transcript)
8
This is a better example of problems for Grover
9
Advantage of Grover, although not tractable
10
Example of oracle
11
Another example of Oracle, more realistic
12
tour
Answer bit or oracle bit
Working bits
13
(No Transcript)
14
Possible Exam Problems

• Formulate an oracle (reversible circuit) for the
  following problems
• 1. Graph coloring with of a planar map.
• 2. Graph coloring with the minimum number of
  colors of an arbitrary graph.
• 3. Satisfiability.
• 4. Set Covering.
• 5. Euler Path in a graph.
• 6. Hamiltonian Path in a graph.
• 7. Cryptographic Puzzle like SENDMOREMONEY.