This skill focuses on the design and analysis of quantum algorithms, which exploit quantum mechanical phenomena to achieve computational advantages. Students will study landmark algorithms such as Grover's search and Shor's factoring algorithm, along with simpler introductory examples such as Deutsch's algorithm. The skill covers algorithmic structures, problem classes suitable for quantum speedup, and limitations of current algorithmic approaches. Learners will gain the ability to evaluate when quantum algorithms are useful and how they compare to classical methods.
External:
* Basic linear algebra
* Introductory quantum mechanics (helpful but not required)
Internal: * QC1 Quantum Computing Principles