Quantum Computation

A short informal introductory course.

Time and place: Tue and Wed 10.45-12.30.
On May 9, 10: Pav NP29.
Afterwards: Auditorium 13.

Contents

May 9: Axioms and philosophy of quantum mechanics. Stern-Gerlach and Double-split experiments. Heisenberg uncertainty relation. Bell inequalities.

May 10: Tensor products. Entanglement. Revised philosophy. Quantum computation. Qubits. Pauli operators. No cloning. Basic gates: Hadamard, Phase shift, Controlled not. Universal gates, Toffoli gate. Deutsch's algorithm. Grover's search algorithm.

May 16: Quantum teleportation. Superdense coding. Shor's integer factorization algorithm. Simon's finding the Hidden Subgroup. Discrete logarithms.

May 17: Lower bounds for the quantum complexity. Quantum cryptograpy: Bennett-Brassard key exchange, Ekert key exchange. Experimental status. Quantum error-correction following Calderbank-Shor-Steane.

May 23: Formulation of quantum mechanics in terms of density operators. Subsystems. Partial trace. Purification. More quantum error-correction. Fidelity. Stabilizer codes. Threshold theorem.

Literature

M.A. Nielsen & I.L. Chuang, Quantum computation and quantum information, Cambridge, 2000.

See also http://xxx.lanl.gov/abs/quant-ph/ (or http://www.arxiv.org/).