@incollection{SB_1998-1999__41__375_0, author = {Manin, Yuri I.}, title = {Classical computing, quantum computing, and {Shor's} factoring algorithm}, booktitle = {S\'eminaire Bourbaki : volume 1998/99, expos\'es 850-864}, series = {Ast\'erisque}, note = {talk:862}, pages = {375--404}, publisher = {Soci\'et\'e math\'ematique de France}, number = {266}, year = {2000}, mrnumber = {1772680}, zbl = {1005.81014}, language = {en}, url = {http://archive.numdam.org/item/SB_1998-1999__41__375_0/} }
TY - CHAP AU - Manin, Yuri I. TI - Classical computing, quantum computing, and Shor's factoring algorithm BT - Séminaire Bourbaki : volume 1998/99, exposés 850-864 AU - Collectif T3 - Astérisque N1 - talk:862 PY - 2000 SP - 375 EP - 404 IS - 266 PB - Société mathématique de France UR - http://archive.numdam.org/item/SB_1998-1999__41__375_0/ LA - en ID - SB_1998-1999__41__375_0 ER -
%0 Book Section %A Manin, Yuri I. %T Classical computing, quantum computing, and Shor's factoring algorithm %B Séminaire Bourbaki : volume 1998/99, exposés 850-864 %A Collectif %S Astérisque %Z talk:862 %D 2000 %P 375-404 %N 266 %I Société mathématique de France %U http://archive.numdam.org/item/SB_1998-1999__41__375_0/ %G en %F SB_1998-1999__41__375_0
Manin, Yuri I. Classical computing, quantum computing, and Shor's factoring algorithm, in Séminaire Bourbaki : volume 1998/99, exposés 850-864, Astérisque, no. 266 (2000), Talk no. 862, 30 p. http://archive.numdam.org/item/SB_1998-1999__41__375_0/
[BCDP] Efficient networks for quantum computing. Phys. Rev. A, 54:2 (1996), 1034-1063. | MR
, , , -[Ben1] The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines, J. Stat. Phys., 22 (1980), 563-591. | MR
-[Ben2] Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy, Phys. Rev. Lett., 48 (1980), 1581-1585. | MR
-[BoL] Quantum cryptoanalysis of hidden linear functions, Proc. of Advances in Cryptology - CRYPTO '95, Springer LN in Computer Science, vol. 963 (1995), 424-437. | MR | Zbl
, -[BoyBHT] Tight bounds on quantum searching, Preprint, 1996.
, , , -[CZ] Quantum computation with cold trapped ions, Phys. Rev. Lett., 74:20 (1995), 4091-4094.
, -[Deu] Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. R. Soc. Lond. A 400 (1985), 97-117. | MR | Zbl
-[DeuJ] Rapid solutions of problems by quantum computation, Proc. Roy. Soc. London, Ser. A, 449 (1992), 553-558. | MR | Zbl
, -[Fe1] Simulating physics with computers, Int. J. of Theor. Phys., 21 (1982), 467-488. | MR
-[Fe2] Quantum mechanical computers, Found. Phys., 16 (1986), 507-531. | MR
.[Fr1] Topological views on computational complexity, In Proc. ICM Berlin 1998, vol. II, 453-464. | MR | Zbl
-[Fr2] Limit, logic, and computation, Proc. Nat. Ac. Sci. USA, 95 (1998), 95-97. | MR | Zbl
-[Fr3] P/NP, and the quantum field computer, Proc. Nat. Ac. Sci. USA, 95 (1998), 98-101. | MR | Zbl
-[GaJ] Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San-Francisco, 1979. | MR | Zbl
, -[GeC] Bulk spin-resonance quantum computation, Science 275 (1997), 350-355. | MR
, -[Gri] Testing the shift-equivalence of polynomials using quantum mechanics, In: Manin's Festschrift, Journ. of Math. Sci., 82:1 (1996), 3184-3193. | MR | Zbl
-[Gro] Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79 (1997), 325-328.
-[Ki1] Quantum computations: algorithms and error correction, Russian Math. Surveys, 52:6 (1997), 53-112. | MR | Zbl
-[Ki2] Classical and quantum computations, Lecture notes, Independent University, Moscow, 1998.
-[Ma1] A Course in Mathematical Logic, Springer Verlag, 1977, pp. xiii+286. | MR | Zbl
-[Ma2] Computable and uncomputable (in Russian), Moscow, Sovetskoye Radio, 1980. | MR
-[Mu] The statistical description of visual signals, Preprint.
-[Po] Thermodynamical models of information processing (in Russian), Uspekhi Fizicheskikh Nauk, 115:3 (1975), 465-501.
-[Sa] Computation and Automata, Cambridge UP, 1985. | MR | Zbl
-[Sh] Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26:5 (1997), 1484-1509. | MR | Zbl
-[Si] On the power of quantum computation, Proc. of the 35th Ann. Symp. on Foundations of Comp. Sci. (1994), 116-123. | MR
-[Ts] Quantum information processing, Lecture notes, Tel-Aviv University, 1997.
-