Published by American Mathematical Society, 2002

New
/
Soft cover /
Quantity Available: 0

From Kennys Bookstore (Olney, MD, U.S.A.)

We're sorry; this specific copy is no longer available. AbeBooks has millions of books. We've listed similar copies below.

2002. 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. . . . . . Books ship from the US and Ireland. Bookseller Inventory # V9780821832295

**Synopsis:** 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.

**Language Notes:**
Text: English (translation)

Original Language: Russian

Title: **Classical and Quantum Computation**

Publisher: **American Mathematical Society**

Publication Date: **2002**

Binding: **Soft cover**

Book Condition: **New**

Published by
Amer Mathematical Society
(2002)

ISBN 10: 0821832298
ISBN 13: 9780821832295

New
Paperback
Quantity Available: 5

Seller

Rating

**Book Description **Amer Mathematical Society, 2002. Paperback. Book Condition: New. New ,International edition , softcover ,Same text as US edition , ISBN /Cover may be different , Ready to ship, 5-8 business days worldwide delivery. Bookseller Inventory # INFGYD1G642

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0821832298
ISBN 13: 9780821832295

New
Quantity Available: 5

Seller

Rating

**Book Description **Book Condition: Brand New. Brand New Paperback International Edition, Perfect Condition. Printed in English. Excellent Quality, Service and customer satisfaction guaranteed!. Bookseller Inventory # AIND-33533

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0821832298
ISBN 13: 9780821832295

New
Quantity Available: 5

Seller

Rating

**Book Description **Book Condition: New. New. International edition. Different ISBN and Cover image but contents are same as US edition. Perfect condition. Customer satisfaction our priority. Bookseller Inventory # ABE-FEB-92311

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0821832298
ISBN 13: 9780821832295

New
Quantity Available: 5

Seller

Rating

**Book Description **Book Condition: Brand New. New. SoftCover International edition. Different ISBN and Cover image but contents are same as US edition. Customer Satisfaction guaranteed!!. Bookseller Inventory # SHUB92311

More Information About This Seller | Ask Bookseller a Question

Published by
Orient Blackswan
(2012)

ISBN 10: 0821832298
ISBN 13: 9780821832295

New
PB
Quantity Available: 2

Seller

Rating

**Book Description **Orient Blackswan, 2012. PB. Book Condition: New. New. International edition. Different ISBN and Cover image but contents are same as US edition. Book is in English Language. Perfect condition. Customer satisfaction our priority. Bookseller Inventory # shadhya20062017-2450

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0821832298
ISBN 13: 9780821832295

New
Softcover
Quantity Available: 5

Seller

Rating

**Book Description **Book Condition: New. Brand New Paperback International Edition.We Ship to PO BOX Address also. EXPEDITED shipping option also available for faster delivery. Bookseller Inventory # AUSBNEW-33533

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0821832298
ISBN 13: 9780821832295

New
Softcover
Quantity Available: 5

Seller

Rating

**Book Description **Book Condition: Brand New. New, SoftCover International edition. Different ISBN and Cover image but contents are same as US edition. Excellent Customer Service. Bookseller Inventory # ABEUSA-92311

More Information About This Seller | Ask Bookseller a Question

Published by
Orient Blackswan

ISBN 10: 0821832298
ISBN 13: 9780821832295

New
Quantity Available: 5

Seller

Rating

**Book Description **Orient Blackswan. Book Condition: Brand New. This is Brand New, INTERNATIONAL Edition, Paperback, Different ISBN & front cover, same contents, Excellent Quality with Shrink Wrap, English language, Perfect condition. Please contact us for any questions regarding this book.!!. Bookseller Inventory # JUL-17-286

More Information About This Seller | Ask Bookseller a Question

Published by
Amer Mathematical Society

ISBN 10: 0821832298
ISBN 13: 9780821832295

New
PAPERBACK
Quantity Available: 2

Seller

Rating

**Book Description **Amer Mathematical Society. PAPERBACK. Book Condition: New. 0821832298 Brand New International Edition. SoftCover. Same Contents as US Editions. ISBN and Cover might be different in some cases. Please allow 4-14 Business days to arrive. Bookseller Inventory # AG-INTL-821832298

More Information About This Seller | Ask Bookseller a Question

Published by
Amer Mathematical Society
(2002)

ISBN 10: 0821832298
ISBN 13: 9780821832295

New
Paperback
Quantity Available: > 20

Seller

Rating

**Book Description **Amer Mathematical Society, 2002. Paperback. Book Condition: New. Brand new. We distribute directly for the publisher. 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.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. Bookseller Inventory # 1007140020

More Information About This Seller | Ask Bookseller a Question