Skip to product information
1 of 1

Stock cover image; actual copy may differ.

Classical and Quantum Computation (Graduate Studies in Mathematics)

Regular price
$30.84 USD
Regular price
Sale price
$30.84 USD

Book details

A. H. Shen; A. Yu. Kitaev; M. N. Vyalyi

Condition
Acceptable
Format
Paperback
ISBN
9780821832295

This copy does have liquid damage.

Shipping calculated at checkout.
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.
ASIN: 0821832298
VSKU: GBV.0821832298.A
Condition: Acceptable
Author/Artist:A. H. Shen|A. Yu. Kitaev|M. N. Vyalyi
Binding: Paperback
Note: Any images shown are stock photographs and product may differ from what is shown.
Condition Notes: This copy does have liquid damage.
Shipping

We currently ship retail orders within the United States. Orders are normally prepared for carrier handoff within 1–2 business days, excluding weekends and holidays. Carrier transit time is additional.

Available services and charges depend on order value, package weight, destination, and the method selected. Checkout shows the applicable options before payment; not every order qualifies for free shipping.

Read the shipping policy.

Returns

You may request a return within 30 calendar days after delivery. Contact us before sending a book back.

Customers pay change-of-mind return postage. For a wrong, damaged, or materially misdescribed item, we provide a prepaid return label or another resolution you accept. See the policy for eligibility, original shipping charges, and refund timing.

Read the returns and refund policy.

Classical and Quantum Computation (Graduate Studies in Mathematics)