MATH 3QC3, Winter 2019
INTRODUCTION TO QUANTUM COMPUTING
A traditional computer encodes information using long strings of 0’s and 1’s --- bits. A quantum computer uses quantum bits, or cubits, that demonstrate the phenomena of superposition and entanglement. Superposition is the ability of a quantum system to be in different states at the same time; entanglement is the correlation of two quantum particles, even potentially a long distance apart. A quantum computer takes advantage of its cubits by performing many computations simultaneously. In this course, we will look at some of the underlying theory (no physics assumed!) and also study some of the algorithms which have been written for potential quantum computers.
INSTRUCTOR: P. Speissegger
Postulates of quantum mechanics for finite dimensional systems; information on quantum bits, logical operations and quantum gates; quantum parallelism and complexity theory; examples of quantum algorithms.
Three lectures; one term
Prerequisite(s): One of MATH 2A03, 2X03 or ISCI 2A18 A/B; and MATH 2R03
PLEASE REFER TO MOSAIC FOR THE MOST UP-TO-DATE INFORMATION ON TIMES AND ROOMS