Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your email address or mobile phone number.

Quantum Computing since Democritus 1st Edition

4.4 out of 5 stars 36 customer reviews
ISBN-13: 978-0521199568
ISBN-10: 0521199565
Why is ISBN important?
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Trade in your item
Get a $12.18
Gift Card.
Have one to sell? Sell on Amazon
Buy new
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
List Price: $44.99 Save: $13.50 (30%)
45 New from $25.94
Quantum Computing since D... has been added to your Cart
More Buying Choices
45 New from $25.94 26 Used from $31.49
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

$31.49 FREE Shipping. In Stock. Ships from and sold by Amazon.com. Gift-wrap available.
click to open popover

Frequently Bought Together

  • Quantum Computing since Democritus
  • +
  • Quantum Computation and Quantum Information: 10th Anniversary Edition
  • +
  • Quantum Computing: A Gentle Introduction (Scientific and Engineering Computation)
Total price: $142.52
Buy the selected items together

Editorial Reviews


"Scott Aaronson has written a beautiful and highly original synthesis of what we know about some of the most fundamental questions in science: what is information? What does it mean to compute? What is the nature of mind and of free will? Highly recommended."
Michael Nielsen, author of Reinventing Discovery

"I laughed, I cried, I fell off my chair - and that was just reading the chapter on computational complexity. Aaronson is a tornado of intellectual activity: he rips our brains from their intellectual foundations; twists them through a tour of physics, mathematics, computer science, and philosophy; stuffs them full of facts and theorems; tickles them until they cry 'Uncle'; and then drops them, quivering, back into our skulls. Aaronson raises deep questions of how the physical universe is put together and why it is put together the way it is. While we read his lucid explanations we can believe - at least while we hold the book in our hands - that we understand the answers, too."
Seth Lloyd, Massachusetts Institute of Technology, author of Programming the Universe

"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. Aaronson 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

"... how can I adequately convey the scope, erudition, virtuosity, panache, hilarity, the unabashed nerdiness, pugnacity, the overwhelming exuberance, the relentless good humor, the biting sarcasm, the coolness and, yes, the intellectual depth of this book?"
Frederic Green, SIGACT News

"It is the very definition of a Big Ideas Book ... It's targeted to readers with a reasonably strong grounding in physics, so it's not exactly a light read ... But for those with sufficient background, or the patience to stick with the discussion, the rewards will be great."
Sean Carroll and Jennifer Ouellette, Cocktail Party Physics, Scientific American blog

"The range of subjects covered is immense: set theory, Turing machines, the P versus NP problem, randomness, quantum computing, the hidden variables theory, the anthropic principle, free will, and time travel and complexity. For every one of these diverse topics, the author has something insightful and thought provoking to say. Naturally, this is not a book that can be read quickly, and it is definitely worth repeated reading. The work will make readers think about a lot of subjects and enjoy thinking about them. It definitely belongs in all libraries, especially those serving general readers or students and practitioners of computer science or philosophy. Highly recommended."
R. Bharath, Choice

"... lively, casual, and clearly informed by the author's own important work ... stimulating ... It should prove valuable to anyone interested in computational complexity, quantum mechanics, and the theory of quantum computing."
Francis Sullivan, Physics Today

"... a wonderful, personal exploration of topics in theory of computation, complexity theory, physics, and philosophy. His witty, informal writing style makes the material approachable as he weaves together threads of complexity theory, computing theory, mathematical logic, and the math and physics of quantum mechanics (QM) and quantum computing to show how these topics interrelate to each other, what that says about the universe, and something about us ... this book is a treat."
G. R. Mayforth, Computing Reviews

Book Description

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.

Interested in the Audiobook Edition?
If you’re the author, publisher, or rights holder of this book, let ACX help you produce the audiobook.Learn more.

Product Details

  • Paperback: 398 pages
  • Publisher: Cambridge University Press; 1 edition (April 29, 2013)
  • Language: English
  • ISBN-10: 0521199565
  • ISBN-13: 978-0521199568
  • Product Dimensions: 6 x 0.8 x 9 inches
  • Shipping Weight: 1.5 pounds (View shipping rates and policies)
  • Average Customer Review: 4.4 out of 5 stars  See all reviews (36 customer reviews)
  • Amazon Best Sellers Rank: #27,694 in Books (See Top 100 in Books)

Customer Reviews

Top Customer Reviews

Format: Paperback
If you're a computational complexity theorist, then everything looks like .. well, a problem in computational complexity. Scott Aaronson is astonishingly bright, on top of his subject and genuinely droll: this book gives you a fly-on-the-wall view of how he engaged with his students at the University of Waterloo.

We start with a tour of prerequisites. Chapter 2 covers axiomatic set theory (ZF); chapter 3 Gödel's Completeness and Incompleteness Theorems, and Turing Machines. In chapter 4 we apply some of these ideas to artificial intelligence, discuss Turing's Imitation Game and the state of the art in chatbots, and also Searle's Chinese Room puzzle. Aaronson invariably provides a fresh perspective on these familiar topics although already we see the `lecture note' character of this book, where details are hand-waved over (because the students already know this stuff, or they can go away and look it up).

Chapters 5 and 6 introduce us to the elementary computation complexity classes and explain the famous P not = NP conjecture. This is not a first introduction - you are assumed to already understand formal logic and concepts such as clauses, validity and unsatisfiability. Chapters 7 and 8 introduce, by way of a discussion on randomness and probabilistic computation, a slew of new complexity classes and the hypothesised relations between them, applying some of these ideas to cryptanalysis.

Chapter 9 brings us to quantum theory. Six pages in we're talking about qubits, norms and unitary matrices so a first course on quantum mechanics under your belt would help here. The author's computer science take on all this does bring in some refreshing new insights. We're now equipped, in chapter 10, to talk about quantum computing.
Read more ›
Comment 62 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Kindle Edition
To start with, I must say I'm an absolute layman when it comes to the subjects Aaronson is writing about here -- I'm a writer and software engineer, and my knowledge of physics and computer science comes from popularisations only.

That said, this is an absolutely marvelous introduction to what Aaronson refers to as quantitative epistemology. Aaronson here provides a basic overview of some of the most important concepts in the areas where mathematics, computation and physics meet, in an easy, comprehensible style. If you're interested in quantum mechanics, Turing machines, Godel's incompleteness theorem, or the P vs NP question, you'll find the best explanations I've seen in here.

The lectures on which this is based are all available on Aaronson's website for free, and I have read them many times over the years, but the book goes into more depth and holds together better, while keeping the humour of the originals.

This is not an easy-going book -- it requires work from the reader to follow, and you won't get all of it the first time. But nor is it an academic textbook -- there is some mathematics in it, but anyone who remembers fairly basic things like matrix multiplication should be fine following it.

In the title of this review I call it the Feynman Lectures for QC, and while it's nowhere near as thorough as that great work, it manages the rare feat of being both as clear and entertaining and as scientifically rigorous.

If you have any doubt as to whether this is the book for you or not, the lecture notes are still available to read for free on Aaronson's website. But I guarantee that if you have any interest at all in the most basic building blocks of our knowledge -- what we really know, deep down, about the way things work on the most fundamental level, you will not be disappointed in this book.
5 Comments 49 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Kindle Edition Verified Purchase
Those familiar with Scott Aaronson's "shtetl-optimized" blog will love this book, because it is -unsurprisingly- written in the same mood which I would describe as didactic frenzy. Reading it, you get the feeling that if Aaronson were in the same room as you and got the impression you did not understand a particular point, he would instantly come up with another five ways of explaining it until you got it, and you would get no supper or sleep until that happened. Personally, I think people like that are sufficiently rare and precious that they should be made National Monuments, as some potters and swordsmiths apparently are in Japan. Aaronson so perfectly expresses the peculiar ozonic air of quantum information theory, a weird and unexpected mixture of cosmos-sized questions with little machines outputting tapes of ones and zeroes, that you will get a thrill reading this book even if you understand nothing. I understood about 5% on first pass and thought it wonderful. I hope to bring that up to 25% over the next few years and would be well pleased if that happened.
1 Comment 25 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback Verified Purchase
I found this book disappointing because it could have been a truly great book. What it's got going for it: Aaronson is very smart and reasonably eloquent. The table of contents is fantastic. He understands the material backwards and forwards.

What it's got against it: Scott makes two terrible mistakes. First, he tries overhard to be conversational. Some of this is just offputting, like the many appearances of profanity in the book. (What possible purpose could this serve?) But in many cases, he simply fails to take advantage of print as a medium. You can explain things multiple times in multiple ways. More formal and less formal. Basic idea and then development. This is never done. Everything is said basically once, at some almost completely unpredictable level of detail and formality.

The second problem is that Aaronson makes no distinction -- and I mean *no* distinction -- between what he actually knows and what he only thinks about. In some cases, he's speculating on things that other people know well, but he just goes on as if his opinion were gospel. A case in point is where he supports the view -- still not mainstream, I don't think -- that something "weird" happens when you cross the event horizon of a black hole not for any physical reason, but because he simply felt that "it should be that way." I'm sorry. If I want to adopt someone's vague intuition on this as physically accurate, I'll ask a physicist.

In other cases, he's speculating on things that no one knows about. But he still presents his speculations as if they were fact.

It's really a pity. I would have been pretty happy reading those speculations if they had only been clearly identified as such.
Read more ›
1 Comment 6 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Most Recent Customer Reviews

Set up an Amazon Giveaway

Quantum Computing since Democritus
Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more
This item: Quantum Computing since Democritus