摘要
因子分解对所有的现行计算机而言是难解的 .这是现在通用的公共加密系统的基础 .文章介绍了在量子计算机上进行的Shor量子算法 ,即利用量子态的相干叠加和纠缠特性以及量子逻辑门实现量子计算的方法 ;并着重从理论原理和实验实现这两方面说明利用余因子函数和离散傅里叶变换使这种量子算法对因子分解是有效的 .
Factorization is a non\|polynomial problem for the present computers. It is the basis of the public cryptography. In this paper, we discuss the Shor's quantum algorithm on a quantum computer, which is the algorithm using the coherence and entanglement of quantum states on which the quantum logic gates act. We then emphasize from the theoretical principle and the experimental realization the efficiency of the quantum factorization by using the remainder function and discrete Fourier transform.
出处
《物理》
CAS
2000年第9期560-564,共5页
Physics
基金
国家自然科学基金
关键词
量子计算
量子算法
因子分解
量子计算机
quantum computation, quantum algorithm, factorization, remainder function, discrete Fourier transform
