×

Classical computing, quantum computing and Shor’s factoring algorithm. (English) Zbl 1005.81014

Séminaire Bourbaki. Volume 1998/99. Exposés 850-864. Paris: Société Mathématique de France, Astérisque 266, 375-404, Exp. No. 862 (2000).
Summary: Quantum computing is a new theoretical model of computational processes. Thanks to the quantum superposition principle, it opens new perspective on the problem of devising efficient algorithms for performing tasks which classically require superpolynomial resources. The talk will address some basic issues of quantum computing and describe Shor’s quantum algorithm for factoring large integers. See SIAM J. Comput. 26, 1484–1509 (1997; Zbl 1005.11502).
For the entire collection see [Zbl 0939.00019].

MSC:

81P68 Quantum computation
68Q05 Models of computation (Turing machines, etc.) (MSC2010)
11Y05 Factorization

Citations:

Zbl 1005.11502
PDFBibTeX XMLCite
Full Text: arXiv Numdam EuDML