Skip to navigation | Skip to main content | Skip to footer
Menu
Menu

COMP30222: Quantum Computing (2008-2009)

This is an archived syllabus from 2008-2009

Quantum Computing
Level: 3
Credit rating: 10
Pre-requisites: Computer Science students: CS1021, MT1662 or MT1672, CS1112, CS1211, COMP20012
Co-requisites: No Co-requisites
Duration: 11 weeks
Lectures: 19
Examples classes: 5
Labs: None
Lecturers: Richard Banach
Course lecturer: Richard Banach

Additional staff: view all staff
Timetable
SemesterEventLocationDayTimeGroup
Sem 2 w19-26,30-33 Lecture LF17 Wed 12:00 - 13:00 -
Sem 2 w19-26,30-33 Lecture LF17 Thu 16:00 - 17:00 -
Assessment Breakdown
Exam: 100%
Coursework: 0%
Lab: 0%
Degrees for which this unit is optional
  • Artificial Intelligence BSc (Hons)

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.

Learning Outcomes

A student completing this course unit should:

Be familiar with linear algebra and basic quantum mechanics.
Be familiar with qubits and basic quantum gates.
Have a knowledge of standard quantum algorithms.
Be able to design simple quantum algorithms.

Assessment of Learning outcomes

The course unit learning outcomes are assessed by examination.

Contribution to Programme Learning Outcomes

A1, A3, B1, D6

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)

Reading List

For comments on these and other books, see the COMP30222 website.

Core Text
Title: Quantum computing for computer scientists
Author: Yanofsky, Noson S. and Mirco A. Mannucci
ISBN: 9780521879965
Publisher: Cambridge University Press
Edition:
Year: 2008
Probably the best bet for CS students.

Core Text
Title: Quantum computation and quantum information
Author: Nielsen, Michael A. and Isaac L. Chuang
ISBN: 0521635039
Publisher: Cambridge University Press
Edition:
Year: 2000
Highly regarded, thoroughgoing treatment of the subject.

Supplementary Text
Title: Consistent quantum theory
Author: Griffiths, Robert B.
ISBN: 0521539293
Publisher: Cambridge University Press
Edition:
Year: 2002

Supplementary Text
Title: Lectures on quantum theory: mathematical and structural foundations
Author: Isham, Chris J.
ISBN: 1860940013
Publisher: Imperial College Press
Edition:
Year: 1995

Supplementary Text
Title: Quantum computer science: an introduction
Author: Mermin, N. David
ISBN: 9780521876582
Publisher: Cambridge University Press
Edition:
Year: 2007

Supplementary Text
Title: Fundamentals of algorithmics
Author: Brassard, Gilles and Paul Bratley
ISBN: 0133350681
Publisher: Pearson Education Limited
Edition:
Year: 1996

Supplementary Text
Title: Quantum computing
Author: Gruska, Jozef
ISBN: 0077095030
Publisher: McGraw-Hill Education - Europe
Edition:
Year: 1999

Supplementary Text
Title: Strange world of quantum mechanics
Author: Styer, Daniel F.
ISBN: 0521661048
Publisher: Cambridge University Press
Edition:
Year: 2000

Supplementary Text
Title: Quantum computing (2nd edition)
Author: Hirvensalo, Mika
ISBN: 3540407049
Publisher: Springer
Edition:
Year: 2003

Supplementary Text
Title: Principles of quantum computation and information: volume 1 - basic concepts
Author: Benenti, Giuliano and Giulio Casati and Giuliano Strini
ISBN: 9812388583
Publisher: World Scientific Publishing Co Pte Ltd
Edition: Vol I
Year: 2004

Supplementary Text
Title: Algorithms: sequential, parallel and distributed
Author: Berman, Kenneth A. and Jerome L. Paul
ISBN: 0534420575
Publisher: Thomson Learning
Edition:
Year: 2004