Welcome to the homepage for the 2024 Fall offering of 98-106 StuCo: Intuitive Quantum Computing. Resources can be found around this page. After each lecture, slides will be posted to this page (when applicable).
Warning: Sometimes your browser will cache this page since it appears to be static. If you expect something to be on this page and cannot find it, refresh the page first and check if anything has changed.
98-106 is a new course on the fundamentals of quantum computing designed and taught by Jake Zaia. The goal is to break down concepts into a simple digestible form for a more thorough understanding that does not rely on the mindset of "shut up and calculate". The focus is on the computational aspects of quantum computing, and as such we will not dive heavily into the physics of quantum mechanics, or the engineering of quantum computers. Instead we focus on computational models, algorithms, complexity theory, and cryptography. This course is targeted at students with a moderate computer science background, particularly students in their 2nd to 3rd year of a computer science or related bachelors degree.
| # | Class Meets | Theme/Topic | Assignments |
|---|---|---|---|
| 0 | Aug 27 | Misconceptions About Quantum Computing / History of the Field | Reading: The syllabus |
| 1 | Sept 3 | Bits & Qubits I |
Reading: Chapter 1 of Quantum Computing Since Democritus "Atoms and the Void".
Available for free from the CMU library (including online as an ebook!), and in the files section of Canvas. |
| 2 | Sept 10 | Bits & Qubits II | Reading: SMBC: "The Talk" |
| 3 | Sept 17 | Quantum Circuits |
Reading: Quantum Computing for the Very Curious (This one is a bit longer, allot yourself 30 or so minutes)
Optional: Play around with quirk and create some circuits. See if you can find any unexpected behavior of qubits. |
| 4 | Sept 24 | Deep Dive: Superposition, Entanglement, & Interference | Reading: AlgAssert: YOU versus Bell Tests and the No Communication Theorem and AlgAssert: Unknowable, but Equal |
| 5 | Oct 1 | Quantum Teleportation | Reading: AlgAssert: The Quantum Version of the One-Time Pad is Teleportation |
| 6 | Oct 8 | Quantum Cryptography I -- Randomness, Elitzur-Vaidman Bomb, Verifiable Deletion | Reading: Scott Aaronson Blog: "Quantum Computing: Between Hope and Hype" (Not strictly related to lecture, but a great read). |
| -- | Oct 15 | No Class -- Fall Break | Enjoy Fall Break |
| 7 | Oct 22 | Quantum Cryptography II -- BB84 |
Reading: Read the write-up for the midterm project. You need not start coding until next week
Midterm project assigned. |
| 8 | Oct 29 | Programming Quantum Circuits (Qiskit) |
Reading: None
For class Today (Not Homework): Learning Qiskit Notebook Work on midterm project. |
| 9* | Nov 5 | Meeting by Zoom only -- Workshop: BB84 |
Go vote!
Work on midterm project. |
| 10 | Nov 12 | Demonstrating Quantum Advantage |
Reading: How the quantum search algorithm works (This one is a tad longer than usual)
Midterm project due. |
| 11 | Nov 19 | Shor's Algorithm |
Required Reading: Scott Aaronson Blog: "Shor I'll Do It"
Optional Reading: AlgAssert: Building your own Quantum Fourier Transform Optional: I made a web-based tool that lets you play with the values in Shor's algorithm and see how each intermediate step works, Shor's Algorithm Playground Final presentations topic selection/medium due next week. Read more in the final project writeup. |
| 12* | Nov 26 | Meeting by Zoom only -- Special Topics (Compiling Quantum Circuits) |
Enjoy Thanksgiving break!
Final presentations are next week. |
| 13 | Dec 3 | Final Presentations | Enjoy winter break! |
