| Kindle Price: | £28.49 |
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet or computer – no Kindle device required. Learn more
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Quantum Computing since Democritus 1st Edition, Kindle Edition
| Amazon Price | New from | Used from |
- Kindle Edition
£28.49 Read with Our Free App - Paperback
£29.995 Used from £16.64 7 New from £29.99
- ISBN-13978-0521199568
- Edition1st
- PublisherCambridge University Press
- Publication date14 Mar. 2013
- LanguageEnglish
- File size2198 KB
- Kindle (5th Generation)
- Kindle Keyboard
- Kindle DX
- Kindle (2nd Generation)
- Kindle (1st Generation)
- Kindle Paperwhite
- Kindle Paperwhite (5th Generation)
- Kindle Touch
- Kindle Voyage
- Kindle
- Kindle Oasis
- Kindle for Windows 8
- Kindle Cloud Reader
- Kindle for Windows Phone
- Kindle for BlackBerry
- Kindle for Android
- Kindle for Android Tablets
- Kindle for iPhone
- Kindle for iPod Touch
- Kindle for iPad
- Kindle for Mac
- Kindle for PC
Customers who read this book also read
Product description
Review
'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. [He] 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 and 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. [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
'… 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?' 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, despite Aaronson's trademark breezy writing style. 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
'Deep and important.' Times Higher Education
'… 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 --This text refers to the paperback edition.
Book Description
About the Author
Product details
- ASIN : B00B4V6IZK
- Publisher : Cambridge University Press; 1st edition (14 Mar. 2013)
- Language : English
- File size : 2198 KB
- Simultaneous device usage : Up to 4 simultaneous devices, per publisher limits
- Text-to-Speech : Enabled
- Screen Reader : Supported
- Enhanced typesetting : Enabled
- X-Ray : Not Enabled
- Word Wise : Enabled
- Sticky notes : On Kindle Scribe
- Print length : 406 pages
- Best Sellers Rank: 571,447 in Kindle Store (See Top 100 in Kindle Store)
- 56 in Computer Engineering
- 237 in Quantum Physics Theory
- 864 in Quantum Physics
- Customer reviews:
About the author

Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
Customer Reviews, including Product Star Ratings, help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyses reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon-
Top reviews
Top reviews from United Kingdom
There was a problem filtering reviews right now. Please try again later.
Only two caveats: some of the maths might look a bit intimidating for a layman, and most of the material is presented from the viewpoint of a person whose main interest is computational complexity theory: to quote from Scott himself: "In the field I come from, it's never our place to ask if some physical object exists or not, it's to assume it exists and see what computations we can do with it".
If these two caveats did not discourage you (personally, I think they should have the opposite effect), get this book and prepare to enjoy every page of it!
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. Typically this is not architecture or engineering discussion; Aaronson is a theorist, and for his community, quantum computing means a new set of complexity classes with conjectural relationships to those of classical computation.
We now go off at a tangent as the author critiques Sir Roger Penrose's views on consciousness as a quantum gravity phenomenon. I think it's fair to say that no-one in AI takes this idea seriously, but the author has the intellectual resources to engage Penrose on his own ground here.
In chapter 12 we crank up the technical level to talk about decoherence and hidden variable theories. This is one of the most interesting chapters but is too discursive - really important concepts are touched on and then abandoned; for example the discussion of decoherence and the 2nd Law of Thermodynamics is set against a model of the multiverse, but it's never quite clear whether Aaronson is assuming the reality of the Everett Interpretation or whether he has some other, more purely mathematical model in mind.
Chapter 12 reminds us that a computational complexity theorist's idea of proof is a long way from that of a logician. We plunge into stochastic proofs, zero-knowledge proofs and probabilistically checkable proofs, all framed by a complexity analysis.
The next few chapters cover a series of topics in similar vein: quantum proofs (and their complexity classes), rebuttals of sceptical arguments against quantum computing (interesting and convincing), some technically demanding material on learning algorithms, and concepts of interactive proof.
The final few chapters are more philosophical: Aaronson applies his toolkit to topics such as the Anthropic Principle (via Bayesian reasoning); free will (he's in favour but has a highly-idiosyncratic view of what free will is); time travel (how closed timelike curves impact on classical and quantum computation); and cosmology (black holes, the information paradox, with firewalls bringing us up-to-date).
I have to say that I did finish this book - it didn't just sit on my coffee table, abandoned after the first few chapters, as the author rather fears in his preface. However, it has to be said that despite the author's undeniable enthusiasm, complexity theory remains a minority taste. There are plenty of insights and novel observations even for those of us less enthralled but I hope it's clear what kind of background the reader needs to get anything out of this volume.
To be fair, the book is already 362 pages long and to make the material less a write-up of post-graduate lecture notes and more a self-contained and smoothly-developed presentation of Aaronson's many original insights would seem to require an inordinate amount of time and effort, without substantially increasing the likely readership. I enjoyed it, but not without a degree of frustration.






