Quantum Computing since Democritus

Takes students and researchers on a tour through some of the deepest ideas of maths, computer science and physics.

Zusatztext 'Not since Richard Feynman's Lectures on Physics has there been a set of lecture notes as brilliant and as entertaining. Aaronson leads the reader on a wild romp through the most important intellectual achievements in computing and physics! weaving these seemingly disparate fields into a captivating narrative for our modern age of information. [He] wildly runs through the fields of physics and computers! showing us how they are connected! how to understand our computational universe! and what questions exist on the borders of these fields that we still don't understand. This book is a poem disguised as a set of lecture notes. The lectures are on computing and physics! complexity theory and mathematical logic and quantum physics. The poem is made up of proofs! jokes! stories! and revelations! synthesizing the two towering fields of computer science and physics into a coherent tapestry of sheer intellectual awesomeness.' Dave Bacon! Google Informationen zum Autor 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. Klappentext 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. Aaronson's informal style makes this book a fascinating read for students and researchers working in physics! computer science! mathematics and philosophy. Zusammenfassung 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. Aaronson's informal style makes this book a fascinating read for students and researchers working in physics! computer science! mathematics and philosophy. Inhaltsverzeichnis 1. Atoms and the void; 2. Sets; 3. Gödel! Turing! and friends; 4. Minds and machines; 5. Paleocomplexity; 6. P! NP! and friends; 7. Randomness; 8. Crypto; 9. Quantum; 10. Quantum computing; 11. Penrose; 12. Decoherence and hidden variables; 13. Proofs; 14. How big are quantum states?; 15. Skepticism of quantum computing; 16. Learning; 17. Interactive proofs and more; 18. Fun with the Anthropic Principle; 19. Free will; 20. Time travel; 21. Cosmology and complexity; 22. Ask me anything. ...

Auteur

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.

Résumé
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. Aaronson's informal style makes this book a fascinating read for students and researchers working in physics, computer science, mathematics and philosophy.

Contenu

1. Atoms and the void; 2. Sets; 3. Gödel, Turing, and friends; 4. Minds and machines; 5. Paleocomplexity; 6. P, NP, and friends; 7. Randomness; 8. Crypto; 9. Quantum; 10. Quantum computing; 11. Penrose; 12. Decoherence and hidden variables; 13. Proofs; 14. How big are quantum states?; 15. Skepticism of quantum computing; 16. Learning; 17. Interactive proofs and more; 18. Fun with the Anthropic Principle; 19. Free will; 20. Time travel; 21. Cosmology and complexity; 22. Ask me anything.