Self-study path
Introduction to Quantum Computing
A self-study learning path into quantum computation, built from linear algebra — qubits, gates, entanglement, and the key algorithms.
Quantum Computing Algorithms Theory
Overview
A curated self-study path into quantum computation for students with a linear algebra and probability background. This page collects topics and external resources — it is not a recorded course. For my recorded tutorials in linear algebra and calculus, see the teaching page.
Topics
- Qubits, quantum states, and Dirac notation
- Single-qubit gates: Hadamard, Pauli, and phase gates
- Multi-qubit systems, tensor products, and entanglement
- Bell states and the EPR paradox
- Quantum circuits and universality
- Key algorithms: Deutsch–Jozsa, Grover’s search, Shor’s factoring (overview)
- Introduction to quantum error correction
Prerequisites
Linear algebra (vectors, matrices, inner products, eigenvalues), complex numbers, and basic probability.