|
| 1.
| [Basic Working knowledge]
Able to use the basic rules of quantum theory: states, measurements, gates, composite systems.
|
| 2.
| [Modeling]
Able to model basic information-theoretic tasks in the quantum domain: quantum communication, quantum games, quantum computation.
|
| 3.
| [Higher-level reasoning]
Able to deduce new results from the basic knowledge provided in the course.
|
| 4.
| [Self-learning]
Able to self-learn a new topic and/or to approach a mini research problem. |
Mapping from Course Learning Outcomes to Programme Learning Outcomes
| | PLO a | PLO b | PLO c | PLO d | PLO e | PLO f | PLO g | PLO h | PLO i | PLO j |
| CLO 1 | T,P | | | | | | | | | |
| CLO 2 | T,P | T,P | | | | | | | | T,P |
| CLO 3 | T,P | T,P | T,P | | | | | | | T,P |
| CLO 4 | | | | | P | | P | | P | |
T - Teach, P - Practice
For BEng(CompSc) Programme Learning Outcomes, please refer to
here.
|
| Syllabus |
|
Calendar Entry:
This course offers an introduction to the interdisciplinary field of quantum information and computation. We will start from the basic rules of quantum theory and become familiar with the counterintuitive notions of quantum superposition and entanglement. In particular, we will see how quantum systems could be used to detect an object without directly interacting with it (Elitzur-Vaidman bomb tester), to increase the amount of bits that can be sent through a transmission line (dense coding), and to increase the chance to win certain games (CHSH game and GHZ game). Once the basics have been covered, we will provide an overview of quantum computation and of major quantum algorithms such as Grover's search algorithm and Shor's factoring algorithm for prime factorization. Finally, we will introduce the upgraded framework of quantum theory, and use it to explore applications to quantum error correction, quantum state discrimination, quantum cryptography, and quantum teleportation.
|
|
Detailed Description:
| Part 1: Basic quantum theory |
Mapped to CLOs
|
| Pure states, basic measurements, and reversible processes | 1 |
| Composite quantum systems | 1 |
| Part 2: The magic of entanglement |
Mapped to CLOs
|
| Quantum steering | 2, 3 |
| Dense coding | 2, 3 |
| CHSH game and GHZ game | 2, 3 |
| Part 3: Quantum computation |
Mapped to CLOs
|
| The quantum circuit model | 2 |
| Quantum computational complexity and quantum query complexity | 2, 3 |
| Basic quantum algorithms | 2, 3 |
| Part 4: Upgraded quantum theory and applications |
Mapped to CLOs
|
| Mixed states, general measurements, and irreversible processes | 1, 3 |
| Quantum error correction | 2, 3 |
| Quantum state discrimination | 2, 3 |
| The no-cloning theorem | 2, 3 |
| Introduction to quantum cryptography | 2, 3 |
| Quantum teleportation | 2, 3 |
|
|
Assessment:
Continuous Assessment:
50%
Written Examination:
50%
|
| Teaching Plan |
|
Please refer to the corresponding Moodle course.
|
| Moodle Course(s) |
|
|
