CPSC 436Q: Quantum Computation (2025W1)

Instructor: Daochen Wang: wdaochen@cs.ubc.ca
TAs: Jonas Jäger: jojaeger@cs.ubc.ca, Mitali Nanda: mitalinanda0@gmail.com
Term: 2025 Winter Term 1 (September 3rd 2025 to December 5th 2025)
Logistics: Monday and Wednesday, 12:30pm - 2:00pm, MCLD Room 3014 (Floor 3)
Office hours: Assessment: 3 homework assignments (40%), 1 project (30%), 1 final exam (30%)
Discussion: Piazza

Schedule

Italicized entries are tentative.

DateTopicNotes/References
WedSept 3intro to quantum computinglecture 1
MonSept 8intro to quantum computinglecture 2

Overview

This is an undergraduate introductory course to quantum computation but assumes no prior knowledge of quantum information. Given previous student feedback, this course aims to be less abstract and spend more time on the basics compared to its initial offering.

Tentative list of topics:

Project

You will work in a team of 2-3 to write an expository paper on a topic of your choice from the quantum computation and information literature. You should submit a project proposal, a project progress report, and your completed paper. A list of candidate project topics, along with some commentary, will be released in late September. The list will be a superset of the list from the initial offering of this course. (You will not be disadvantaged if you choose a topic outside this list.)

Dates and guidelines (adapted from here):

Both the partial draft and final paper should be written in Latex using this template without any formatting changes.

Prerequisites

Prior knowledge of quantum information or physics is not a prerequisite. The prerequisites are (a) one of CPSC 203, CPSC 221 (covering classical algorithms), and (b) one of MATH 152, MATH 221, MATH 223 (covering linear algebra), and (c) one of STAT 251, MATH/STAT 302, ECON 325, ECON 327, MATH 318 (covering probability).

Resources

We will follow (i) the classic textbook Quantum Computation and Quantum Information by Nielsen and Chuang, (ii) a set of excellent lecture notes introducing quantum computation by John Watrous, and (iii) my lecture notes.

Recommended lecture videos: Ryan O'Donnell, Umesh Vazirani, John Watrous.

Policies

Policies and Resources to Support Student Success. In particular, note the Academic Concession policy, which covers unanticipated events or circumstances such as illnesses. Late policy: late homework or project documents will not be accepted except in cases of Academic Concession. Final exam policy: 2.5 hour handwritten exam with no notes or calculators allowed.


Template from Danica Sutherland