Course Information
COMP3316 Quantum Information and Computation

COMP3316 Quantum Information and Computation

2019-20
Instructor(s):Chiribella Giulio
(Class A) No. of credit(s):6
Recommended Learning Hours:
Lecture: 39.0
Pre-requisite(s):MATH1853 or MATH2101
Co-requisite(s):  
Mutually exclusive with:  
Remarks:

Course Learning Outcomes

1. [Basic working knowledge]
Able to use the basic rules of quantum theory: pure states, unitary gates, basic measurements, composite systems. Able to solve basic problems in the framework of mixed quantum theory: density matrices, channels, and POVMs. Able to explain, motivate, and use the notion of entanglement.
2. [Problem modeling]
Able to model information-theoretic tasks in quantum theory: Copying data, transferring information, decoding messages, programming gates, correcting errors. Able to model the storage and transmission of quantum information over a quantum channel. Able to model cryptographic problems: quantum key distribution, quantum secret sharing, quantum bit commitment. Able to model computation in the quantum circuit model.
3. [Problem solving]
Able to use the basic principles of quantum information to analyse information-theoretic tasks (information storage and transfer, error correction, gate programming). Able to find optimal quantum protocols for the discrimination of quantum states and gates. Able to use amplitude amplification and the quantum Fourier transform to construct elementary quantum algorithms.
4. [Self-learning]
Able to read classic papers in quantum information theory.
Mapping from Course Learning Outcomes to Programme Learning Outcomes
 PLO aPLO bPLO cPLO dPLO ePLO fPLO gPLO hPLO iPLO j
CLO 1T,PT
CLO 2T,PT,PT,PT,P
CLO 3T,PT,PT,PT,PT
CLO 4T

T - Teach, P - Practice
For BEng(CompSc) Programme Learning Outcomes, please refer to here.

Syllabus

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 theory1
Quantum entanglement1
Mixed quantum theory1
Quantum Information Primitives Mapped to CLOs
No cloning and teleportation2, 3
Programmable quantum gates2, 3
Quantum error correction2, 3
Quantum Communication Mapped to CLOs
Quantum data compression2, 3
Quantum cryptography2, 3
Quantum Computation Mapped to CLOs
Quantum query complexity2, 3
Quantum circuit model2
Quantum computational complexity3

Assessment:
Continuous Assessment: 50%
Written Examination: 50%

Teaching Plan

Please refer to the corresponding Moodle course.

Moodle Course(s)