**Graduate Studies in Mathematics**

Volume: 47;
2002;
257 pp;
Softcover

MSC: Primary 68; 81;

Print ISBN: 978-0-8218-3229-5

Product Code: GSM/47.S

List Price: $45.00

Individual Member Price: $36.00

**Electronic ISBN: 978-1-4704-1800-7
Product Code: GSM/47.E**

List Price: $45.00

Individual Member Price: $36.00

#### You may also like

# Classical and Quantum Computation

Share this page
*A. Yu. Kitaev; A. H. Shen; M. N. Vyalyi*

#### Readership

Advanced undergraduates, graduate students, research mathematicians, physicists, and computer scientists interested in computer science and quantum theory.

#### Reviews & Endorsements

Apart from its conciseness and rigor, one of the main strengths of this book is the attention it gives to Kitaev's contributions to quantum computing. ...A good understanding of the quantum part of this book will provide the researcher with invaluable insights and tools for new research. ...a lot can be learned from this book. ...a valuable resource for people who want to look up or learn the intricacies of things like the circuit model, quantum NP-completeness, etc.

-- SIGACT News

The first part of the book … consists of a compact introduction to classical complexity theory … provides an elegant summary of the definitions and some of the tools required for the rest of the book … The book is concluded with the solutions to all (!) exercises … I liked this book a lot and think that it provides an excellent complement to the existing books on quantum computation … Big pluses are the rigorous treatment of complexity issues, the introduction of the density matrix formalism early on, and complete solutions to all exercises … translation has been done remarkably well … concise … researchers in the area will like it.

-- Mathematical Reviews

The aim of the book is to teach the wonders of the qubit-algorithms. While other books, such as Nielsen-Chuang, serve as (more or less) comprehensive references, the present book is focused on complexity. Mathematical prerequisites are minimal, but a reader with some understanding of basic ideas from CS, and quantum theory will get more out of Kitaev, et al … Really well done, and nicely updated; a handy appendix was added, covering elementary math terms that are used … The book does a great job in explaining the fundamentals … The big question is why some qubit-algorithms are a lot better than classical counterparts … a reader comes away with a good understanding of this in the end.

-- Palle Jorgensen

Definitions and theorems are stated precisely … proofs are written with an eye towards rigor … most mathematicians will feel at home with the presentation of the material … main points are explained carefully and precisely … contains a number of exercises, with solutions to all … well suited to mathematicians interested in quantum algorithms.

-- MAA Monthly