CS 880 - Quantum Algorithms Spring 2021

Course Description

Remarkable results from the last three decades have given evidence that computers based on quantum mechanical principles could profoundly alter the nature of information processing. Efficient algorithms for breaking widely-used cryptographic systems, query efficient strategies for database searches, techniques like teleportation and superdense coding, and provably secure schemes for cryptographic key distribution have demonstrated how differently quantum information behaves, and how these properties can be exploited to solve certain computational tasks better than known classically.

This course focuses on the algorithmic aspects of quantum computing. We develop a quantum model of computation, and discuss known paradigms of efficient quantum computation, including amplitude amplification, phase estimation, and quantum walks. We apply them to computational problems such as satisfiability, the hidden subgroup problem (including integer factoring and discrete log), solving systems of linear equations, machine learning, optimization, and sampling.

Prerequisites

Knowledge of linear algebra at the level of Math 340, and familiarity with probability and algorithms is assumed. No specific knowledge of theoretical computer science is required; the necessary background will be provided. No knowledge of quantum physics will be assumed either.

Lectures

TR 9:30-10:45am online

Instructor

Dieter van Melkebeek