Quantum Computing Since Democritus - Paperback
$59.99
$62.99
-5%Quantity
01
Pay over time for orders over $35.00 with
Offers & Perks
Earn 59 points with this purchase
Added to your rewards balance after checkout.
100 points welcome bonus
Create an account and start with extra points.
Languages:EnglishPublisher:Cambridge University PressISBN-13:9780521199568ISBN-10:521199565UPC:9780521199568Book Category:Science, ComputersBook Subcategory:Physics, Computer EngineeringBook Topic:Quantum TheorySize:8.90 x 5.90 x 0.90 inchesWeight:1.2Product ID:SC3XMZBS5J
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.
Languages:EnglishPublisher:Cambridge University PressISBN-13:9780521199568ISBN-10:521199565UPC:9780521199568Book Category:Science, ComputersBook Subcategory:Physics, Computer EngineeringBook Topic:Quantum TheorySize:8.90 x 5.90 x 0.90 inchesWeight:1.2Product ID:SC3XMZBS5J
Aaronson, Scott: - 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.
Publisher: Cambridge University Press
Contributor(s)
Author
Free shipping on orders over $75. Standard shipping takes 3-7 business days. Eligible items may be returned within 30 days of delivery. Conditions apply.