Author | Pittenger, Arthur O. author |
---|---|

Title | An Introduction to Quantum Computing Algorithms [electronic resource] / by Arthur O. Pittenger |

Imprint | Boston, MA : Birkhรคuser Boston : Imprint: Birkhรคuser, 2000 |

Connect to | http://dx.doi.org/10.1007/978-1-4612-1390-1 |

Descript | XII, 140 p. online resource |

SUMMARY

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

CONTENT

1 Quantum -- 2 Basics of Quantum Computation -- 3 Quantum Algorithms -- 4 Quantum Error-Correcting Codes -- Afterword -- References

Computer science
Computers
Algorithms
Computer science -- Mathematics
Applied mathematics
Engineering mathematics
Quantum physics
Quantum computers
Spintronics
Computer Science
Theory of Computation
Applications of Mathematics
Math Applications in Computer Science
Quantum Physics
Quantum Information Technology Spintronics
Algorithm Analysis and Problem Complexity