From 2pm-4pm

• Thursday 2. Mar (B1)
• Tuesday 7. Mar (119) and Thursday 9. Mar (B1)
• Tuesday 14. Mar (119)
• Tuesday 21. Mar (119) and Thursday 23. Mar (B1)
• Tuesday 28. Mar (119)
• Tuesday 4. Apr (119)

This course will begin with the basic elements that play a role in quantum computation: quantum bits (qubits), operators, measurements and circuits. Upon this foundation, we build up to several key quantum algorithms, including Shor's algorithm for factorization and Grover's search algorithm, which demonstrate the potential benefits of quantum computation over classical computation.

The remaining time in the course will be reserved to introduce several specific topics. First, we will cover how quantum computers are physically realized, noting what is the state of the art and where future developments may likely be made. Second, we will discuss how noise affects quantum circuits and how it can be mitigated. Finally, we will touch upon the subject of quantum information, i.e., the study of how information is encoded in the quantum domain and in which ways this contrasts with classical information (bits, entropy, etc.).

Learning results of the course:

The primary goal of this course is to have students gain a fundamental understanding of quantum circuits and of how this tool can be used to design and study quantum algorithms. The secondary goal is for students to become familiar with various special topics within the domain of quantum computing. This ranges from the physical construction of quantum computers to the study of quantum information. Though none of these topics can be covered in detail, this should give a starting point for an interested student to pursue future study.

Lecturer:

Gurtej Kanwar