An introduction to quantum computing algorithms
Author(s)
Bibliographic Information
An introduction to quantum computing algorithms
（Progress in computer science and applied logic, v. 19）
Birkhäuser, c2000
- : alk. paper
Available at 39 libraries
Note
Includes bibliographical references and index
Description and Table of Contents
- Volume
-
: alk. paper ISBN 9780817641276
Description
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. 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. Quan tum computing had arrived. 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. 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. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.
Table of Contents
[see attached for complete TOC]
Preface * Acknowledgements * 1. Quantum Statics * 2. Basics of Quantum Computation * 3. Quantum Algorithms * 4. Quantum Error-Correcting Codes * Afterword * References * Index
- Volume
-
ISBN 9783764341275
Description
Aimed at engaging the mathematically literate reader who may not have a background in all the subspecialities of the field, this volume presents the context for understanding and developing algorithms for a "prospective" quantum computer.
by "Nielsen BookData"