Improving the Success Probability for Shor's Factoring Algorithm

Details Improving the Success Probability for Shor's Factoring Algorithm Improving the Success Probability for Shor's Factoring Algorithm

2002-08-29

arxiv.org/abs/quant-ph/0208183v1

Physics

Quantum Physics

Scientific paper

Given n=p*q with p and q prim and y in Z_{p*q}^*. Shor's Algorithm computes the order r of y, i.e. y^r=1 (mod n). If r=2k is even and y^k \ne -1 (mod n) we can easily compute a non trivial factor of n: gcd(y^k-1,n). In the original paper it is shown that a randomly chosen y is usable for factoring with probabily {1/2}. In this paper we will show an efficient possibility to improve the lower bound of this probability by selecting only special y in Z_n^* to {3/4}, so we are able to reduce the fault probabilty in the worst case from {1/2} to {1/4}.

Affiliated with

Also associated with

No associations

Rating

Improving the Success Probability for Shor's Factoring Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improving the Success Probability for Shor's Factoring Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving the Success Probability for Shor's Factoring Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-531035