Scribd
Upload
67 views14 pages

Grover Algorithm: Anuj Dawar

This document discusses potential exam problems related to Grover's algorithm. It suggests formulating reversible circuit oracles for seven graph theory, logic, and cryptographic problems: 1) graph coloring of a planar map, 2) graph coloring with minimum colors of any graph, 3) satisfiability, 4) set covering, 5) Euler path in a graph, 6) Hamiltonian path in a graph, and 7) a cryptographic puzzle involving rearranging letters to form an equation. The document provides limited examples and explanation of Grover's algorithm and oracle design.

Uploaded by

Ashish Verma
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
67 views14 pages

Grover Algorithm: Anuj Dawar

This document discusses potential exam problems related to Grover's algorithm. It suggests formulating reversible circuit oracles for seven graph theory, logic, and cryptographic problems: 1) graph coloring of a planar map, 2) graph coloring with minimum colors of any graph, 3) satisfiability, 4) set covering, 5) Euler path in a graph, 6) Hamiltonian path in a graph, and 7) a cryptographic puzzle involving rearranging letters to form an equation. The document provides limited examples and explanation of Grover's algorithm and oracle design.

Uploaded by

Ashish Verma
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 14

Grover Algorithm

Anuj Dawar

Another example

This is a better example of problems for Grover

Advantage of Grover, although not tractable

Example of oracle

Another example of Oracle, more realistic

tour Answer bit or oracle bit

Working bits

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 SEND+MORE=MONEY.

You might also like