Quantum Computing Since Democritus

Front Cover
Cambridge University Press, Mar 14, 2013 - Computers - 370 pages
Written by noted quantum computing theorist Scott Aaronson, this book takes readers on a tour through some of the deepest ideas of maths, computer science and physics. Full of insights, arguments and philosophical perspectives, the book covers an amazing array of topics. Beginning in antiquity with Democritus, it progresses through logic and set theory, computability and complexity theory, quantum computing, cryptography, the information content of quantum states and the interpretation of quantum mechanics. There are also extended discussions about time travel, Newcomb's Paradox, the anthropic principle and the views of Roger Penrose. Aaronson's informal style makes this fascinating book accessible to readers with scientific backgrounds, as well as students and researchers working in physics, computer science, mathematics and philosophy.
 

Contents

Sets
8
Minds and machines
29
Paleocomplexity
44
P NP and friends
54
Randomness
71
Crypto
93
18
194
How big are quantum states?
200
Learning
228
Interactive proofs circuit lower bounds and more
243
Fun with the Anthropic Principle
267
Free will
290
Time travel
307
Cosmology and complexity
325
Ask me anything
343
29
363

Skepticism of quantum computing
217

Other editions - View all

Common terms and phrases

About the author (2013)

Scott Aaronson is an Associate Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. Considered one of the top quantum complexity theorists in the world, he is well known for both his research in quantum computing and computational complexity theory and for his widely read blog Shtetl-Optimized. Professor Aaronson also created Complexity Zoo, an online encyclopedia of computational complexity theory and has written popular articles for Scientific American and The New York Times. His research and popular writing have earned him numerous awards, including the United States Presidential Early Career Award for Scientists and Engineers and the Alan T. Waterman Award.

Bibliographic information