Quantum Information Theory · Mithilesh Kumar
Quantum Information Theory
Distinguishability, communication, and the limits of quantum resources
Quantum Foundations explains the structure of the theory. Here we ask what that structure permits: how well can states be distinguished, how much information survives a noisy channel, and when can lost information be recovered? Work from explicit finite-dimensional examples to operational bounds, coding theorems, and small research investigations.
Begin reading Continue where you left off →Prerequisites and approach
Complete Quantum Foundations and Quantum Information, or bring equivalent knowledge of density operators, tensor products, partial traces, measurements, and elementary entropy. You should be comfortable with complex linear algebra and probability. Operator norms, convex optimization, and asymptotic reasoning are developed where needed.
10 of 10 chapters contain draft lessons with worked examples and solved problems. These are teaching manuscripts in development; advanced results are stated with their assumptions and sources where a full proof lies beyond the course.
Chapters 1–3 establish the mathematical tools. Chapters 4–7 study entanglement, compression, and communication. Chapters 8–10 turn to recovery, resource theories, and reproducible research. All logarithms are base two; systems are finite-dimensional unless explicitly stated. Fidelity means the squared fidelity throughout.
Plan for one or two study sessions per chapter, plus time for proofs and exercises. First attempt the prediction and worked checks, then solve the end-of-chapter problems. The final chapter offers three bounded projects with benchmark answers and clear limits on what a numerical experiment establishes.
Reference texts: John Watrous, The Theory of Quantum Information and John Preskill, Quantum Shannon Theory. Manuscripts here use original explanations and examples; theorem references appear beside the statements they support.
Continue the advanced sequence: Quantum Error Correction turns the conditions for recovery into code constructions, protected logical operations, and explicit reliability budgets.