Quantum Information and Computation (COMP3316/CSIS3316)
Level: undergraduate
Degree: Computer Science, Engineering Science
Time: Spring Semester
Hours: 39
Description:
The course offers a gentle introduction to the field of quantum information and computation. We will start from the basic principles of quantum theory and explore the counterintuitive notions of quantum superposition and entanglement. Once the basics have been established, we will approach the cornerstones of quantum information theory: quantum cloning, quantum teleportation, quantum state discrimination, quantum error correction, quantum cryptography, and quantum algorithms, including Grover's quantum search algorithm and Shor's algorithm for prime factorization in polynomial time.
No prerequisite in quantum mechanics required.
Degree: Computer Science, Engineering Science
Time: Spring Semester
Hours: 39
Description:
The course offers a gentle introduction to the field of quantum information and computation. We will start from the basic principles of quantum theory and explore the counterintuitive notions of quantum superposition and entanglement. Once the basics have been established, we will approach the cornerstones of quantum information theory: quantum cloning, quantum teleportation, quantum state discrimination, quantum error correction, quantum cryptography, and quantum algorithms, including Grover's quantum search algorithm and Shor's algorithm for prime factorization in polynomial time.
No prerequisite in quantum mechanics required.
Discrete Mathematics (COMP2121/CSIS1121)
Level: undergraduate
Degree: Computer Science, Engineering Science
Time: Fall Semester
Hours: 39
Description:
This course provides students a solid background on discrete mathematics and structures pertinent to computer science. Topics include: logic, set theory, mathematical reasoning, counting techniques, discrete probability, trees, graphs, and related algorithms.
Degree: Computer Science, Engineering Science
Time: Fall Semester
Hours: 39
Description:
This course provides students a solid background on discrete mathematics and structures pertinent to computer science. Topics include: logic, set theory, mathematical reasoning, counting techniques, discrete probability, trees, graphs, and related algorithms.