This being the first time I have taught this material for an entire semester (and the first time ever for much of it), the syllabus will initially be quite vague, representing my intentions and goals for the course. It will become better defined as we proceed and see what can reasonably be accomplished. You should consult the syllabus often because it will change as the course evolves.

You can register either for a letter grade or for the credit/no-credit (CR/NC) option. If you are registered for a letter grade, the grade will be determined by your total homework score: 70%-100%, A; 40%-70%, B; below 40%, C. To receive a CR under the CR/NC option, your homework score must be 40% or above.

Although the syllabus shows three homework assignments, one for each of the major topics in the course, the homework problems will actually be assigned individually. Each problem will be posted as soon as it is available. Each will have its own due date, no later than the last date shown on the syllabus, but often earlier. The solution will be posted shortly after the problem is due.

Homework	Class session	Lectures	Nielsen and Chuang Errata	Preskill
HW #1 1.1 (ps): Due 1-31 Solution 1.1 (ps) 1.2 (ps): Due 2-2 Solution 1.2 (ps) 1.3: Due 2-9 Solution 1.3 1.4: Due 2-9 Solution 1.4 1.5: Due 2-21 Solution 1.5	T, 1-17	Introduction to course L1: Classical circuit model	1.1-1.4 4	1.1-1.6 6.1-6.3
	Th, 1-19	L2: Quantum circuit model. Introduction
	T, 1-24	No lecture
	Th, 1-26	No lecture
	T, 1-31	L3: Quantum gates and controlled operations. I L3-4
	Th, 2-2	L4: Quantum gates and controlled operations. II
	T, 2-7	No lecture
	Th, 2-9	L5: Universal quantum gates
	T, 2-14	No lecture
	Th, 2-16	L6: Measurement-based quantum computation. I L6-7
	T, 2-21	L7: Measurement-based quantum computation. II
HW #2 2.1: Due 2-28 Solution 2.1 2.2: Due 3-7 Solution 2.2 2.3: Due 3-30 Solution 2.3	Th, 2-23	No lecture
	T, 2-28	L8: Cluster-state quantum computation. I
	Th, 3-2	L9: Cluster-state quantum computation. II
	T, 3-7	No lecture
	Th, 3-9	No lecture
	T, 3-14	Spring Break
	Th, 3-16	Spring Break
	T, 3-21	L10: Quantum Fourier transform L10-11	1.4 4.7 5 6	1.3-1.6 6.3-6.12
	Th, 3-23	L11: Quantum phase estimation algorithm
	T, 3-28	L12: Applications of the quantum Fourier transform. I L12-13
	Th, 3-30	L13: Applications of the quantum Fourier transform. II
HW #3 3.1 (ps): Due 4-4 Solution 3.1 3.2 (ps): Due 4-13 Solution 3.2	T, 4-4	L14: Quantum search algorithms
	Th, 4-6	No lecture
	T, 4-11	L15: Hidden-subgroup problem
	Th, 4-13	L16: From classical error correction to Shor's 9-qubit code. I L16-17a	10.1-10.2	1.7-1.8 7.1
HW #4 4.1 (ps): Due 5-9 Solution 4.1 4.2 (ps): Due 5-9 Solution 4.2 (ps) 4.3 (ps): Due 5-9 Solution 4.3 (ps)	T, 4-18	L17a: From classical error correction to the nine-qubit code. II L17b: Reversible operations and quantum error correction. I
	Th, 4-20	L18: Reversible operations and quantum error correction. II L17b-18	10.3	7.2-7.4
	T, 4-25	No lecture
	Th, 4-27	L19: Classical linear codes and CSS quantum codes. I L19-20	10.4	7.5-7.8
	T, 5-9	L20: Classical linear codes and CSS quantum codes. II
	M, 5-22	L21: Stabilizer codes. I Notes on the stabilizer formalism (ps)	10.5	7.9-7.16
	M, 5-22	L22: Stabilizer codes. II
	W, 5-24	L23: Fault tolerance. I (presented by Bryan Eastin) L23-24	10.6
	Th, 5-25	L24: Fault tolerance. II (presented by Bryan Eastin)