首页|Shor's algorithm does not factor large integers in the presence of noise
Shor's algorithm does not factor large integers in the presence of noise
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
We consider Shor's quantum factoring algorithm in the setting of noisy quantum gates.Under a generic model of random noise for(controlled)rotation gates,we prove that the algorithm does not factor integers of the form pq when the noise exceeds a vanishingly small level in terms of n-the number of bits of the integer to be factored,where p and q are from a well-defined set of primes of positive density.We further prove that with probability 1-o(1)over random prime pairs(p,q),Shor's factoring algorithm does not factor numbers of the form pq,with the same level of random noise present.
random noiseShor's algorithmrotation gatesquantum computingprime factorization
Jin-Yi CAI
展开 >
College of Letters and Science,University of Wisconsin,Madison WI 53706,USA
NETL
NSTL
万方数据
