Scott Aaronson's wide-ranging tour of quantum computing's foundational questions — from ancient Greek atomism through computational complexity to quantum mechanics and consciousness.
Complexity theory meets physics: Aaronson shows how computational complexity (what problems can and cannot be efficiently solved) illuminates quantum mechanics, and vice versa. Key insights: quantum computers are not simply faster classical computers — they exploit quantum superposition and interference to solve specific problems exponentially faster. The limits of computation: the Church-Turing thesis, P vs. NP, and what these have to do with physics, free will, and consciousness. Written with characteristic wit and precision.
Discussing
Ask anything about Quantum Computing Since Democritus — their ideas, influences, contradictions, legacy.
Sign in to start a conversation.