Physics – Quantum Physics
Scientific paper
2000-12-20
Physics
Quantum Physics
5 pages, pdf only [Finally deleted a blooper paragraph about expected runtimes that is only true for Euclidean TSP and has a b
Scientific paper
The question of whether or not quantum computers can efficiently solve NP-complete problems is open, although indications are that BQP does not contain NP. Still, many of these problems are natural candidates for solution on quantum computers. We outline a thermodynamical formalism for the traveling salesman problem which allows for its expected polytime solution on a quantum computer with probability arbitrarily close to unity, given sufficient energy resources and subject to a weak nondegeneracy constraint on the distances. Applications to other problems are also discussed.
No associations
LandOfFree
Quantum simulated annealing 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 simulated annealing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum simulated annealing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-375099