Stock image for illustration purposes only - book cover, edition or condition may vary.
Classical and Quantum Computation
A. Yu. Kitaev
€ 101.69
FREE Delivery in Ireland
Description for Classical and Quantum Computation
Paperback. Presents an introduction to the theory of quantum computing. This book starts 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. It provides an exposition of quantum computation theory. Series: Graduate Studies in Mathematics. Num Pages: 272 pages, Illustrations. BIC Classification: PBW; PHQ; UYA. Category: (P) Professional & Vocational. Dimension: 254 x 177 x 13. Weight in Grams: 478.
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 ... Read more
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 ... Read more
Product Details
Publisher
American Mathematical Society United States
Number of pages
272
Format
Paperback
Publication date
2002
Series
Graduate Studies in Mathematics
Condition
New
Number of Pages
257
Place of Publication
Providence, United States
ISBN
9780821832295
SKU
V9780821832295
Shipping Time
Usually ships in 7 to 11 working days
Ref
99-16
Reviews for Classical and Quantum Computation