【量子计算-算法】shor大数分解

shor大数分解算法 Classical part[edit] Pick a random number a < N. Compute gcd(a, N). This may be done using the Euclidean algorithm. If gcd(a, N) ≠ 1, then this number is a nontrivial factor of N, so we are

>>阅读原文<<