COMPUTATIONAL COMPLEXITY
Quantum Computing Since Democritus: Scott Aaronson's Lecture Notes
Scott Aaronson (UT Austin)
Scott Aaronson's famous lecture series connecting quantum computing to computational complexity, philosophy of physics, and mathematical foundations, covering BQP, QMA, quantum proofs, and quantum cryptography with the depth and irreverence of one of the field's leading theorists.