This course discusses the basics of quantum information; quantum phenomena; quantum circuits and universality; basics of computational complexity; relationship between quantum and classical complexity classes; simple quantum algorithms such as quantum Fourier transform; Shor factoring algorithm; Grover search algorithm; physical realization of quantum computation; error correction and fault tolerance.

Prerequisite(s): Physics 1202A/B or Physics 1402A/B or Physics 1502A/B or the former Physics 1302A/B, each with a minimum mark of 60%; Mathematics 1600A/B or Numerical and Mathematical Methods 1411A/B or the former Applied Mathematics 1411A/B, each with a minimum mark of 60%; Computer Science 1026A/B, Computer Science 2120A/B, or Engineering Science 1036A/B, each with a minimum mark of 70%, or Physics 3926F/G with a minimum mark of 60%; Applied Mathematics 2402A/B or Numerical and Mathematical Methods 2270A/B. Pre-or Corequisite(s): Numerical and Mathematical Methods 2276A/B or Physics 2110A/B.

Extra Information: 3 lecture hours.