I read “Quantum Computing Since Democritus” by Scott Aaronson and loved it but can only hesitantly recommend it. I think I got significantly more utility out of it than most would as I happened to hit the “sweet spot” for being sufficiently equipped to not be hindered by its (clearly marked and understandable) omissions while still having enough gaping holes in my knowledge that I got a lot out of it. For the record, my background is in math with one course in quantum mechanics, one in intro course in quantum computation and no training in complexity classes.
I have never had as much fun with a book this technical before. Please take that as a challenge and recommend me some competitors!
It covers a huge range of material in a very light and enjoyable manner—I frequently found myself laughing out loud. His exercises were, for me, impressively at the level of being just hard enough that they look ridiculously challenging (in one case, apparently impossible!) at first read over but still having an approachable solution after five minutes of thought. He goes over many things that are directly interesting to this community (the anthropic principle, self-identification assumption, Newcomb’s problem, even time travel) and even though I have already read up on those a significant amount found a lot of good stuff in those sections where he does actually manage to relate it to quantum computation.
This is not a traditional book on quantum computing and its title is perhaps misleading. It really is about computational complexity. You will not learn Shor’s algorithm for factoring numbers and Aaronson gives only a slight overview of, for example, what quantum gates do. Prior knowledge of this would be helpful but you could still get something out of it. Don’t expect to learn this or you will be disappointed. The computational complexity material is however first rate.
It’s based off of freely available lecture notes from his website under the same name. I enjoyed this book enough that I like owning a physical copy, but you could probably read it online without much loss. The main difference is some updates for results that came out since the course was originally held (which are valuable). In some sense, I suspect that the online lecture notes are margnially better—for example the book doesn’t have colored diagrams even though the text in at least one case refers to colors on the diagram.
Drexler’s Nanosystems is very technical and very fun. The first ~half of the book is interesting physics, and the rest is mind-blowing systems design (molecular manufacturing and nanomechanical computers!).
I read “Quantum Computing Since Democritus” by Scott Aaronson and loved it but can only hesitantly recommend it. I think I got significantly more utility out of it than most would as I happened to hit the “sweet spot” for being sufficiently equipped to not be hindered by its (clearly marked and understandable) omissions while still having enough gaping holes in my knowledge that I got a lot out of it. For the record, my background is in math with one course in quantum mechanics, one in intro course in quantum computation and no training in complexity classes.
I have never had as much fun with a book this technical before. Please take that as a challenge and recommend me some competitors!
It covers a huge range of material in a very light and enjoyable manner—I frequently found myself laughing out loud. His exercises were, for me, impressively at the level of being just hard enough that they look ridiculously challenging (in one case, apparently impossible!) at first read over but still having an approachable solution after five minutes of thought. He goes over many things that are directly interesting to this community (the anthropic principle, self-identification assumption, Newcomb’s problem, even time travel) and even though I have already read up on those a significant amount found a lot of good stuff in those sections where he does actually manage to relate it to quantum computation.
This is not a traditional book on quantum computing and its title is perhaps misleading. It really is about computational complexity. You will not learn Shor’s algorithm for factoring numbers and Aaronson gives only a slight overview of, for example, what quantum gates do. Prior knowledge of this would be helpful but you could still get something out of it. Don’t expect to learn this or you will be disappointed. The computational complexity material is however first rate.
It’s based off of freely available lecture notes from his website under the same name. I enjoyed this book enough that I like owning a physical copy, but you could probably read it online without much loss. The main difference is some updates for results that came out since the course was originally held (which are valuable). In some sense, I suspect that the online lecture notes are margnially better—for example the book doesn’t have colored diagrams even though the text in at least one case refers to colors on the diagram.
Drexler’s Nanosystems is very technical and very fun. The first ~half of the book is interesting physics, and the rest is mind-blowing systems design (molecular manufacturing and nanomechanical computers!).
Great—added to my reading list!