We introduce and study the mathematics of quantum information science, which brings together quantum mechanics and theoretical computer science, with a focus on information theoretic (instead of computational) aspects in this course.
In the first few lectures, we discuss the so-called density-operator formalism of quantum mechanics and study the relevant mathematical concepts: density operators, partial trace, purification, CPTP maps, and the Schatten norms. After that, the focus will be on measures of quantum information, i.e., ways to quantify the information content of quantum states. This is done by means of studying a quantum-version of the classical Renyi entropies. We analyze the crucial properties of these information measures and discuss (on some examples) their operational significance.
From a technical perspective and to some extent, the course can be seen as a non-commutative extension of classical probability- and information-theory. Along the way, we will touch upon different mathematical concepts, e.g., covering some elements of matrix analysis.
List of topics that are covered: density operators, partial trace, purification, CPTP maps, Choi-Jamiolkowski isomorphism, Kraus and Stinespring representations, Schatten norm, Hoelder inequality, trace distance, (conditional) min-entropy, Renyi divergence, (conditional) Renyi entropy, operator monotonicity and convexity, Lieb-Ando Theorem, data processing inequality, duality of Renyi entropy, monotonicity for classical systems, entropic uncertainty relation, privacy amplification.
Prerequisites: Prior knowledge on quantum information science (e.g. a course on quantum computing) is helpful by not necessary; familiarity with complex numbers and linear algebra is sufficient.