An integral version of Shor's factoring algorithm

Details An integral version of Shor's factoring algorithm An integral version of Shor's factoring algorithm

2001-09-20

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

Physics

Quantum Physics

LaTex, 27 pages, 2 tables

Scientific paper

We consider a version of Shor's quantum factoring algorithm such that the quantum Fourier transform is replaced by an extremely simple one where decomposition coefficients take only the values of $1,i,-1,-i$. In numerous calculations which have been carried out so far, our algorithm has been surprisingly stable and never failed. There are numerical indications that the probability of period finding given by the algorithm is a slowly decreasing function of the number to be factorized and is typically less than in Shor's algorithm. On the other hand, quantum computer (QC), capable of implementing our algorithm, will require a much less amount of resources and will be much less error-sensitive than standard QC. We also propose a modification of Coppersmith' Approximate Fast Fourier Transform. The numerical results show that the probability is signifacantly amplified even in the first post integral approximation. Our algorithm can be very useful at early stages of development of quantum computer.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-722994