An Overview of Foundational Quantum Algorithms

This course provides a rigorous yet accessible introduction to the foundational algorithms of Quantum Computing. It starts from the principles of Quantum Information Theory and gradually builds toward the famous Quantum Algorithms that form the foundation of modern Quantum Computing. Rather than simply presenting algorithms as recipes, the course explains the underlying concepts, mathematical principles, theorems, and proofs in a clear and digestible way. This enables participants to develop a deeper understanding of why Quantum Algorithms work and how their different building blocks can be combined. Key concepts such as Superposition, Entanglement, Interference, Quantum Oracles, Amplitude Amplification, Phase Zstimation, and the Quantum Fourier Transform are explored through the algorithms in which they play a fundamental role. The course covers landmark algorithms including Quantum Teleportation, Deutsch, Deutsch-Jozsa, Bernstein-Vazirani, Grover’s, and Shor’s algorithms, together with an example from Quantum Game Theory. Participants will also learn how to translate the mathematical and theoretical concepts into practical Quantum Circuits and code.
A particular objective of the course is to develop the skills required to read and understand advanced Quantum Computing research papers that build upon these foundational concepts and algorithms.