A precise estimation of the computational complexity in Shor's factoring algorithm

Details A precise estimation of the computational complexity in Shor's factoring algorithm A precise estimation of the computational complexity in Shor's factoring algorithm

2004-06-21

arxiv.org/abs/quant-ph/0406145v2

Applied Mathematics and Information Science, Vol.1(2007),pp.313-322

Physics

Quantum Physics

Scientific paper

A precise estimation of the computational complexity in Shor's factoring algorithm under the condition that the large integer we want to factorize is composed by the product of two prime numbers, is derived by the results related to number theory. Compared with Shor's original estimation, our estimation shows that one can obtain the solution under such a condition, by less computational complexity.

Affiliated with

Also associated with

No associations

Rating

A precise estimation of the computational complexity in 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 A precise estimation of the computational complexity in Shor's factoring algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A precise estimation of the computational complexity in Shor's factoring algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57687