1.
| [Basic working knowledge]
Able to use the basic rules of quantum theory: pure states, basic measurements, unitary gates, composite systems. Able to use the framework of mixed quantum theory: density matrices, channels, and POVMs. Able to use elementary tools of quantum information (partial trace, fidelity, trace distance).
|
2.
| [Problem modeling]
Able to model information-theoretic tasks in quantum theory: copying data, distinguishing states, communicating messages via quantum systems, correcting errors. Able to model computational problems in the quantum circuit model.
|
3.
| [Problem solving]
Able to find optimal quantum protocols for the discrimination of quantum states. Able to find the optimal strategies in basic quantum games. Able to establish the the correctability of quantum channels.
|
4.
| [Self-learning]
Able to self-learn basic topics in quantum information come up with creative solutions to simple problems.
|
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 | | | | | | T | | | |
CLO 2 | T,P | T,P | T,P | | | | | | | T,P |
CLO 3 | T,P | T,P | T,P | | T,P | T | | | | |
CLO 4 | | | | | | | | | T | |
T - Teach, P - Practice
For BEng(CompSc) Programme Learning Outcomes, please refer to
here.
|
Calendar Entry:
This course offers a gentle introduction to the interdisciplinary field of quantum information and computation. We will start from the basic principles of quantum theory and become familiar with the counterintuitive notions of quantum superposition and entanglement. Once the basics have been covered, we will explore the cornerstones of quantum information theory: quantum cloning machines, quantum teleportation, quantum state discrimination, quantum error correction, quantum cryptography and data compression. Finally, we will provide an overview of quantum computation and of the main quantum algorithms, including Shor's algorithm for prime factorization in polynomial time and Grover's quantum search algorithm.
|
Detailed Description:
Introduction to quantum theory |
Mapped to CLOs
|
Pure quantum theory | 1 |
Quantum entanglement | 1 |
Mixed quantum theory | 1 |
Quantum Information Primitives |
Mapped to CLOs
|
No cloning and teleportation | 2, 3 |
Programmable quantum gates | 2, 3 |
Quantum error correction | 2, 3 |
Quantum Communication |
Mapped to CLOs
|
Quantum data compression | 2, 3 |
Quantum cryptography | 2, 3 |
Quantum Computation |
Mapped to CLOs
|
Quantum query complexity | 2, 3 |
Quantum circuit model | 2 |
Quantum computational complexity | 3 |
|