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.
To get the free app, enter your mobile phone number.
Other Sellers on Amazon
+ $3.99 shipping
Classical and Quantum Computation (Graduate Studies in Mathematics) Paperback – May 31, 2002
|New from||Used from|
Frequently bought together
Customers who bought this item also bought
The first part of the book ... consists of a compact introduction to classical complexity theory ... provides an elegant summary of the definitions and some of the tools required for the rest of the book ... The book is concluded with the solutions to all (!) exercises ... I liked this book a lot and think that it provides an excellent complement to the existing books on quantum computation ... Big pluses are the rigorous treatment of complexity issues, the introduction of the density matrix formalism early on, and complete solutions to all exercises ... translation has been done remarkably well ... concise ... researchers in the area will like it. --Mathematical Reviews
The aim of the book is to teach the wonders of the qubit-algorithms. While other books, such as Nielsen-Chuang, serve as (more or less) comprehensive references, the present book is focused on complexity. Mathematical prerequisites are minimal, but a reader with some understanding of basic ideas from CS, and quantum theory will get more out of Kitaev, et al ... Really well done, and nicely updated; a handy appendix was added, covering elementary math terms that are used ... The book does a great job in explaining the fundamentals ... The big question is why some qubit-algorithms are a lot better than classical counterparts ... a reader comes away with a good understanding of this in the end. --Palle Jorgensen
Definitions and theorems are stated precisely ... proofs are written with an eye towards rigor ... most mathematicians will feel at home with the presentation of the material ... main points are explained carefully and precisely ... contains a number of exercises, with solutions to all ... well suited to mathematicians interested in quantum algorithms. --MAA Monthly
Text: English (translation)
Original Language: Russian --This text refers to an out of print or unavailable edition of this title.
Browse award-winning titles. See more
If you are a seller for this product, would you like to suggest updates through seller support?
Top Customer Reviews
The book does a great job in explaining the fundamentals, both at the level of the *intuitive ideas*, as well as the mathematical proofs. The big question is why some qubit-algorithms (such as P Shor's factoring algorithm), are a lot better than classical counterparts(for example polynomial vs exponential), and a reader comes away with a good understanding of this in the end.
Recently, in my preparation for my qualifying exam in Quantum information at MIT, I commenced reading this book. The feeling was like drinking a long cool sip of water after a 10 mile run. In particular, I really like the mathematical rigor of the writers. I have known Kitaev as a clear and careful presentator while I was at CalTech as an undergrad, and this is clearly reflected in his book. I definitely would recommend this book to anyone interested in Quantum computing and quantum information, professionally or amateurishly to buy this book (and no, I was not bribed to give this review in order to pass my quals!).