Spring 2012

Days & Time: Tuesday and Thursday 4:10 - 5:25pm

Location: 417 Math

Instructor: A. Papageorgiou

physicsimageThis course is an introduction to the exciting new area of quantum computing. The lectures will be based on the text “Quantum Computation and Quantum Information” by M. Nielsen and I. Chuang, Cambridge University Press, 2000, and on handouts.

The algorithms of Shor for factorization, Grover for database search, and amplitude amplification for summation of Boolean and real functions will be covered. The emphasis will be on upper and lower bounds on the number of qubits and quantum queries needed to solve these problems. The quantum and classical complexity of a number of problems will be discussed. Exponential and polynomial speedups for quantum computing will illustrate the potential power of quantum computers.

Prior knowledge of quantum mechanics is not required, although would be helpful. Prerequisite is knowledge of linear algebra.

The homeworks and additional information can be found in the CourseWorks web page.