Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1005.81014
Manin, Yuri I.
Classical computing, quantum computing and Shor's factoring algorithm. (English)
[A] 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).

MSC 2000:: *81P68 Quantum computation and quantum cryptography
68Q05 Models of computation
11Y05 Factorization

Keywords: classical computing; quantum computing; constructive universe; P/NP problem; fast factorization; Shor's algorithm

Citations: Zbl 1005.11502

Cited in: Zbl 1006.81008

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Article

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]