Quantum Computing since Democritus - Aaronson, Scott_bib.pdf

(2838 KB) Pobierz

Quantum Computing since Democritus

Written by noted quantum computing theorist Scott Aaronson, this

book takes readers on a tour through some of the deepest ideas of

math, 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.

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 both for 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.

Quantum Computing

since Democritus

scott aaronson

Massachusetts Institute of Technology