Computer Science
Tel-Aviv University

0368.4057
Quantum Computing

Lectures	Thursday 12:00-15:00, Dan David 110
Instructors	Amnon Ta-Shma \| Schreiber 127 \| 5364 Oded Regev \| Schreiber 220 \| 5379
Textbooks	Quantum Computation and Quantum Information, M. Nielsen, I. Chuang Classical and Quantum Computation, A. Yu. Kitaev, A. H. Shen, M. N. Vyalyi
Lecture notes on the web	Topics in Quantum Information, by Ashwin Nayak. Quantum Computation, by John Preskill. More lecture notes on his page. Quantum Computation, by Umesh Vazirani.
Links	Our course announcement Some interesting blogs by Michael Nielsen, Dave Bacon quant-ph, a repository for all quantum-related research papers

Date	Class Topic
Nov 3	One qubit, two qubits, pure states, unitary matrices, X, Y, Z, CNOT, CNOT does not duplicate a qubit (2 hours)
Nov 10	Some more math (Dirac's bra/ket notation, tensors), Quantum teleporation, measurements in other bases, superdense coding
Nov 17	EPR and Bell inequalities, simulating classical circuit by quantum circuits, effects of garbage, Deutsch's algorithm
Nov 24	The Fourier transform over Z_2^n, Deutsch-Jozsa algorithm, Bernstein-Vazirani algorithm, Simon's algorithm
Dec 1	More on BQP, RSA, Fourier transform over Z_N and the QFT circuit
Dec 8	Period finding, Order finding, Shor's factoring algorithm
Dec 15	Discrete Log, Phase estimation
Dec 22
Dec 29	The black-box model. BBBV lower bound for the OR function. Grover’s box.
Jan 5	Estimating the number of solutions using phase estimation. A general lower-bound on quantum black-box computation by polynomials. Black-box computation can not provide more than a polynomial speedup for total, Boolean functions.
Jan 12	A sqrt{n} quantum communication protocol for the disjointness function.
Jan 19
Jan 26
Feb 2

Mar 9
Mar 16
Mar 23
Mar 30
Apr 6
Apr 27
May 4
May 11
May 18
May 25
Jun 8
Jun 15