Workload - Private Study - Assessment - Description - Aims - Learning Outcomes - Content - Teaching Materials - Recommended Books

Module Code | COM00045M |
---|---|

Lecturers | Sam Braunstein |

Taken By | ACS, MEng CS 4, MEng CS/Phil 4, MEng CSAI 4, MEng CSBES 4, MEng CSESE 4, MEng CSSE 4, MEng CSYS 4, MMath 4 |

Number of Credits | 10 |

Teaching | Autumn 7-10 |

Closed Assessment | [100%] Closed Exam Spring 1, 1.50 hours |

Reassessment |
[100%]
Resit Closed Exam by Viva: MSc End of Summer Term/MEng-MMath, Summer Vacation UG Resit Week, 0.50 hours |

Essential: Some linear algebra or knowledge of vectors, matrices and complex numbers (we assume high-school A-level mathematics covers this).

- Lectures: 12 x 1hr
- Practicals: 8 x 1hr
- Private Study: 78.5hrs
- Assessment: 1.5hrs

Students should work through the material presented in lectures and work through the practical sheets.

- Closed Exam Spring 1, 1.50 hours

1.5 hour closed examination. 100% contribution to the module mark. Reassessment via viva.

Feedback is given during practicals themselves; any assignments handed in are marked and feedback given once solutions are posted (within one week of them being set). Feedback on exam performance is placed on the module web page within a week of completing the exam grading.

- This module introduces the theory of quantum computation. In it we will learn about the pioneering quantum algorithms that promise a qualitative leap in computation power over conventional computers.

The aim of this module is to introduce the theory of quantum computation. In it we will learn about the pioneering quantum algorithms that promise a qualitative leap in computation power over conventional computers.

- Successfully completing this module will mean: that you understand both the promise and limitations of quantum computation; that you have gained facility of some of the many concepts and techniques in quantum computation (e.g., applying gate operations and evolving quantum states, calculating the result of measurements on quantum states, designing and analyzing quantum computational circuits); and that you are familiar with some of the key algorithms (e.g., Shor's, Grover's and the Deutsch-Jozsa algorithms) and their implications and are able to simulate these algorithms on quantum states.

Topics will include:

Introduction to quantum bits;

Quantum gates and circuits;

Oracle problems;

Deutsch-Jozsa algorithm;

Simon's algorithm;

Period finding and factoring (Shor's algorithm);

Virtual database search (Grover's algorithm);

Quantum counting.

Primarily: lecture notes; tutorials on course web page; practical sheets.

Rating | Author | Title | Publisher | Year |
---|---|---|---|---|

*** | G. Benenti, et al. | Principles of Quantum Computation and Information, vol I | World Scientific | 2004 |

*** | G. Benenti, et al. | Principles of Quantum Computation and Information, vol II | World Scientific | 2007 |

*** | P. Kaye, et al. | An Introduction to Quantum Computing | Oxford University Press | 2007 |

Last updated: 19^{th} September 2016