Scribd
Upload
4 views29 pages

Grover's Algorithm

The document discusses Grover's Algorithm, a quantum computing method for solving the unstructured search problem, exemplified by finding a restaurant. It highlights the limitations of brute force searches and outlines the requirements and procedures of Grover's Algorithm, including the need for a quantum computer and the use of superposition and diffusion operators. The presentation concludes with contact information for further inquiries.

Uploaded by

Adarsh TK
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views29 pages

Grover's Algorithm

The document discusses Grover's Algorithm, a quantum computing method for solving the unstructured search problem, exemplified by finding a restaurant. It highlights the limitations of brute force searches and outlines the requirements and procedures of Grover's Algorithm, including the need for a quantum computer and the use of superposition and diffusion operators. The presentation concludes with contact information for further inquiries.

Uploaded by

Adarsh TK
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

CDAC Pune

Grover’s Algorithm
Qniverse Unlocked : Hands-on Aashay Pandharpatte
Quantum Computing Knowledge Associate
CDAC Pune
March 2026
The Search Problem

The Search Problem (That one restaurant…)


I don't remember the
I’ll help you out restaurant I went to
yesterday
The Search Problem

Brute force it … Ask until you find


it …
Restaurant Response

Bukhara No

Karim’s No

Ivory Fusion Bar No

⋮ ⋮

Moti Mahal Yes!!


The Search Problem

Brute force it …
Maybe you were a
Maybe try almonds psychic
in breakfast
The Search Problem

Wait a minute … Is that all we can do?


I do remember I
Probably Moti had north indian
Mahal meal
The Search Problem

How does this help ?


1. It allows us to narrow the search space.
(Restaurant names starting with “M”)
2. We can categorize the search space by some category (Indian, Chinese, Korean, etc)
The Search Problem

But what if we don't have this information ?


Are we stuck with brute force??
The Grover’s Algorithm …
The problems with brute force
Problems

1. The queries to the oracle must be minimized. (Alice doesn’t want to answer so many
questions.)

2. We can’t/don’t want to categorize the entire search space. (Categorize restaurants


by cuisine)
Is this relevant??
Yes definitely. Such a search problem is called unstructured search. An example, would be
to find the name a person just from their phone number.
Requirements of Grover’s algorithm
1. We need a phone book (data base) that can list each phone number (search query) to
a value (name)
Requirements of Grover’s algorithm
2. For a search space containing N phone numbers we need log2N qubit quantum
computer.
Procedure
Procedure
Procedure

Uniform superposition of all states


(phone numbers)
Procedure

The state we want to find.

Everything else
Procedure

This operator diffuses the state with respect to

Do this about times and you shall measure your target state with the

probability approximately 1.
How does this work??
For simplicity let's consider we have 8 phone numbers. Therefore we require 3 = log2(8)
qubits. Let try to find
Hadamard Operator
The Oracle
The Oracle
For
Diffusion

Notice that our target state has a larger amplitude


compared to the rest.
Diffusion
Diffusion
Diffusion
Geometric Intuition
Geometric Intuition
Geometric Intuition
Thank you!
Contact
aashayp@[Link]

You might also like