This is an archived syllabus from 2014-2015
COMP39112 Quantum Computing syllabus 2014-2015
COMP39112 Quantum Computing
Level 3
Credits: 10
Enrolled students: 39
Course leader: Richard Banach
Additional staff: view all staff
Additional requirements
Pre-requisites
You have to be happy to do plenty of mathematics, linear algebra in particular. The material is covered in the course itself (and includes topics in linear algebra not covered elsewhere), but it's a great help if you've seen (at least some) linear algebra before. By all means contact me if you're unsure.
Assessment methods
- 100% Written exam
| Semester | Event | Location | Day | Time | Group |
|---|---|---|---|---|---|
| Sem 2 w19-21 | Lecture | IT406 | Wed | 12:00 - 13:00 | - |
| Sem 2 w19-21 | Lecture | Uni Place 5.206 | Thu | 16:00 - 17:00 | - |
| Sem 2 w22-26,30-32 | Lecture | Uni Place 5.205 | Thu | 16:00 - 17:00 | - |
| Sem 2 w22-26,31-32 | Lecture | Uni Place 4.204 | Wed | 12:00 - 13:00 | - |
| Sem 2 w30 | Lecture | IT406 | Wed | 12:00 - 13:00 | - |
Overview
Quantum computing is one of the most intriguing of modern developments at the interface of computing, mathematics and physics, whose long term impact is far from clear as yet.
Aims
The perspective that quantum phenomena bring to the questions of information and algorithm is quite unlike the conventional one. In particular, selected problems which classically have only slow algorithms, have in the quantum domain, algorithms which are exponentially faster. Most important among these is the factoring of large numbers, whose difficulty underpins the security of the RSA encryption protocol, used for example in the secure socket layer of the internet. If serious quantum computers could ever be built, RSA would become instantly insecure. This course aims to give the student an introduction to this unusual new field.
Syllabus
State Transition Systems. Nondeterministic Transition Systems, Stochastic Transition Systems, and Quantum Transition Systems. The key issues: Exponentiality, Destructive Interference, Measurement. (1)
Review of Linear Algebra. Complex Inner Product Spaces. Eigenvalues and Eigenvectors, Diagonalisation. Tensor Products. (3)
Pure Quantum Mechanics. Quantum states. Unitary Evolution. Observables, Operators and Commutativity. Measurement. Simple Systems. The No-Cloning theorem. The Qubit. (3)
Entanglement. Schrodinger's cat. EPR states. Bell and CHSH Inequalities. The GHZ Argument. Basis copying versus cloning. (1)
Reading Week:
Computer Scientists and Joint CS and Maths: either Griffiths Chs 1-9 or Mermin Chs 1-4. Physicists, and Joint Maths and Phys: Brassard and Bratley Chs 1-4; other Mathematicians: either of the above. (2)
Basic quantum gates. Simple quantum algorithms. Quantum Teleportation. (3)
Examples Class (1)
Quantum Search (Grover's Algorithm). Quantum Fourier Transform. Phase estimation. Quantum Counting. (5)
Quantum Order Finding. Continued Fractions. Quantum Factoring (Shor's Algorithm). (3)
Teaching methods
Lectures
18
Examples classes
Examples classes will be arranged as required
Feedback methods
Feedback is provided face to face or via email, in response to student queries regarding both the course exercises and the course material more generally.
Study hours
- Lectures (24 hours)
Employability skills
- Analytical skills
- Innovation/creativity
- Problem solving
- Research
Learning outcomes
| Programme outcome | Unit learning outcomes | Assessment |
|---|---|---|
| A1 A3 B1 D6 | Be familiar with linear algebra and basic quantum mechanics. |
|
| A1 A3 B1 D6 | Be familiar with qubits and basic quantum gates. |
|
| A1 A3 B1 D6 | Have a knowledge of standard quantum algorithms. |
|
| A1 A3 B1 D6 | Be able to design simple quantum algorithms. |
|
Reading list
| Title | Author | ISBN | Publisher | Year | Core |
|---|---|---|---|---|---|
| Quantum computation and quantum information | Nielsen, Michael A. and Isaac L. Chuang | 0521635039 | Cambridge University Press | 2000 | ✔ |
| Quantum computing for computer scientists | Yanofsky, Noson S. and Mirco A. Mannucci | 9780521879965 | Cambridge University Press | 2008 | ✔ |
| Lectures on quantum theory: mathematical and structural foundations | Isham, Chris J. | 1860940013 | Imperial College Press | 1995 | ✖ |
| Principles of quantum computation and information: volume 1 - basic concepts | Benenti, Giuliano and Giulio Casati and Giuliano Strini | 9812388583 | World Scientific Publishing Co Pte Ltd | 2004 | ✖ |
| Quantum computer science: an introduction | Mermin, N. David | 9780521876582 | Cambridge University Press | 2007 | ✖ |
| Quantum computing | Gruska, Jozef | 0077095030 | McGraw-Hill Education - Europe | 1999 | ✖ |
| Fundamentals of algorithmics | Brassard, Gilles and Paul Bratley | 0133350681 | Pearson Education Limited | 1996 | ✖ |
| Consistent quantum theory | Griffiths, Robert B. | 0521539293 | Cambridge University Press | 2002 | ✖ |
| Quantum computing (2nd edition) | Hirvensalo, Mika | 3540407049 | Springer | 2003 | ✖ |
| Algorithms: sequential, parallel and distributed | Berman, Kenneth A. and Jerome L. Paul | 0534420575 | Thomson Learning | 2004 | ✖ |
| Strange world of quantum mechanics | Styer, Daniel F. | 0521661048 | Cambridge University Press | 2000 | ✖ |
Additional notes
Course unit materials
Links to course unit teaching materials can be found on the School of Computer Science website for current students.