In weniger als einer Minute können Sie mit dem Lesen von Quantum Computing since Democritus auf Ihrem Kindle beginnen. Sie haben noch keinen Kindle? Hier kaufen oder mit einer unserer kostenlosen Kindle Lese-Apps sofort zu lesen anfangen.

An Ihren Kindle oder ein anderes Gerät senden


Kostenlos testen

Jetzt kostenlos reinlesen

An Ihren Kindle oder ein anderes Gerät senden

Der Artikel ist in folgender Variante leider nicht verfügbar
Keine Abbildung vorhanden für
Keine Abbildung vorhanden

Quantum Computing since Democritus [Kindle Edition]

Scott Aaronson
4.5 von 5 Sternen  Alle Rezensionen anzeigen (2 Kundenrezensionen)

Kindle-Preis: EUR 25,70 Inkl. MwSt. und kostenloser drahtloser Lieferung über Amazon Whispernet

Kostenlose Kindle-Leseanwendung Jeder kann Kindle Bücher lesen  selbst ohne ein Kindle-Gerät  mit der KOSTENFREIEN Kindle App für Smartphones, Tablets und Computer.

Geben Sie Ihre E-Mail-Adresse oder Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.

Weitere Ausgaben

Amazon-Preis Neu ab Gebraucht ab
Kindle Edition EUR 25,70  
Taschenbuch EUR 26,95  



'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. [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

Über das Produkt

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.


  • Format: Kindle Edition
  • Dateigröße: 1855 KB
  • Seitenzahl der Print-Ausgabe: 401 Seiten
  • ISBN-Quelle für Seitenzahl: 0521199565
  • Gleichzeitige Verwendung von Geräten: Bis zu 4 Geräte gleichzeitig, je nach vom Verlag festgelegter Grenze
  • Verlag: Cambridge University Press; Auflage: 1 (21. März 2013)
  • Verkauf durch: Amazon Media EU S.à r.l.
  • Sprache: Englisch
  • ASIN: B00B4V6IZK
  • Text-to-Speech (Vorlesemodus): Aktiviert
  • X-Ray:
  • Word Wise: Nicht aktiviert
  • Durchschnittliche Kundenbewertung: 4.5 von 5 Sternen  Alle Rezensionen anzeigen (2 Kundenrezensionen)
  • Amazon Bestseller-Rang: #120.719 Bezahlt in Kindle-Shop (Siehe Top 100 Bezahlt in Kindle-Shop)

  •  Ist der Verkauf dieses Produkts für Sie nicht akzeptabel?

Mehr über den Autor

Entdecken Sie Bücher, lesen Sie über Autoren und mehr


3 Sterne
2 Sterne
1 Sterne
4.5 von 5 Sternen
4.5 von 5 Sternen
Die hilfreichsten Kundenrezensionen
0 von 1 Kunden fanden die folgende Rezension hilfreich
4.0 von 5 Sternen unterhaltsame Lektüre 25. Juni 2013
Format:Taschenbuch|Verifizierter Kauf
Das Buch ist sehr unterhaltsam und daher zumeist kurzweilig. Wer sich für das Thema interessiert, dürfte ebenfalls auf seine Kosten kommen. Jedenfalls ist alleine die Einführung der Quantenmechanik über negative Wahrschinlichkeiten, die Scott Aaronson auf gerade mal zwei Seiten unterbringt, absolut lesenswert. Sehr wertvoll sind meiner Meinung nach die vielen Verweise auf Internetseiten, die hunderte Seiten an Zusatzlektüre zu den angeschnittenen Themen beherbergen.
War diese Rezension für Sie hilfreich?
0 von 1 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen schönes Buch 28. September 2013
Format:Taschenbuch|Verifizierter Kauf
verständlich, auch für Laien mit wenig Mathematischen Hintergrund, einfach geschrieben, und selbst wenn es zu den Formeln kommt immer gut erklärt
War diese Rezension für Sie hilfreich?
Die hilfreichsten Kundenrezensionen auf (beta) 4.4 von 5 Sternen  29 Rezensionen
37 von 39 Kunden fanden die folgende Rezension hilfreich
3.0 von 5 Sternen Witty and erudite - but still lecture notes 17. Oktober 2013
Von Nigel Seel - Veröffentlicht auf
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. 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.
39 von 47 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen The Feynman Lectures For Quantum Computing 30. März 2013
Von Andrew Hickey - Veröffentlicht auf
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.
24 von 30 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen Tough but mind-expanding 30. März 2013
Von Luca turin - Veröffentlicht auf
Format:Kindle Edition|Verifizierter Kauf
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.
18 von 24 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen The Epiphany of Quantum Computing 31. März 2013
Von A. Gutfraind - Veröffentlicht auf
Format:Kindle Edition
If you take a conventional course in quantum computing, you might come to believe that the field is populated by a strange sort of people: they are preoccupied with freezing atoms in a tank just to add two plus two. Solving useful problems is an impossible dream for the foreseeable future, and so this field appears to have the same relevance to humanity, as oil drilling was to the neanderthals. But you would be wrong. As Dr. Aaronson shows, Quantum Computing raises the most central problems in one of the most exciting developments in modern science: the quest to unify Physics and Computation. The field is new, but we are incomparably closer to the answers than we were just 40 years ago.

This is book is unique - the problems are explained through a Socratic method, discussing with you, the reader, the problems and solutions with minimal jargon, and sparing use of notation.
(I wish more books were like it!) Each chapter opens with naive questions that lead to increasingly deep questions, and ultimately the open problems. You will find yourself fully understanding the foundations of the field, comprehending its achievements, but also, in a way, sitting on the shoulders of giants, as they are scratching their heads.
11 von 15 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen Hard to top the review given at the beginning of the book. 30. April 2013
Von Henning Dekant - Veröffentlicht auf
But if I was hard pressed to review this book with just one sentence, this would be it:

If Douglas Adams was still alive and also somehow turned into a theoretical computer scientists, this is the book he would have written.

Yes, it is that good.
Waren diese Rezensionen hilfreich?   Wir wollen von Ihnen hören.
Kundenrezensionen suchen
Nur in den Rezensionen zu diesem Produkt suchen

Kunden diskutieren

Das Forum zu diesem Produkt
Diskussion Antworten Jüngster Beitrag
Noch keine Diskussionen

Fragen stellen, Meinungen austauschen, Einblicke gewinnen
Neue Diskussion starten
Erster Beitrag:
Eingabe des Log-ins

Kundendiskussionen durchsuchen
Alle Amazon-Diskussionen durchsuchen

Ähnliche Artikel finden