Quantum Information Science I, Part 3

A model of distributed quantum computation

A modified distributed Simon's problem with potential for quantum communication speedup

A story of QKD implementations: BB84 vs entanglement-based QKD

Action of unitary transform on density matrices

BB84 QKD: assumptions and real-world issues

Effect of depolarizing channel on the quantum code

BB84 QKD: classical post-processing for noise and privacy amplification

Effect of measurement on an ensemble of states

Bloch sphere representation of single qubit density matrix states

Effect of single qubit rotation errors on the quantum code

Classical communication complexity – distributed partial and total functions

Equivalence of density matrices to partial trace computed in different bases

Classical communication complexity for the distributed Deutsch-Jozsa problem

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

Classical fingerprinting with pre-shared randomness

General Hamming classical error correction codes

Classical fingerprinting with UN-shared randomness

Hamming's classical error correction code and linear codes

Classical linear code error syndromes

Indistinguishability of density matrix ensemble unravelings

Introduction to quantum key distribution – history

Classical linear code minimum Hamming weight

Introduction to the fingerprinting problem

Classical linear codes – dual and self-dual codes

Measurements and density matrices