Last class! I’ll return the quizzes and do some fun stuff.

# Friday, December 9th

# Wednesday, December 7th

**Quiz the Fifth**

On this quiz:

- Coding theory definitions: codeword, code, alphabet, binary, ternary, n-ary, code and decode, length of a code, Hamming distance, Hamming weight, nearest neighbour decoding, error detection, error correction, information rate (AKA code rate)
- Coding theory notation: (n,M,d)-code, [n,k,d]-code or [n,k]-code
- what is a linear code
- information bits and check bits (or information symbols and check symbols)
- generating matrix of a linear code (G)
- parity check matrix of a linear code (H) and how to create it from G
- the minimum distance of a linear code in terms of minimum Hamming weight
- coset leaders and syndromes
- how to code to and decode with a linear code by use of coset leaders and syndromes
- codes to know, including such things as being able to derive n,M,d etc. : the triple repetition code (Example 1 page 393), the parity check code (Example 2 page 393), the 2D parity check (Example 3, page 394), the Hamming [7,4] linear code (Example 4, page 395)
- Bounds on codes: be able to prove the Singleton Upper Bound (top of page 403).
- Quantum Key Exchange, be able to explain how it all works, including the basic physics of polarized photons, and be able to implement it as Alice, Bob or Physics
- Quantum Computing: know mathematically what qubits are (unit vectors) and what operations a quantum computer can perform (unitary transformations). Be able to do the algebra/math of such a computation, e.g. create a NOT gate or CNOT gate, handle multiple qubits at once.
- Know the broad outlines of Shor’s algorithm sufficiently for giving a general description of the stages and principles (for example, what role does the quantum fourier transform play, what part does the quantum computer do and what part does the classical computer do afterward). I can’t ask you to implement it, since you aren’t a quantum computer.

# Monday, December 5th

We will finish Shor’s Algorithm. You can look ahead to the future post to see the quiz topics.

# Friday, December 2nd

Quantum Computing today.

# Wednesday, November 30

I will do FCQs today. Please bring back your worksheet for Quantum Key Exchange, as we will continue that to make sure we get a run-through.

# Monday, November 28th

**Happy Thanksgiving, all! Please enjoy family and friends, and recover your energy.**

On Monday, we’ll start quantum matters by talking about Quantum Key Exchange. It’s a fun topic — there’s more physics than math, actually. See you then, hopefully refreshed.

Please remember to work on Mission 8 over the break. It’s a lot of work to leave for the last minute, and spread-out studying is the most effective.

# Friday, November 18

Keep working on your Mission 8.

In class we’ll tie up the loose ends in coding theory, so please bring back your worksheet from Wednesday.

# Wednesday, November 16th

**To do for class:**

- I suggest you do at least one of your ten topics for Mission 8 (don’t leave it all for the last minute!)
- We will do a coding-theory worksheet in class, which will give you good hands-on practice with Monday’s material.

# Monday, November 14th

**Notes:**

- Quizzes and homeworks will be returned.
- You can check grades on D2L
- I will shortly post the very last assignment, Mission 8

# Friday, November 11th

Have a relaxing rest of your week; on Friday I’ll post some homework. In-class we’ll talk more about coding theory. If you are missing class, or missed Monday’s class, make sure you are caught up reading Chapter 18, Sections 1,2,4.