Module aims
In this module you will have the opportunity to explore this exciting topic that sits at the boundaries of computer science and physics. The module will be taught from a computer science perspective, but will also draw on topics from linear algebra, which provides the mathematical apparatus for fomalising quantum systems. You will be introduced to the basic notions of quantum computing, including quantum bits and quantum entanglement and will get to explore quantum algorithms, such as Quantum Search, Quantum Fourier Transform and Quantum Factorisation of Integers.
Learning outcomes
Upon successful completion of this module you will be able to:
– explain and evaluate key notions of quantum computing, including quantum bits, quantum evolution and quantum circuits
– critically compare a range of quantum algorithms used to solve common problems in computer science
– contrast the classical paradigm and the quantum paradigm of computation
– explore the role of quantum computers in solving computationally hard problems, such as factorisation and combinatorial optimization
– use state of the art software tools to program and simulate quantum algorithms
Module syllabus
This module covers the following topics:
– Mathematical background (complex vector spaces and linear algebra)
– From classical to quantum computing (classical vs probabilistic vs quantum bits)
– Quantum gates and circuits (examples and universality)
– Quantum programming languages/tools
– Quantum algorithms (factoring and searching)
– Quantum adiabatic algorithm (for combinatorial optimisation)
– Quantum criptography (key-exchange protocols)
– Quantum error correction (classical codes and examples of quantum codes)
– Quantum hardware (physical implementations and state of the art)