Mini-project
IT, Software & SaaS
Grover search on a quantum simulator
Implement Grover's search algorithm, and measure how its success changes with the number of steps and noise.
The brief
Quantum search finds an item among N in about the square root of N steps, but only if you stop at the right moment, and noise spoils it. Implement Grover's algorithm on a simulator, show how the chance of finding the item changes with each step, and add noise to see how it degrades. Good looks like: circuits you can explain, plots matching the theory, and a candid statement of what today's devices can and cannot do.
What you will build
- Learn qubits, gates and measurement
- Build the oracle and diffusion circuits
- Run for different numbers of items and steps
- Plot success probability against steps
- Add a noise model and repeat
- Compare with classical search cost
Free, open data to build it with
Sign up free to get the data and links
It takes a minute with your email. AiTeky Pass (₹999/month or ₹9,999/year) is free for your first 30 days.