We'll take a look at your very first practical quantum algorithm: Grover's Algorithm! If the name sounds familiar, it was mentioned in the "Why Quantum Computing?" (https://www.youtube.com/watch?v=Xp15nyfhAm4) workshop and provides a polynomial speedup for unstructured search problems. You are still encouraged to bring your laptops with you, there is a code-interactive component! You are also encouraged to revisit the repository (https://github.com/QC-at-Davis/Deutsch-Jozsa-II-Qubit-Viz) for last weeks content, it has been tidied up and linked with another set of older QCaD workshops that may be of interest in the README.md.
Slides: https://docs.google.com/presentation/d/1AQUBcq70YlxuNOd8iOMYsruBpOzyMpm_lxZ1Xwb7S78/edit?usp=sharing
Repository: https://github.com/QC-at-Davis/Grovers-Algorithm
