A quantum Turing machine is considered. A review of basic methodological principle sand achievements in the field of quantum computations is given. some problems of construction of correct quantum computations and the...
详细信息
A quantum Turing machine is considered. A review of basic methodological principle sand 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.
暂无评论