QUANTUM INFORMATION
Academic Year 2024/2025 - Teacher: Dario CATALANOExpected Learning Outcomes
This class teaches the basics of information theory and modern cryptography in an
accessible yet rigorous manner. The first part of the course focuses on some foundamental results in
information theory such as the source coding theorem, data compression and channel capacity.
Learning objectives
Course Structure
Lecture-based.
Should teaching be carried out in mixed mode or remotely, it may be necessary to introduce changes with respect to previous statements, in line with the programme planned and outlined in the syllabus.
Required Prerequisites
Detailed Course Content
GENERAL COURSE DESCRIPTION
The course offers an introduction to classical and quantum information theory.
COURSE CONTENTS
PART 1: Classical Information
- Elements of classical information theory
- Basics of probability
- Entropy, Mutual Information, and related functions
- Source coding theorem
- Data compression. Block codes and code length limits
- Channel capacity
PART 2: Quantum Information
- Preliminary concepts and notation
- Quantum states, measurements, and channels
- Quantum noise
- Quantum computational complexity
Course Planning
Subjects | Text References | |
---|---|---|
1 | Probability basics | Cap 2 di [1] |
2 | Entropy, Mutual Information | Cap 3 di [1] |
3 | The Source Coding Theorem | Cap 4 di [1] |
4 | Data Compression. Codes and their length | Cap 5 di [1] |
5 | Channel Capacity | Cap. 9 di [1] |
6 | The probabilistic model; Quantum bits, Unitary operations, and measurements. | Cap 1 di [3] |
7 | Multiple quantum bit systems; Tensor products; Dirac notation; Density matrices; Operations on density matrices | Cap 2 di [3] |
8 | Density matrices; Operations on density matrices; Partial trace. | Cap 2 di [3] |
9 | Quantum measurement; Quantum channelsInformation-complete measurements; Partial measurements. | Cap 2 di [3] |
10 | Purifications; Schmidt decomposition; Von Neumann entropy; Quantum compression. | Cap 3 e 5 di [3] |
11 | The Bloch sphere; Hamiltonians; The No-cloning theorem. | Cap 2 di [4] |
12 | Quantum Teleportation; Entanglement swapping; The GHZ state; Monogamy of entanglement. | Cap 6 di [4] |
13 | Quantum error correction; Shor's 9 qubits code; Quantum Fault Tolerance. | Cap 5 e Appendix N di [4] |
14 | Quantum computational complexity: Promise problems and complexity classes; Quantum complexity classes (Uniform Circuits, BQP, Quantum proofs: QMA). | Cap 20 di [5] |
Learning Assessment
Examples of frequently asked questions and / or exercises
Exercises in constructing states of multi-qubit systems through tensor products and analyzing the resulting states.
Exercises to study the properties of entangled states, such as Bell states, and the analysis of state non-separability.
Exercises on quantifying entanglement.
Theoretical exercises to demonstrate the impossibility of cloning arbitrary quantum states and its implications.
Exercises in calculating the von Neumann entropy for mixed states and analyzing information loss.