An Introduction to Quantum Computing Algorithms

Arthur O. Pittenger (Autor)

Buch | Softcover

140 Seiten

2012 | Softcover reprint of the original 1st ed. 2000
Springer-Verlag New York Inc.
978-1-4612-7127-7 (ISBN)

Artikel merken

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.

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

Erscheint lt. Verlag	16.12.2012
Reihe/Serie	Progress in Computer Science and Applied Logic ; 19
Zusatzinfo	XII, 140 p.
Verlagsort	New York
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
	Naturwissenschaften ► Physik / Astronomie ► Quantenphysik
ISBN-10	1-4612-7127-4 / 1461271274
ISBN-13	978-1-4612-7127-7 / 9781461271277
Zustand	Neuware