This lesson is about Grover’s algorithm, which is a quantum algorithm for so-called unstructured search problems that offers a quadratic improvement over classical algorithms — meaning that Grover’s algorithm requires a number of operations on the order of the square-root of the number of operations required to solve unstructured search classically. Additional materials for this course, including written text, Qiskit implementations, and slides in pdf format, can be found on IBM Quantum Learning by following this link: https://learning.quantum.ibm.com/course/fundamentals-of-quantum-algorithms 0:00 — Introduction 1:28 — Overview 3:11 — Unstructured search 6:43 — Algorithms for search 10:10 — Phase query gates 12:50 — Algorithm description 16:05 — Solutions and non-solutions 18:22 — Analysis: basic idea 19:20 — Action of the Grover operation 24:16 — Rotation by an angle 27:57 — Geometric picture 31:54 — Setting the target 37:13 — Unique search 42:49 — Multiple solutions 44:43 — Number of queries 45:54 — Unknown number of solutions 51:13 — Concluding remarks #ibmquantum #learnquantum #qiskit