Quantum Information Science I, Part 3

Bloch sphere representation of single qubit density matrix states

Effect of measurement on an ensemble of states

Classical communication complexity – distributed partial and total functions

Classical communication complexity for the distributed Deutsch-Jozsa problem

Classical fingerprinting with pre-shared randomness

Effect of single qubit rotation errors on the quantum code

Classical fingerprinting with UN-shared randomness

Equivalence of density matrices to partial trace computed in different bases

Classical linear code error syndromes

Failure of Simon's quantum algorithm to give exponential speedup over classical

Classical linear code minimum Hamming weight

General Hamming classical error correction codes

Classical linear codes – dual and self-dual codes

Hamming's classical error correction code and linear codes

Indistinguishability of density matrix ensemble unravelings

Classical linear error correction code distances

Introduction to quantum key distribution – history

Classical repetition code

Conjugate coding and quantum money

Density matrices and the partial trace – definition

Introduction to the fingerprinting problem

Density matrices and the partial trace – example

Measurements and density matrices

Density matrix properties

On the security of BB84 QKD