CS469 Quantum Information and Computation (Spring 2024)

Prerequisites: CS344 and (MA339 or MA232)
Instructor: Christino Tamon
Lectures: TR 9:30-10:45am SN214
Office hours: TR 11:00-1:30pm SC373
Required Text: None.

Recommended textbooks:

Syllabus

This course studies information and computation based on quantum mechanical laws. The first part of the course will cover the relevant background in quantum information theory. A brief discussion of several universal quantum computational models will be given. The second part will cover algorithmic techniques important for developing quantum algorithms. Topics to be covered include amplitude amplification, quantum walks, phase estimation, hidden subgroup problems, and quantum protocols. Background in physics would be helpful but is not required. Background in linear algebra (and basic complex numbers) will be essential.

Objectives and outcomes

The objective of this course is to learn the fundamentals of quantum information and quantum computation, to gain a solid understanding of basic quantum algorithms and techniques, and to understand limitations of the quantum computational model.

The specific outcomes are basic knowledge of the following:

Requirements and Policies

Although attendance is not mandatory, students are responsible for all course materials covered in lectures and any quizzes given during class periods. Students that need to make up missing course work must provide the required Clarkson official exempt form. All students must submit their own work; the exchange of ideas are encouraged but ultimately the submitted work must be the student's own. Please refer to the Clarkson University Regulations for more guidelines on academic integrity and related matters.

Grading Scheme

Assignments and Quizzes (40%), Midterm (20%), Final Exam (40%).

Schedule (tentative)

Tuesday Thursday

Jan 11
Classical vs quantum information.
Bits/qubits, classical/quantum gates, and measurement.
Jan 16
Bits/qubits, classical/quantum gates, and measurement.
No Cloning Theorem. 		Jan 18
Entanglement (monogamy). Quantum teleportation.
Jan 23
Quantum teleportation. 		Jan 25
Teleporting gates.
Jan 30
Nonlocal games (GHZ,CHSH).
Feb 1
Elitzur-Vaidman.
Feb 6
Quantum circuits. 		Feb 8
Quantum circuits.
Feb 13
Grover search.
Feb 15
Grover search.
Feb 20
Amplitude Amplification.
Feb 22
Short break.
Feb 27
Deutsch-Jozsa. 		Feb 29
Bernstein-Vazirani. Simon's problem.
Mar 5
Number Theory. Fourier Transform. 		Mar 7
Shor algorithm.
Mar 12
Shor algorithm. 		Mar 14
Hidden Subgroups.
Mar 19
Spring Break 		Mar 21
Spring Break
Mar 26
HHL algorithm.
Mar 28
HHL algorithm.
Apr 2
Analog models: Grover, adiabatic.
Apr 4
Analog models: Grover, adiabatic.
Apr 9
Other universal models: topological, measurement-based. 		Apr 11
Other universal models: topological, measurement-based.
Apr 16
Misc topics 		Apr 18
Misc topics
Apr 23
Misc topics 		Apr 26
Misc topics

Assignments

Please check our Moodle course page.

Useful software for formatting quantum circuits:

Random topics

Miscellany