Computer Laboratory Home Page Search A-Z Directory Help
University of Cambridge Home Computer Laboratory
Computer Science Tripos Syllabus - Quantum Computing
Computer Laboratory > Computer Science Tripos Syllabus - Quantum Computing

Quantum Computing next up previous contents
Next: Topics in Concurrency Up: Lent Term 2005: Part Previous: Optimising Compilers   Contents


Quantum Computing

Lecturer: L.M. Ioannou

No. of lectures: 8

Prerequisite courses: Probability, Continuous Mathematics, Computation Theory. Some familiarity with linear algebra will also be assumed.


Aims


The aims of the course are to introduce students to the basics of the quantum model of computation. The model will be used to study algorithms for phase estimation (factorising integers) and amplitude amplification (searching). Issues in error correction and cryptography will also be explored.


Lectures

  • Preliminaries. Motivation, qubits, measurement, quantum gates and networks.

  • Cool applications. Entanglement, Bell States, Superdense Coding, No-Cloning Theorem, Quantum Teleportation.

  • Cryptography. Classical one-time pad, Quantum one-time pad, Quantum key distribution.

  • Algorithms I. Resources for classical and quantum computing, Deutsch-Jozsa algorithm, Phase Estimation, Quantum Fourier transform,

  • Algorithms II. Eigenvalue Estimation, Shor's factoring algorithm.

  • Algorithms III. Grover's searching algorithm, counting.

  • Error correction I. Classical repetition codes, Three-qubit code.

  • Error correction II. Nine-qubit code, Stabilizer formalism.

Objectives


At the end of the course students should

  • understand the basics of the quantum model of computation

  • know some interesting applications of quantum information processing and understand quantum key distrubution

  • be familiar with some important quantum algorithms and their analysis

  • understand the basics of quantum error correction

Recommended books


Nielsen, M.A. & Chuang, I.L. (2000). Quantum computation and quantum information. Cambridge University Press.
Kitaev, A.Y., Shen, A.H. & Vyalyi, M.N. (2002). Classical and quantum computation. AMS.

next up previous contents
Next: Topics in Concurrency Up: Lent Term 2005: Part Previous: Optimising Compilers   Contents
Christine Northeast
Wed Sep 8 11:57:14 BST 2004

© 2004 University of Cambridge Computer Laboratory
Please send any comments to pagemaster@cl.cam.ac.uk
Page last updated on 14-Sep-2004 at 10:42 by Chris Hadley