Classical and Quantum Computation (Graduate Studies in Mathematics)

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.

Disclaimer:
Contents of this page are indexed from the Internet. All actions are under your responsability. Email us to report illegal contents or external links and we'll remove them immediately.

Please check the description for download links if any or do a search to find alternative books.

Can't Download?
Please search mirrors if you can't find download links for "Classical and Quantum Computation (Graduate Studies in Mathematics)" in "Description" and someone else may update the links. Check the comments when back to find any updates.

Search Mirrors
Maybe some mirror pages will be helpful, search this book at top of this page or click here to find more info.

1. Ebooks list page : 2014
2. Classical Groups and Geometric Algebra (Graduate Studies in Mathematics, V. 39)
3. Mathematical Methods in Quantum Mechanics: With Applications to Schrodinger Operations (Graduate Studies in Mathematics)
4. Option Pricing and Portfolio Optimization: Modern Methods of Financial Mathematics (Graduate Studies in Mathematics)
5. Mathematics of Quantum Computation and Quantum Technology
6. Analysis (Graduate Studies in Mathematics)
7. Mathematics of Quantum Computation
8. Fourier Analysis (Graduate Studies in Mathematics)
9. A Course in Operator Theory (Graduate Studies in Mathematics)
10. Hamilton's Ricci Flow (Graduate Studies in Mathematics)
11. 4-Manifolds and Kirby Calculus (Graduate Studies in Mathematics)
12. An Invitation to Operator Theory (Graduate Studies in Mathematics, V. 50)
13. Noncommutative Noetherian Rings (Graduate Studies in Mathematics, V. 30)
14. Mathematics of Classical and Quantum Physics
15. Mathematics of Classical and Quantum Physics
16. Representations of Finite and Compact Groups (Graduate Studies in Mathematics ; V. 10)