Quantum Information Science II, Part 3 - Advanced quantum algorithms and information theory

Grover search for multiple marked items

Polynomial quantum speedups in the oracle model

Quantum information theory 

Polynomial quantum speedups in the oracle model – AND OR tree

Quantum noisy coding theorem: quantum channel coding scenarios

Hamiltonian simulation – problem statement

Polynomial quantum speedups in the oracle model – collision problem

Hamiltonian simulation – using amplitude amplification

Quantum versions of Shannon's theorems: quantum data compression

The non-Abelian hidden subgroup problem – amplifying correctness probability

Polynomial quantum speedups in the oracle model – element distinctness

Realizing the QFT over Z_N using quantum phase estimation I

Hamiltonian simulation with amplitude amplification – linear combination of unitaries

The non-Abelian hidden subgroup problem – quantum algorithm and query complexity

Polynomial quantum speedups in the oracle model – graphs

Realizing the QFT over Z_N using quantum phase estimation II

Hamiltonian simulation with amplitude amplification – setup

The non-Abelian hidden subgroup problem – quantum algorithm idea

Proof of the converse of Shannon's noisy coding theorem – step 1

Proof of the converse of Shannon's noisy coding theorem – step 2

Reversible classical computation of x * y / N

Hamiltonian simulation with amplitude amplification – success probability amplification

The non-Abelian hidden subgroup problem – quantum measurement

Shannon's noiseless coding theorem and the Shannon entropy

Holevo Schumacher Westmoreland theorem