Week 1
Lesson 1
Introduction to Quantum Computing
This lesson serves as an introduction to quantum computing and contrasts it with classical computing. Both classical "bits" and quantum "qubits" are discussed, together with classical "not" gates and quantum "Hadamard" gates.
 Week 2
Lesson 2
Simple Arithmetical Model of Quantum Computing
This lesson describes a simple arithmetical model of what is going on inside a quantum circuit. The model is used to explain the strange behavior of quantum Hadamard gates. The "Misty" Python code base is introduced and the idea of "superposition" is explained.
 Week 3
Lesson 3
QuStates, Mists & the "Rudolph" Grid
This lesson involves a deeper understanding of single qubits and introduces the so-called "Rudolph" Grid. Two new single qubit quantum gates are introduced, together with a number of multi-qubit gates.
 Week 4
Lesson 4
Quantum Circuit Diagrams and Python Code
This lesson uses a number of examples of working with quantum circuit diagrams both via "pencil & paper" and the Python code.
 Week 5
Lesson 5
Superposition & Entanglement
This lesson is a deeper dive into quantum computing. We revisit the concept of superposition and discuss entanglement, measurement and the collapse of a quantum Mist object. Albert Einstein's ideas about entanglement are covered as well as the 2022 Nobel Prize in Physics.
 Week 6
Lesson 6
Quantum Arithmetic & the Bernstein-Vazarani Algorithm
This lesson involves a discussion of binary arithmetic and how a quantum computer can add one plus one and get two. We also discuss the Bernstein-Vazarani algorithm which is one of the first quantum algorithms to demonstrate the advantage that a quantum computer has over a classical computer.
 Week 7
Lesson 7
Quantum State Teleportation
Quantum State Teleportation is one of the canonical examples in the field of quantum computing. It is discussed in all the textbooks. It involves transferring the state of one qubit in a multi-qubit quantum system to a different qubit in the same quantum system. It's not exactly what you see in a re-run of Star Trek on TV but amazing all the same.
 Week 8
Lesson 8
The Classical "CHSH" Game 
We return to entanglement and discuss the CHSH game introduced by Clauser, Horne, Simony and Holt in 1969. Clauser is one of the recipients of the aforementioned 2022 Nobel Prize in Physics. The game is described in detail and a classical version is implemented with Python code.
 Week 9
Lesson 9
The Quantum "CHSH" Game
This lesson continues our discussion of the CHSH game and describes a quantum version of the game that is also implemented with Python code. The game has been played in real physics laboratories and the implications of it results regarding non-locality and "spooky action at a distance" are discussed.
 Week 10
Lesson 10
Wrap-Up
This lesson summarizes all the topics previously covered and ends with a discussion of the current state on quantum computing. We discuss, in particular, a major announcement made in December 2023 by physicists at MIT, Harvard and QuEra and what it may mean for the future of the field.