Spring 2026 - CMPT 476 D100

Introduction to Quantum Algorithms (3)

Class Number: 5487

Delivery Method: In Person

Overview

  • Course Times + Location:

    Jan 5 – Apr 10, 2026: Wed, 1:30–2:20 p.m.
    Burnaby

    Jan 5 – Apr 10, 2026: Fri, 12:30–2:20 p.m.
    Burnaby

  • Prerequisites:

    MATH 232 or MATH 240, with a minimum grade of C-.

Description

CALENDAR DESCRIPTION:

An introductory treatment of quantum computing with an emphasis on quantum algorithms. Topics include the gate model of quantum computation focusing on the design and implementation of quantum algorithms. Basic knowledge of algorithms and complexity will be an asset, but not required. No prior knowledge of physics or quantum mechanics is necessary, only a solid background in linear algebra. Students with credit for MACM 476 may not take this course for further credit.

COURSE DETAILS:

Quantum computing is a computational paradigm which utilizes quantum mechanical effects at the physical level to process information. By using these quantum effects we can solve certain problems faster than the best known classical methods, such as factorizing integers, simulating quantum mechanical systems, and solving some linear systems. Since the advent of such algorithms in the 90's, researchers in computing science, mathematics, physics, chemistry, engineering, and other fields have been attempting to not only build quantum computers but also to understand their power.

This course offers an introductory treatment to the field of quantum information and computation with an emphasis on algorithms. We will examine how the above and other quantum algorithms work, as well as their implications on computational complexity and issues and techniques relating to their physical realization. By the end of this course, students should understand the basic model of quantum information and computation, key quantum protocols and algorithms, and leave with a broad knowledge of how such algorithms are implemented and what the primary challenges in doing so are, from their high-level mathematical expression down to the physical realization.

As quantum computing is still largely a theoretical topic, coursework will be primarily mathematical and proof-based. Some minor coding may be involved, but the primary purpose of the course is to understand how quantum algorithms work rather than to program them.

Topics

  • Quantum mechanics
  • Quantum information
  • Gate-model quantum computation
  • Key quantum algorithms
  • Quantum error correction and Fault Tolerance
  • Physical realization of quantum computation
  • Additional topics such as hybrid algorithms and NISQ (noisy, intermediate-scale quantum) computing, as per class interest

Grading

  • Final Exam 50%
  • Midterm Exam 25%
  • Assignments 25%

NOTES:

Grade distribution to be confirmed in the first week of class

REQUIREMENTS:

As quantum computing is an interdisciplinary field involving computer science, mathematics, and physics, the only formal requirements are satisfactory performance in linear algebra, which factors heavily into the course. However, students without experience in at least one of algorithms, complexity, abstract algebra, or quantum mechanics will likely find the course challenging. This course is normally intended to be taken in upper years after exposure to at least one of above topics.

Materials

RECOMMENDED READING:

An Introduction to Quantum Computing

Phillip Kaye, Raymond Laflamme, Michele Mosca,

ISBN: 978-0198570493

Quantum Computation and Quantum Information

Michael A. Nielsen, Isaac L. Chaung

ISBN: 9781107002173

REQUIRED READING NOTES:

Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.

Department Undergraduate Notes:

The following are default policies in the School of Computing Science. Please check your course syllabus whether the instructor has chosen a different policy for your class, otherwise the following policies apply.
 
  • Students must attain an overall passing grade on the weighted average of exams in the course in order to get a C- or higher.
  • All student requests for accommodations for their religious practices must be made in writing by the end of the first week of classes, or no later than one week after a student adds a course. After considering a request, an instructor may provide a concession or may decline to do so. Students requiring accommodations as a result of a disability can contact the Centre for Accessible Learning (caladmin@sfu.ca).

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

At SFU, you are expected to act honestly and responsibly in all your academic work. Cheating, plagiarism, or any other form of academic dishonesty harms your own learning, undermines the efforts of your classmates who pursue their studies honestly, and goes against the core values of the university.

To learn more about the academic disciplinary process and relevant academic supports, visit: 


RELIGIOUS ACCOMMODATION

Students with a faith background who may need accommodations during the term are encouraged to assess their needs as soon as possible and review the Multifaith religious accommodations website. The page outlines ways they begin working toward an accommodation and ensure solutions can be reached in a timely fashion.