CS 498QC: Introduction to Quantum Computing
(Spring 2025)

Course Information

Instructors: Makrand Sinha (msinha@illinois.edu) and Fernando Granha Jeronimo (granha@illinois.edu)

Credits: 4

TA: Yuchen Pang (yuchenp2@illinois.edu)

Time: Tuesdays and Thursdays 9:30 - 10:45 am

Location: 1304 Siebel Center for Computer Science

Office Hours: Fernando (Thursdays 10:45am-noon in Siebel 4336 or by appointment), Yuchen (Tuesdays 1-2pm in Siebel basement)

Lecture Recordings: Mediaspace (UIUC restricted)

Discussion Forum: Ed Discussion. You will automatically be enrolled the day before the first day of the instruction (the first day of instruction is January 21st) on your @illinois.edu email. All course announcenments, policies, discussions and homeworks will be available only on Ed Discussion. Instead of sending emails, students are encouraged to send direct messages to the course staff via the chat feature on Ed Discussion.

Homework Submission: Gradescope. You will automatically be enrolled the day before the first day of the instruction (the first day of instruction is Jaunary 21st) on your @illinois.edu email.

Course Description

This course aims to introduce the principles of quantum computing, laying a solid foundation for further advanced courses or research in quantum information. We will tentatively cover the following topics:


This course will take a theoretical computer science perspective on quantum computing. A background in quantum physics is not required, although it can be helpful.

Prerequisites

This will be a challenging theory course and a solid understanding of linear algebra, discrete math, probability theory, and algorithms and models of computation is important. In particular, a good background and comfort in the topics covered in CS 374 will be assumed.

Tentative Schedule (subject to changes)

  • 01/21: Overview of the field, what is a qubit? (slides, notes)
    Additional Resources: linear algebra review by 3Blue1Brown. A suggested textbook reference for linear algebra is Linear Algebra Done Right by Sheldon Axler. A digital version of this book can be accessed here.
  • 01/23: Single-qubit states, measurements, braket notation (notes)
    Pennylane tutorial: qubit basics
  • 01/28: Measurements (contd), global vs relative phase, Elitzur-Vaidman tester, quantum operations (notes)
    Pennylane tutorial: qubit basics
  • 01/30: Quantum operations (contd), Elitzur-Vaidman tester (contd) (notes)
    Pennylane tutorials: qubit basics, unitary matrices
  • 02/04: Multi-qubit systems, quantum circuits, entanglement (notes)
    Pennylane tutorials: multi-qubit systems, quantum circuits
  • 02/06: Quantum circuits (contd), partial measurements, EPR paradox (notes)
    Pennylane tutorial: quantum circuits
  • 02/11: EPR paradox (contd), Bell's theorem, CHSH game (notes)
  • 02/13: CHSH game (contd), no-cloning, teleportation (notes)
  • 02/18: Teleportation (contd), Holevo's theorem, basics of quantum computation (notes)
  • 02/20: Basics of quantum computation (contd), uncomputing garbage, universal gate sets (notes)
    Pennylane tutorial: entanglement and universal gate sets
  • 02/25: Deutsch's and Simon's algorithms (notes)
    Pennylane tutorial: Deutsch's algorithm
  • 02/27: Simon's algorithms (contd), Quantum Fourier Transform (notes)
    Pennylane tutorial: Quantum Fourier Transform
  • 03/04: Quantum Fourier Transform (contd), order finding (notes)
  • 03/06: Shor's algorithm (notes)
  • 03/11: No lecture
  • 03/13: Midterm
  • 03/25: TBD

Additional Resources

Grading Policy