PHYS771 Quantum Computing Since Democritus

Abstraction: Scott Aaronson course connecting quantum computing to broader intellectual problems

Key points:

• Graduate course at University of Waterloo, Fall 2006, taught by Scott Aaronson
• Connects quantum computing to pre-existing problems: P vs NP, the measurement problem, existence of secure cryptography, Humean induction, closed timelike curves
• Course format emphasizes participation, discussion, and debate with concrete puzzles each session
• Became the basis for Aaronson's book of the same name
• Prerequisites: mathematical maturity and prior exposure to quantum computing

Connections: Scott Aaronson · University Of Waterloo · Quantum Computing · Computational Complexity

Source: https://www.scottaaronson.com/democritus/