Introduction to Quantum Computation

Quantum computation reframes information processing around the linear-algebraic machinery of quantum mechanics — states as vectors in Hilbert space, gates as unitaries, measurement as projection — and asks where this buys you genuine computational advantage over a classical machine. You'll work through Dirac notation and density operators until they feel routine, derive Bell inequalities, design circuits from universal gate sets, and trace through the canonical algorithms (Deutsch, Grover, and Shor's factoring via phase estimation) on homework and a presentation. Solid linear algebra is the real prerequisite; the payoff is a working foundation for quantum information, cryptography, and complexity theory courses, and for reading current research without treating the qubit as a black box.