Lecture 13. Grover's Quantum Search Algorithm

0:00 Quantum gates: rotations and Hadamard transform 8:02 Search problem 19:34 Grover's Algorithm: initial state 20:50 Geometry of reflections and rotations 24:18 Grover's Algorithms: basic reflections 37:33 Composition of two reflections 41:29 Grover's Algorithm: iterating compositions of basic reflections 46:34 Grover's Algorithm: analysis In this lecture we discuss Grover's quantum search algorithm. This quantum algorithm allows to find a special value in a set of size N using sqrt(N) steps. This is not possible to achieve with classical computers. This is a lecture in a graduate course "Quantum Computing". My book "Quantum Computing for High School Students" is available here: https://qubitpublishing.com/ or from Amazon. Complete playlist for this course:    • Quantum Computing (remastered)