Classical and Quantum Computation Book Information:

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 super operators) 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. Prerequisites are very modest and include linear algebra, elements of group theory and probability and the notion of a formal or an intuitive algorithm. This text is suitable for a course in quantum computation for graduate students in mathematics, physics, or computer science. More than 100 problems (most of them with complete solutions) and an appendix summarizing the necessary results are a very useful addition to the book. It is available in both hardcover and softcover editions.

• Book Type/Genre :

Society & Culture

• Book Binding :

Paperback

• Language :

English

• Number of Pages :

Page count varies on each edition/reprint

• ISBN - 10 :

• Classical and Quantum Computation Published On :

2012

• Resource:

Society & Social Sciences, Society & Culture Book is recommended for Students, Teachers, Graduates, Professionals, and all bibliophiles

Disclaimer:

• Classical and Quantum Computation Book is not for reading online or for free download in PDF or eBook format.
• Table of Contents, Index, Syllabus, summary and image of Classical and Quantum Computation book may be of a different edition or of the same title.
• The Price of this product may change due to the reprinting of the book or by the publisher. For imported books, the price may change frequently due to exchange rates.
• Classical and Quantum Computation by Shen Book reviews and ratings are trustworthy and the product description given above is true to the best. The product description posted here by sellers would be updated based on the Customer's feedback, if the details are not accurate.
• The customers who have bought this product can write your best reviews and suggest the product if the item's price is low which would be helpful for the buyers interested to purchase. Read Best & Top Books related to this item
• The above Bibliographic information is specific to this book which is being listed for sale. Any Colophons printed at the end of the book is owned by book author and publisher
• Special offers, deals & discounts on this product are subject to the terms and conditions owned by the website