1.
| [Concepts]
Familiar with the quantum circuit model, rules of quantum computation as well as basic elements of quantum computing architecture. |
2.
| [Problem solving]
Able to solve basic problems in quantum computing and quantum error correction, such as evaluating the outcome and the efficiency of an algorithm or determining the distance of a quantum code. |
3.
| [Algorithm design]
Proficient in one quantum programming language.
Able to identify the right quantum algorithm for a specific task.
Able to work as a team in designing a quantum algorithm and presenting the algorithm to the audience. |
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 | | | | | | | | | |
CLO 2 | | T | T | | | | | | | |
CLO 3 | | | | T | T | | T | | | T |
T - Teach, P - Practice
For BEng(CompSc) Programme Learning Outcomes, please refer to
here.
|
Syllabus |
Calendar Entry:
Quantum computing can perform hard computational tasks that are far beyond the reach of conventional computers. This course will focus on quantum computing and its realization, offering a tour through the most important concepts and the most recent progresses. The course consists of four major parts: basics of quantum computing, quantum algorithms, quantum machine learning, and quantum error correction. The course starts with an introduction to the essential ingredients of quantum circuits. We will get familiar with quantum computing by going through representative quantum algorithms and visiting more advanced topics in quantum machine learning. We will then discuss how to build a quantum computer: various ways of implementing quantum computations and coping with noises will be discussed. Finally, we will conclude the course with an overview of recent progresses and with a perspective on the future of quantum computing. Tutorials will also be offered on quantum programming, where we will design our own quantum algorithms that address practical problems.
|
Detailed Description:
Basics of Quantum Computing |
Mapped to CLOs
|
Quantum bits, gates, and measurements | 1 |
Universal gate set and complexity | 1 |
Quantum Programming Language | 3 |
Quantum Algorithms |
Mapped to CLOs
|
Quantum Fourier transform | 2, 3 |
Shor’s algorithm | 2, 3 |
HHL algorithm | 2, 3 |
Quantum Machine Learning |
Mapped to CLOs
|
Quantum support vector machine | 2, 3 |
Variational algorithms | 2, 3 |
Quantum neural networks | 2, 3 |
Quantum Error Correction |
Mapped to CLOs
|
Error Correction Codes | 1, 2, 3 |
Fault tolerance | 1, 2 |
Implementation of quantum computing | 1 |
|
Assessment:
Continuous Assessment:
50% Written Examination:
50%
|
Teaching Plan |
Please refer to the corresponding Moodle course.
|
Moodle Course(s) |
|