(Fall 2025) CS 599 P1:
Introduction to Quantum Computation

Course Overview: This course explores the fundamental principles of quantum computation, an emerging area at the intersection of quantum mechanics and computer science. Students will be introduced to key concepts in quantum theory, including superposition and entanglement, and computation, such as circuits and logical gates. The curriculum will cover essential algorithms such as Grover’s and Shor’s, and selected additional topics as time permits.

Course Information

bu



Instructor: Alexander Poremba
Time: Tuesday and Thursday (5pm - 6.15pm) from 09/02 to 12/10
Location: CDS 265 (665 Comm Ave, Center for Computing & Data Sciences)
Office hours: By appointment
Class: CS 599 P1 (Class no: 18375)
Units: 4 units

Prerequisites: B+ or higher in CS 132 or MA 242; or permission of instructor.
Designed for beginners, this course requires no prior knowledge of quantum physics or advanced mathematics—making it accessible to advanced undergraduates and graduate students who are curious about the potential of quantum technologies. Nevertheless, a solid background in linear algebra is strongly recommended.

Evaluation

Grading will take place based on a mix of homework sets, a midterm exam, scribe notes, as well as a final class project:

  • 25% Homework: There will be a total of four problem sets; these will be posted bi-weekly every other Tuesday and will be due two weeks later, Tuesday 11.59pm, on Gradescope. Each student can ask for one 48h extension, no questions asked.
  • 25% Midterm Exam: In-class (closed book, no notes) on Thursday, October 23rd.
  • 10% Scribe Notes: Type up LaTeX notes for one of the classes (due 11.59pm the day before the next class).
  • 40% Final Class Project: Prepare a 15 min presentation & written report (5-10 pages) on a selected topic.

Resources

Suggested Textbooks:

  1. Nielsen & Chuang: Quantum Computation and Quantum Information
  2. Wong: Introduction to Classical and Quantum Computing
  3. Kaye, Laflamme & Mosca: An Introduction to Quantum Computing

Useful Lecture Notes:

  1. Watrous: Understanding Quantum Information and Computation
  2. De Wolf: Quantum Computing Lecture Notes (University of Amsterdam)
  3. Aaronson: Introduction to Quantum Information Science (UT Austin)
  4. Preskill: Quantum Computing Lecture Notes (Caltech)

Similar Classes:

  1. Henry Yuen's class: COMS 4281: Introduction to Quantum Computing
  2. Dakshita Khurana's class & Makrand Sinha's class: CS 498QC: Introduction to Quantum Computing
  3. Andrea Coladangelo's class: CSE 434: Intro to Quantum Computation
  4. John Preskill's class: Ph229: Quantum Computing

Assignments

Homework: There will be a total of four homework assignments. These will be posted on Piazza every other Tuesday. Once posted, the homework assignments will be due 2 weeks later, Tuesday 23.59pm, on Gradescope.

Practice Worksheet: There will be a total of four practice worksheets. These will not be graded and are meant to help you refresh your memory on certain topics, e.g., complex numbers and linear algebra, or help you practice new material.

Schedule

The tentative class schedule is organized as follows:

  1. (Weeks 1-3) Basics of Quantum Information and Quantum Computation
  2. (Weeks 4-8) Fundamental Quantum Algorithms & Quantum Complexity Theory
  3. (Weeks 9-10) Mixed-State Formalism, Quantum Error Correction and Fault-Tolerance
  4. (Weeks 11-14) Quantum Cryptography & Selected Advanced Topics
  5. (Week 15) Final Student Presentations

Date Topic Notes
09/02 Introduction and Overview [Lec1]
09/04 The Qubit [Lec2]
09/09 Principles of Quantum Information [Lec3]
09/11 Measurements & Heisenberg Uncertainty Principle [Lec4]
09/16 Reversible Computing & Quantum Circuit Model [Lec5]
09/18 Quantum Entanglement & Quantum Teleportation [Lec6]
09/23 EPR Paradox & Bell's Theorem [Lec7]
09/25 Black-Box Oracles & Deutsch-Josza Algorithm [Lec8]
09/30 Simon's Algorithm [Lec9]
10/02 Quantum Fourier Transform [Lec10]
10/07 Quantum Phase Estimation [Lec11]
10/09 Shor's Algorithm [Lec12]
10/14 Canceled due to holiday substitution
10/16 Grover's Algorithm [Lec13]
10/21 Introduction to Quantum Complexity Theory [Lec14]
10/23 Midterm Exam
10/28 Midterm Review
10/30 Hamiltonian Complexity Theory
11/04 Variational Quantum Algorithms & Quantum Chemistry
11/06 Quantum Simulation
11/11 Density Matrix Formalism
11/13 Quantum Channels & Generalized Measurements
11/18 Introduction to Quantum Error Correction
11/20 Quantum Error Correction & Fault-Tolerance
11/25 Stabilizer Formalism
11/27 No class (Thanksgiving)
12/02 Quantum Cryptography
12/04 Quantum Advantage & Cryptographic Tests of Quantumness
12/09 Final Projects I
12/11 Final Projects II
12/12 Final Projects III

Class Policy

Collaboration policy: Collaboration on homework problems is permitted and encouraged, provided that it is limited to small groups of at most two students. You are free to collaborate in discussing answers; however, you must write up the solutions in your own words. This is to ensure that each student demonstrates a clear understanding of the solution and the material in the course. If you do collaborate on a homework set, you must specify the names of your collaborators in your submission. Additionally, you may make use of published material, provided that you acknowledge all sources used.

Academic conduct: All Boston University students are expected to maintain high standards of academic honesty and integrity. It is your responsibility to be familiar with the Academic Conduct Code, which describes the ethical standards to which BU students are expected to adhere and students’ rights and responsibilities as members of BU’s learning community. All instances of cheating, plagiarism, and other forms of academic misconduct will be addressed in accordance with this policy. Penalties for academic misconduct can range from failing an assignment or course to suspension or expulsion from the university.

Disclaimer