MAGIC069: Introduction to Quantum Information

Course details

A core MAGIC course

Semester

Autumn 2013
Monday, October 7th to Saturday, December 14th

Hours

Live lecture hours
10
Recorded lecture hours
0
Total advised study hours
0

Timetable

Tuesdays
10:05 - 10:55

Description

The aim of this course is to introduce basic ideas of quantum computation and quantum information. The processing information requires a physical device capable of performing the corresponding operations. If individual objects of atomic dimensions are used for information processing, the laws of quantum mechanics must be taken into account in the description of the behaviour of these information carries. Consequently one is forced to rethink the fundamentals of computation, communication, and cryptography. Perhaps surprisingly, this altered perspective does not simply impose quantum restrictions on the processing of information but does also open up new, classically unexpected, enhanced capabilities.
The course will introduce the mathematical language and physical postulates of quantum theory, with a focus on systems described by finite-dimensional complex Hilbert spaces. Core aspects of quantum information theory such as the no-cloning theorem, teleportation, and basic quantum algorithms will be presented. The notion of performing computations with quantum objects will be made explicit using quantum circuits.
Entanglement is an important feature of quantum systems that has been found to be crucial for a quantum speed-up of computation. We will explain the quantum mechanical description of compound systems and give a precise characterisation of entanglement. Fundamental implications of entanglement, especially quantum nonlocality, will be illustrated in terms of the famous Bell inequality.

Prerequisites

Familiarity with linear algebra, vector spaces over \Bbb C, linear operators and matrices.

Syllabus

  • quantum Mechanics in finite dimensions and quantum operations
  • basic information processing tasks and entropy
  • uncertainty relations
  • quantum circuits and universality
  • quantum algorithms (selection from Deutsch, Simon, Grover, Shor)
  • quantum non-locality and the link to cryptography
There will be several examples sheets, not used for assessment. I may schedule a tutorial at the end of term.

Lecturer

  • RC

    Professor Roger Colbeck

    University
    University of York

Bibliography

Follow the link for a book to take you to the relevant Google Book Search page

You may be able to preview the book there and see links to places where you can buy the book. There is also link marked 'Find this book in a library' - this sometimes works well, but not always - you will need to enter your location, but it will be saved after you do that for the first time.

Assessment

Description

There will be a single take-home paper in January (available from 12th) with 2 weeks to complete and submit online. There will be 4 questions of which you should answer 3. You will need to score more than 50% in order to pass.

Assessment not available

Assessments are only visible to those being assessed for the course.

Files

Only consortium members have access to these files.

Please log in to view course materials.

Lectures

Please log in to view lecture recordings.