Quantum Information Theory

Lent Term: M. W. F. 10am, MR5

Nilanjana Datta

Course Description
Quantum Information Theory (QIT) is an exciting, young field which lies at the intersection of
Mathematics, Physics and Computer Science. It was born out of Classical Information Theory,
which is the mathematical theory of acquisition, storage, transmission and processing of information.
QIT is the study of how these tasks can be accomplished, using quantum-mechanical
systems. The underlying quantum mechanics leads to some distinctively new features which
have no classical counterparts. These new features can be exploited, not only to improve the
performance of certain information-processing tasks, but also to accomplish tasks which are
impossible or intractable in the classical realm. This is an introductory course on QIT, which
should serve to pave the way for more advanced topics in this field.

The course will start with a short introduction to some of the basic concepts
and tools of Classical Information Theory, which will prove useful in the study of QIT. Topics
in this part of the course will include a brief discussion of data compression, transmission of
data through noisy channels, Shannon’s theorems, entropy and channel capacity.
The quantum part of the course will commence with a study of open systems and a discussion
of how they necessitate a generalization of the basic postulates of quantum mechanics.
Topics will include quantum states, quantum operations, generalized measurements, POVMs,
the Kraus Representation Theorem and the Choi-Jamilkowski isomorphism. Along the way we will
prove results establishing the fact that quantum information cannot be perfectly copied (the
“no-cloning” theorem), and fundamental limits on how well different states of a quantum system
can be distinguished by measurements. We will look at the strange phenomenon of entanglement,
and some applications elucidating its usefulness as a resource in QIT. In particular, we will
discuss the protocols of “superdense coding” and “teleportation” which make use of entanglement
to accomplish tasks that would otherwise be impossible.

Building on this we will develop some of the major results of quantum information
theory, which concern data compression and the reliable transmission of information over noisy
communication channels. Key mathematical ideas introduced in the process will be the quantum
notions of entropy and information, quantum data compression limit, channel capacities, as well
as random coding arguments. Various examples of quantum channels will be given and the different
capacities of a quantum channel will be discussed. The Holevo bound on the accessible information
and the Holevo-Schumacher-Westmoreland (HSW) Theorem will also be covered.


Knowledge of basic quantum mechanics will be assumed.
Elementary knowledge of Probability Theory, Vector Spaces and Linear Algebra will be useful.

Supplementary reading:

Mathematical Preliminaries (printing version) (updated 28 January 2019).

Quantum Mechanical Preliminaries (printing version) (updated 28 January 2019).

Example classes

Course Instructor: Eric Hanson

First Example Class: 2pm - 4pm, Thursday 7th of February, MR5.

Example sheet 1 (printing version)

Second Example Class: 2pm - 4pm, Friday 22nd of February, MR3.

Example sheet 2 (printing version)

Third Example Class: 2pm - 4pm, Friday 8th of March, MR3

Example sheet 3 (printing version)

Fourth Example Class: 2pm - 4pm, Friday 26th of April, MR5

Example sheet 4 (printing version)

Revision Class: 3:30pm - 5:30pm, Thursday 16th of May, MR13

Revision sheet (printing version)

Background reading

The following books and lecture notes provide some interesting and relevant reading material.

On classical information theory:

1. T. M. Cover and J. A. Thomas, "Elements of Information Theory," Wiley Series in Telecommunications and Signal Processing.

2. D. J. C. MacKay, "Information Theory, Inference, and Learning Algorithms", CUP 2003, available online: http://www.inference.phy.cam.ac.uk/mackay/itila/book.html
On quantum information theory:
1. M. A. Nielsen and I. L. Chuang, "Quantum Computation and Quantum Information";
Cambridge University Press, 2000.

2. M. M. Wilde, "From Classical to Quantum Shannon Theory", CUP; http://arxiv.org/abs/1106.1445.

3. J. Preskill, Chapter 5 of his lecture notes: Lecture notes on Quantum Information Theory

Notes 1: Introduction and rudiments of classical information theory 229.75 KB
Notes 2: Shannon's Source Coding Theorem188.34 KB
Notes 3: Entropies134.97 KB
Notes 4: Transmission of information through a noisy channel182.11 KB
Notes 5: Open quantum systems: States232.78 KB
Notes 6: Schmidt decomposition, Purification & the No-Cloning Theorem166.19 KB
Notes 7: A brief note on maximally entangled states119.21 KB
Notes 8: Time evolution of open quantum systems - Quantum Operations190.49 KB
Notes 9: Generalized measurements and POVM194.29 KB
Notes 10: Entanglement and its uses260.96 KB
Notes 11: Distance measures188.59 KB
Notes 12: Quantum entropies158.24 KB
Notes 13: Quantum data compression203.03 KB
Notes 14: Quantum channels146.86 KB
Notes 15: Accessible information and the Holevo Bound130.74 KB
Notes 16: Properties of the Holevo quantity and the HSW Theorem170.95 KB
Notes 17: HSW Theorem revisited: proof of converse202.61 KB
Notes 18: Coherent information and quantum data processing inequality136.72 KB