Quantum Algorithms

Catalog description

This course utilizes the computational advantages offered by quantum information to design, analyze, and implement quantum algorithms, as well as to examine their significance in quantum computing. The course covers quantum algorithms such as quantum query algorithms, Grover’s unstructured search algorithm, phase estimation, Shor’s algorithm for integer factorization, and quantum algorithms for some number-theoretic problems such as the discrete logarithm (DL) and the hidden subgroup problem (HSP). Prerequisites: QTM 261 , CSE 374 .