Beispielbild für diese ISBN
Titel: Classical and Quantum Computation (Graduate ...
Verlag: Amer Mathematical Society
Einband: Soft cover
Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: This book is an introduction to a new rapidly developing topic: the theory of quantum computing. The volume introduces and presents the latest research, and the authors provide solid foundations to the theory, in particular a careful analysis of the quantum circuit model, and cover selected topics in depth. The text is written in a concise and accessible style, and contains many exercises, problems and solutions, making it an ideal textbook for courses in computer science, orquantum theory. Buchnummer des Verkäufers ABE_book_new_0821832298
Inhaltsangabe: 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.
Text: English (translation)
Original Language: Russian
Dieser Anbieter akzeptiert die folgenden Zahlungsarten:
AbeBooks Verkäufer seit: 7. Mai 2014
We guarantee the condition of every book as it's described on the AbeBooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind
about a book that you've ordered, please use the Ask bookseller a question link
to contact us and we'll respond within 2 business days.
Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.