Science Resources RSS Feeds
|
 |
 |
 |
| View Larger Image | An Introduction to Quantum Computing | Paperbackby Phillip Kaye (Author), Raymond Laflamme (Author), Michele Mosca (Author)
| List Price: | $65.00 | | Price: | $56.94 | | You Save: | $8.06 (12%) | | | Available: | Usually ships in 1 to 4 weeks |
| | Binding: | Paperback | | Publisher: | Oxford University Press, USA | | Edition: | 1st Edition | | Page Count: | 288 Pages | | Publication Date: | January 18, 2007 | | Sales Rank: | 115,597th |
|
EDITORIAL REVIEWS | Product Description This concise, accessible text provides a thorough introduction to quantum computing - an exciting emergent field at the interface of the computer, engineering, mathematical and physical sciences. Aimed at advanced undergraduate and beginning graduate students in these disciplines, the text is technically detailed and is clearly illustrated throughout with diagrams and exercises. Some prior knowledge of linear algebra is assumed, including vector spaces and inner products. However, prior familiarity with topics such as tensor products and spectral decomposition is not required, as the necessary material is reviewed in the text. |
CUSTOMER REVIEWS (Average Customer Rating: 5.0 based on 3 reviews)
| A clear, concise book by eyeinzsky75 (US) 5 Stars October 27, 2008 Compared to other books on the topic, this book offers a clear and concise treatment of quantum computing. The book's notation is also easy to follow. I recommended the book to my class.
| | Terrific choice for engineers interested in quantum computing by calvinnme (Fredericksburg, Va) 5 Stars July 14, 2007 This book is geared for the reader who has an undergraduate education in a technical field and who has a solid background in linear algebra, including vector spaces and inner products. Prior familiarity with topics such as eigendecomposition and more advanced mathematical topics is not required. The book reviews all of the necessary additional material. There are some places in the book where group theory is referred to, but these sections of the book are self-contained so that the reader can skip them if needed. It is a very accessible introduction to a complex subject that is fairly detailed and complete. Exercises are integrated into the body of the text. Each exercise is designed to illustrate a particular concept, fill in the details of a calculation or proof, or to show how concepts in the book can be generalized or extended. The following is a brief overview of the book:
1. Introduction and Background - Presents some fundamental notions of computation theory and quantum physics that will form the basis of what follows.
2. Linear Algebra and the Dirac Notation - Familiarizes the reader with the algebraic notation used in quantum mechanics, reminds the reader of some basic facts about complex vector spaces, and introduces some notions that may not have been covered in an elementary linear algebra course.
3. Qubits and the Framework of quantum Mechanics - Introduces the framework of quantum mechanics as it pertains to the types of systems that are considered in the book. Here the author also introduces the notion of a quantum bit or "qubit", which is a fundamental concept in quantum computing.
4. A Quantum Model of Computation - The circuit model of classical computation can be generalized to a model of quantum circuits. In such a model you have logical qubits carried along "wires" and quantum gates that act on the qubits. For convenience, the discussion is limited to unitary quantum gates.
5. Superdense Coding and Quantum Teleportation - Looks at our first protocols for quantum information. Examines two communication protocols that can be implemented using the tools which can be implemented using the tools developed in previous chapters. These protocols are known as superdense coding and quantum teleportation. Both of these are inherently quantum - there are no classical protocols that behave in the same way as these.
6. Introductory Quantum Algorithms - Describes some of the early quantum algorithms that are simple and illustrate the main ingredients behind the more useful and powerful quantum algorithms described in subsequent chapters. Since quantum algorithms share some features with classical probabilistic algorithms, the chapter starts with a comparison of the two algorithmic paradigms.
7. Algorithms with Superpolynomial Speed-Up - Examines one of two main classes of algorithms: quantum algorithms that solve problems with a complexity that is superpolynomially less than the complexity of the best-known classical algorithm for the same problem. That is, the complexity of the best-known classical algorithm cannot be bounded above by any poynomial in the complexity of the quantum algorithm. The chapter starts off by studying the problem of quantum phase estimation, which leads naturally to the Quantum Fourier Transform (QFT).
8. Algorithms Based on Amplitude Amplification - Discusses a broadly applicable quantum algorithm - quantum search - that provides a polynomial speed-up over the best-known classical algorithms for a wide class of important problems.
9. Quantum Computational Complexity Theory and Lower Bounds - Quantum computers seem to be more powerful than classical computers for certain problems. However, there are limits on the power of quantum computers. Since a classical computer can simulate a quantum one, a quantum computer can only compute the same set of functions that a classical computer can. This chapter examines this and some related issues.
10. Quantum Error Correction - Quantum computers are more susceptible to errors than classical digital computers because quantum mechanical systems are more delicate and more difficult to control. If large-scale quantum computers are to be possible, a theory of quantum error correction is needed. This is the issue discussed in this chapter.
Overall, I found this book well suited to self-study, particularly for someone with an engineering background. Highly recommended.
| | Great book by C. Chiang 5 Stars June 08, 2007 For a beginner like me, I think this is a great book. I used to spend lots of time on N+C book but still got confused.
This introduction to Quantum computing book has lots of illustrations explaining how things are done step by step inside those complicated algorithms. If you study on your own with this book, there should be no problem. Then you can go back to review N+C's book and things would be much more clear.
| |
SIMILAR PRODUCTS |

| Quantum Computation and Quantum Information by Michael A. Nielsen (Author), Isaac L. Chuang (Author)
In this first comprehensive introduction to the main ideas and techniques of quantum computation and information, Michael Nielsen and Isaac Chuang ask the question: What are the ultimate physical limits to computation and communication? They detail such remarkable effects as fast quantum algorithms, quantum teleportation, quantum cryptography and quantum error correction. A wealth of accompanying figures and exercises illustrate and develop the material in more depth. They describe what a...
| 
| Quantum Computer Science: An Introduction by N. David Mermin (Author)
In the 1990's it was realized that quantum physics has some spectacular applications in computer science. This book is a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the...
| 
| Classical and Quantum Computation (Graduate Studies in Mathematics) by A. Yu. Kitaev (Author), A. H. Shen (Author), M. N. Vyalyi (Author)
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),...
| 
| Introduction to Quantum Information Science (Oxford Graduate Texts) by Vlatko Vedral (Author)
This book offers a concise and up-to-date introduction to the popular field of quantum information. It has originated in a series of invited lecture courses at various universities in different countries. This is reflected in its informal style of exposition and presentation of key results in the subject. In addition to treating quantum communication, entanglement and algorithms in great depth, this book also addresses a number of interesting miscellaneous topics, such as Maxwell's demon,...
| 
| Quantum Computing for Computer Scientists by Noson S. Yanofsky (Author), Mirco A. Mannucci (Author)
The multidisciplinary field of quantum computing strives to exploit some of the uncanny aspects of quantum mechanics to expand our computational horizons. Quantum Computing for Computer Scientists takes readers on a tour of this fascinating area of cutting-edge research. Written in an accessible yet rigorous fashion, this book employs ideas and techniques familiar to every student of computer science. The reader is not expected to have any advanced mathematics or physics background. After...
|
|
|
|