New quantum algorithm for studying NP-complete problems

Details New quantum algorithm for studying NP-complete problems New quantum algorithm for studying NP-complete problems

2004-06-29

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

Rep.Math.Phys.,52, No.1,25-33, 2003

Physics

Quantum Physics

11 pages, 1 figure

Scientific paper

Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete problems and argue that the problem, in principle, can be solved in polynomial time by using our new quantum algorithm.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-525887