Product Description
This book is an introduction to a new rapidly developing theory of quantum computing. It begins with the basics of classical theory of computation: Turing machines, Boolean circuits, parallel algorithms, probabilistic computation, NP-complete problems, and the idea of complexity of an algorithm. The second part of the book provides an exposition of quantum computation theory. It starts with the introduction of general quantum formalism (pure states, density matrices, and superoperators), universal gate sets and approximation theorems. Then the authors study various quantum computation algorithms: Grover's algorithm, Shor's factoring algorithm, and the Abelian hidden subgroup problem. In concluding sections, several related topics are discussed (parallel quantum computation, a quantum analog of NP-completeness, and quantum error-correcting codes). Rapid development of quantum computing started in 1994 with a stunning suggestion by Peter Shor to use quantum computation for factoring large numbers--an extremely difficult and time-consuming problem when using a conventional computer. Shor's result spawned a burst of activity in designing new algorithms and in attempting to actually build quantum computers. Currently, the progress is much more significant in the former: A sound theoretical basis of quantum computing is under development and many algorithms have been suggested. In this concise text, the authors provide solid foundations to the theory--in particular, a careful analysis of the quantum circuit model--and cover selected topics in depth. Included are a complete proof of the Solovay-Kitaev theorem with accurate algorithm complexity bounds, approximation of unitary operators by circuits of doubly logarithmic depth. Among other interesting topics are toric codes and their relation to the anyon approach to quantum computing.

CUSTOMER REVIEWS (Average Customer Rating: 5.0 based on 2 reviews)

A clear, concise exposition by Si Hui Tan (Cambridge, MA)

5 Stars
April 09, 2007
I started off learning Quantum Computation and Quantum Information by reading Nielsen and Chuang's book in order to do research in my junior year on quantum cyptography. Despite the completeness and popularity of that book, it did not exhibit enough explanation and insights for me to be truly satisfied that quantum computation will truly take flight one day to be implementable in place of classical computation. 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!).

Complexity of algorithms. by Palle E T Jorgensen (Iowa City, Iowa United States)

5 Stars
August 31, 2002
The book covers classical and quantum algorithms;-- of the 250 or so, pages of text, roughly the first 50 pages are "classical", the rest quantum;-- and indeed 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 (by Kitaev et al) is focussed on complexity. The mathematical prerequisits are minimal, but a reader with some understanding of basic ideas from CS, and from quantum theory (at the level of ch 1 in Nielsen-Chuang), will get more out of Kitaev et al. The book is a translation of a Russian 1999 original, but it is really well done, and nicely updated;-- for example, a handy appendix was added, covering elementary math terms that are used.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.

SIMILAR PRODUCTS

	Quantum Computation and Quantum Information by Michael A. Nielsen (Author), Isaac L. Chuang (Author) In this first comprehensive introduction to the main ideas and techniques of quantum computation and information, Michael Nielsen and Isaac Chuang ask the question: What are the ultimate physical limits to computation and communication? They detail such remarkable effects as fast quantum algorithms, quantum teleportation, quantum cryptography and quantum error correction. A wealth of accompanying figures and exercises illustrate and develop the material in more depth. They describe what a...
	Quantum Computer Science: An Introduction by N. David Mermin (Author) In the 1990's it was realized that quantum physics has some spectacular applications in computer science. This book is a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the...
	An Introduction to Quantum Computing by Phillip Kaye (Author), Raymond Laflamme (Author), Michele Mosca (Author) This concise, accessible text provides a thorough introduction to quantum computing - an exciting emergent field at the interface of the computer, engineering, mathematical and physical sciences. Aimed at advanced undergraduate and beginning graduate students in these disciplines, the text is technically detailed and is clearly illustrated throughout with diagrams and exercises. Some prior knowledge of linear algebra is assumed, including vector spaces and inner products. However, prior...
	Problems And Solutions in Quantum Computing And Quantum Information by Yorick Hardy Willi-Hans Steeb (Author) Quantum computing and quantum information are two of the fastest growing and most exciting research fields in physics. The possibilities of using the non-local behavior of quantum mechanics to factor integers in random polynomial time have also added to this new interest. This book supplies a collection of problems in quantum computing and quantum information together with their detailed solutions, which will prove to be invaluable to students as well as to research workers in these fields. All...
	The Princeton Companion to Mathematics by Timothy Gowers (Editor), June Barrow-Green (Editor), Imre Leader (Editor) This is a one-of-a-kind reference for anyone with a serious interest in mathematics. Edited by Timothy Gowers, a recipient of the Fields Medal, it presents nearly two hundred entries, written especially for this book by some of the world's leading mathematicians, that introduce basic mathematical tools and vocabulary; trace the development of modern mathematics; explain essential terms and concepts; examine core ideas in major areas of mathematics; describe the achievements of scores of...