An Introduction to Quantum Computing Algorithms

An Introduction to Quantum Computing Algorithms
kskFCAAAQBAJ
140
By:"Arthur O. Pittenger"
"Computers"
Published on 2012-12-06 by Springer Science & Business Media

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.

READ NOW

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 \

This Book was ranked 7 by Google Books for keyword Introduction to Quantum Computing.

The book is written in enfor NOT_MATURE

Read Ebook Now
false
true

Printed Version of this book available in
BOOK

Availability of Ebook version is true,"listPrice": {"amount": 79.95,"currencyCode": "USD"in falseor true

Public Domain Status false

Rating by

SAMPLE

false