Module 7
Explore fundamental quantum algorithms and understand how they provide advantages over classical approaches.
Understand why and where quantum computers provide provable speedups. Study quantum parallelism, Grover search quadratic speedup, and the Quantum Fourier Transform.
Understand what separates quantum algorithms from classical algorithms: complexity classes BPP vs BQP, and true quantum speedup.
Understand how a single quantum circuit evaluates a function f(x) across 2^n inputs simultaneously via a quantum oracle.
Master the historic algorithm that first proved an exponential separation between classical and quantum computing.
Master the crown jewel of unstructured search: the Phase Oracle, Inversion about the Mean (Diffusion Operator), and O(sqrt(N)) speedup.
Understand the quantum analogue of the Discrete Fourier Transform: transforming computational basis states into phase frequencies in O(n^2) gates.
Synthesize Module 7: implement, simulate, and verify Shor’s period-finding core and Grover’s search in an end-to-end Python pipeline.