| Lecture date | Topics | Notes |
|---|---|---|
| Jan 14 | Qubit states, single qubit gates | Lecture note |
| Jan 16 | Multi-qubits gates, controlled gates, circuit notations | Lecture note |
| Jan 21 | Multi-controlled gates, initialization, termination and measurement gates | Lecture note |
| Jan 23 | Teleportation, Clifford gate set, universal gate sets | Lecture note. Recommended reading: "On Universal and Fault-Tolerant Quantum Computing" by Boykin et al. "Both Toffoli and Controlled-NOT need little help to do universal quantum computation" by Shi. Homework 1 is available. |
| Jan 28 | Clifford+T implementation of Toffoli gate, T-gate via T-state | Lecture note. Recommended reading: "Quantum circuits of T-depth one" by Peter Selinger. "Lower bounds on the non-Clifford resources for quantum computations" by Beverland et al. |
| Jan 30 | Simply typed lambda calculus | Lecture note. |
| Feb 4 | Type inference and Type inhabitation | Lecture note. |
| Feb 6 | Call-by-value, unit type, sum types and empty type | Lecture note. |
| Feb 11 | Introduction to linear types | Lecture note. Homework 2 is available here. |
| Feb 13 | Evaluation of a linear type system | Lecture note. |
| Feb 18 | Examples of Evaluation | Lecture note. |
| Feb 20 | Haskell101 | Haskell file. CSCE 550 Class website. Haskell tutorial: learn you a haskell. |