关于量子模幂的注记及Shor算法的实验证明
Remarks on Quantum Modular Exponentiation and Some Experimental Demonstrations of Shor's Algorithm
摘要：
一个有效的量子模幂方法是Shor因式分解算法不可缺少的。但是我们发现，Shor、Nielsen和Chuang、Markov和Saeedi等人提出的所有描述，是有缺陷的我们还注意到Shor算法的一些实验证明是误导性的，因为它们违反了所选数字$q=2^s$（其中$s$是第一个寄存器中使用的量子位数）必须满足$n^2 \leq q < 2n^2$（其中$n$是要分解的大数）的必要条件。
英文摘要：
An efficient quantum modular exponentiation method is indispensible for Shor's factoring algorithm. But we find that all descriptions presented by Shor, Nielsen and Chuang, Markov and Saeedi, et al., are flawed. We also remark that some experimental demonstrations of Shor's algorithm are misleading, because they violate the necessary condition that the selected number $q=2^s$, where $s$ is the number of qubits used in the first register, must satisfy $n^2 \leq q < 2n^2$, where $n$ is the large number to be factored.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
