Quantum Computing: Foundations to Frontier

Course Number: CSC 2451 HF/MAT 1751 HF
Location: Bahen 1220
Date/Time: Wednesday 2-5pm
First meeting: September 12
Office hours: by appointment

Syllabus
Piazza discussion site
LaTeX template

Description

This course will give a broad overview of the field of quantum computing. We will start with a crash course in the fundamentals of quantum computing (qubits, quantum circuits, basic quantum algorithms such as Grover’s search algorithm and Shor’s factoring algorithm). Armed with the basics, we will then explore topics at the frontier of quantum computing: quantum simulation, quantum cryptography, connections with physics, quantum machine learning algorithms, and quantum supremacy. Students will make project presentations at the end of the course. This is a theoretical course that requires mathematical maturity and a strong background in linear algebra and probability theory.

Schedule (tentative)

Date Topic, Notes, and References
September 12 Administrativa. Basics of quantum information. [Slides] [Scribe notes]
September 19 Entanglement.
September 26 Quantum circuits and basic algorithms.
October 3 The Factoring algorithm.
October 10 Quantum computing and physics.
October 17 Quantum machine learning.
October 24 Quantum complexity theory.
October 31 Near-term quantum computing and quantum supremacy.
November 7 Reading week, no class
November 14 Quantum cryptography I.
November 21 Quantum cryptography II.
November 28 Grabbag.
December 5 Project Presentations