| A Note on Shor’s Quantum Algorithm |
| |
| 引用本文： | 曹正军,刘丽华.A Note on Shor’s Quantum Algorithm[J].上海交通大学学报(英文版),2006(3). |
| |
| 作者姓名： | 曹正军 刘丽华 |
| |
| 作者单位： | Dept. of Mathematics Shanghai Univ. Shanghai 200444 China，Dept.of Mathematics，Shanghai Jiaotong Univ.，Shanghai 200240，Dept.of Information and Computation Science Shanghai Maritine Univ. Shanghai 200135 |
| |
| 摘 要： | Introduction Factoring integers is generally thought to behard on a classical computer. But it is now heldthat prime factorization can be accomplished inpolynomial time on a quantum computer. This re-markable work is due to Shor1]. For a given num-ber n, he gave a quantum computer algorithm forfinding the order r of an element x (mod n) insteadof giving a quantum computer algorithm for factor-ing n directly. The indirect algorithm is feasiblebecause factorization can be reduced to finding th…
|
| 本文献已被 CNKI 等数据库收录！ |
