---

＜電子ブック＞
An Introduction to Quantum Computing Algorithms / by Arthur O. Pittenger
(Progress in Computer Science and Applied Logic. ISSN:22970584 ; 19)

版	1st ed. 2000.
出版者	(Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser)
出版年	2000
本文言語	英語
大きさ	XII, 140 p : online resource
著者標目	*Pittenger, Arthur O author SpringerLink (Online service)
件　名	LCSH:Computer science LCSH:Mathematics LCSH:Computer science -- Mathematics  全ての件名で検索 LCSH:Quantum physics LCSH:Spintronics LCSH:Algorithms FREE:Theory of Computation FREE:Applications of Mathematics FREE:Mathematical Applications in Computer Science FREE:Quantum Physics FREE:Spintronics FREE:Algorithms
一般注記	1 Quantum -- 2 Basics of Quantum Computation -- 3 Quantum Algorithms -- 4 Quantum Error-Correcting Codes -- Afterword -- References 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 HTTP:URL=https://doi.org/10.1007/978-1-4612-1390-1

 類似資料