| Abstract: | ![]()
A quantum Turing machine is considered. A review of basic methodological principles and achievements in the field of quantum computations is given. Some problems of construction of correct quantum computations and their complexity are considered. The result of P. Shor concerning the solution of the problems of taking discrete logarithms in polynomial time relative to the length of numbers is considered in detail. Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 58–76, January–February, 2000. |
