Quantum Computing tutorial | Part 2.2: Norms and Codes for Quantum Information Theory скачать в хорошем качестве

Quantum Computing tutorial | Part 2.2: Norms and Codes for Quantum Information Theory

Part 2.2 of the Quantum Computing tutorial. Covering UvA Quantum Information Theory course Lecture 4-7 content (skipping a lot properties, proofs, exercises), taught in 2025 Fall: NORMS 1. lp-norms, Shatten norms 2. Trace distance, fidelity 3. Uhlmann's theorem with proof CLASSICAL CODES 1. (n, R, delta)-code (lossy compression) 2. Shannon's source coding theorem (optimal compression rate) 3. Shannon entropy 4. Trace distance, (n, R, delta)-code representation using trace distance (with proof) QUANTUM CODES 1. (n, R, delta)-quantum code (lossy compression) 2. Schumacker's compression theorem (optimal compression rate) 3. Von Neumann entropy, Fannes-Andauaert theorem 4. Quantum channels 5. Channel fidelity, purification in fidelity lemma, Kraus representation of channel fidelity 6. Choi operator, Kraus representation, Stinesprint representation, adjoint superoperator Upcoming in the next tutorials - the rest of UvA Quantum Information Theory: 1. Mutual information, data processing inequality 2. Holevo bound, relative entropy 3. LOCC and separable channels 4. Nielsen's theorem, distillable entanglement, entanglement cost 5. Tensor networks You can find the full video whiteboards here: https://www.npw.lt/assets/files/yt-2.... https://www.npw.lt/assets/files/yt-2.... Sources: Lectures Notes on Quantum Information Theory Michael Walter and Maris Ozols, University of Amsterdam, 2025 --- 00:00 Introduction 00:20 Norms 14:36 Codes 45:32 Outro 57:24 Outro