An Introduction to Quantum Computing Algorithms (Hardcover, 1st ed. 2000. Corr. 2nd printing 2001)

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.

General

Imprint:	Birkhauser Boston
Country of origin:	United States
Series:	Progress in Computer Science and Applied Logic, 19
Release date:	2001
First published:	February 2001
Authors:	Arthur O. Pittenger
Dimensions:	235 x 155 x 11mm (L x W x T)
Format:	Hardcover
Pages:	140
Edition:	1st ed. 2000. Corr. 2nd printing 2001
ISBN-13:	978-0-8176-4127-6
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Applied mathematics > General Promotions
LSN:	0-8176-4127-0
Barcode:	9780817641276

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!