An Introduction to Quantum Computing Algorithms
| Author | : | |
| Rating | : | 4.30 (800 Votes) |
| Asin | : | 0817641270 |
| Format Type | : | paperback |
| Number of Pages | : | 140 Pages |
| Publish Date | : | 2017-06-28 |
| Language | : | English |
DESCRIPTION:
Since quantum computing is a highly interdisciplinary science, the author has tried to capture the attention of a large variety of readers and he has mostly achieved this objective. The book can be used as a formal introductory text for graduate students as well as a fascinating, but still engaging resource for interested readers who are comfortable with linear algebra. Pittenger helps the reader into focusing attention on the algorithmic aspects rather than the formal content and uses examples as an integral part of the book, illustrating the substantial meaning of quantum theory applied to computing. He also proposes some exercises to stimulate an insightful reading.&nb
Not for a Computer Scientist or Mathematician A Customer who don't have a strong background in Physics. The first "basic" example is a particle spin interaction that displays quantum entanglement. Well, maybe that's easy for a physics major, but a math and computer science major will be totally clueless! It assumes too much quantum physics for non-physics people, myself included. Quantum Computing by Mika Hirvensalo is a much better starting point for these who have traditional background in math and computer science. Also, if you want to build a good intuition about quantum systems before doing algorithms, QED by Richard Feynman would be a good r. "Friendly" according to Palle E T Jorgensen. A handful of good introductions to ideas in quantum computing have appeared in the past two years. The present one stands out in being both friendly and brief. There is no way into the subject, getting around the fundamentals in quantum physics and in math. Through this little book, an uninitiated reader can get some insight into the ideas of Deutsch-Jozsa, and the algorithms of Peter Shor and Lov Grover. The author does his job, as well as any, and the book is pleasant reading.. what I was looking for. A Customer Do a search for "quantum computing" on amazon and you'll find a lot of duff books. I wanted an exposition that begins with the simplest possible mathematics and the least possible necessary background in quantum theory, and progresses nicely into being able to comprehend papers in the field. Here it is. All you need to carry around with this is a nice, rigorous linear algebra text (I recommend FIS). Word 'em up.
His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.. Quan tum computing had arrived. A related question was discussed shortly thereafter by Richard Feynman 35 who began from a different perspec tive by asking what kind of computer should be used to simulate physics. In 1994 Peter Shor 65 published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. The study of the role of quantum mechanics in the theory of computa tion seems to have begun in the early 1980s with the publications of Paul Benioff 6' 7 who considered a quantum mechanical model of computers and the computation process. Since the difficulty of the factoring problem is crucial for the se curity of a public key encryption system, interest (and funding) in quan tum computing and quantum computation suddenly blossomed