Grover’s Algorithm

Detailed Resources to Understand the Algorithm:-

• Quantum Computing Resources - For Beginners
• Topcoder's Tutorial on Grover's Algorithm
• Wikipedia - For complete details of this algorithm

Complexity:-

The time complexity for Grover's Searching Algo is O(sqrt(N)) where, N is the number of element in the set that is to be searched.

Live Contest for More Problems:-

• Topcoder's Fujitsu challenge – Quantum computing challenge using simulated annealing
• More To Be Added

Problem Statements

P-1. Implement the Grover’s Searching Algorithm that searches the target value from a set and plots the target value with the highest amplitude on Graph.

Implementation:- P1_grover_plot.py

More To Be Added

Note:- Python 3.5 or Greater is Recommended for Compiling

---

<p align="center"> A massive collaborative effort by <a href="https://github.com/OpenGenus/cosmos">OpenGenus Foundation</a> </p>

---