Classical and Quantum Computation

Name: Classical and Quantum Computation
Price: 29.27 USD
Availability: InStock
ISBN: 9780821832295

ISBN-10: 0821832298

ISBN-13: 9780821832295

Edition: 2002

Authors: A. Yu. Kitaev, A. H. Shen, M. N. Vyalyi:

List price: $48.00

30 day, 100% satisfaction guarantee!

Sell

Get cash fast!

Marketplace

2 new & used from $29.27

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

This book is an introduction to a new rapidly developing topic: the 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, andsuperoperators), 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…

Book details

List price: $48.00
Copyright year: 2002
Publisher: American Mathematical Society
Publication date: 5/30/2002
Binding: Paperback
Pages: 257
Size: 7.25" wide x 10.25" long x 0.50" tall
Weight: 1.232



Introduction


Classical computation


Quantum computation Solutions


Elementary number theory


Bibliography


Index