Quantum Elastic Net and the Traveling Salesman Problem

Details Quantum Elastic Net and the Traveling Salesman Problem Quantum Elastic Net and the Traveling Salesman Problem

2007-12-14

arxiv.org/abs/0712.2362v3

Physics of Particles and Nuclei Lett. 2009, V.6, P. 599

Physics

Quantum Physics

Reported at Quantum Physics and Communication, Dubna, October 15-19, 2007

Scientific paper

Theory of computer calculations strongly depends on the nature of elements the computer is made of. Quantum interference allows to formulate the Shor factorization algorithm turned out to be more effective than any one written for classical computers. Similarly, quantum wave packet reduction allows to devise the Grover search algorithm which outperforms any classical one. In the present paper we argue that the quantum incoherent tunneling can be used for elaboration of new algorithms able to solve some NP-hard problems, such as the Traveling Salesman Problem, considered to be intractable in the classical theory of computer computations.

Affiliated with

Also associated with

No associations

Rating

Quantum Elastic Net and the Traveling Salesman Problem 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 Quantum Elastic Net and the Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Elastic Net and the Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-662685