Linear-time approach for quantum factoring, searching and NP-complete problems

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

35 pages, 9 figures

Scientific paper

Using three coupled harmonic oscillators, we have recently proposed [arXiv:1007.4338] an alternative approach for quantum factorization of an integer. However, the probability of obtaining the factors becomes low when this number is large. Here, we circumvent this limitation by using a new iterative method which can efficiently increase the probability of finding the factors. We show that the factors of a number can be obtained, in linear time, with a high probability. This amplitude-amplification method can be applied to search problems. This implies that search-based problems including NP-complete problems can be exponentially sped up. In addition, we generalize the method of amplitude amplification by using a system of coupled harmonic oscillators. This can be used for solving a system of linear or nonlinear functions with integer inputs subject to a number of constraints. The total number of oscillators in the system is equal to the number of integer variables in the functions plus the number of constraints.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Linear-time approach for quantum factoring, searching and NP-complete problems 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 Linear-time approach for quantum factoring, searching and NP-complete problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear-time approach for quantum factoring, searching and NP-complete problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-269699

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.