Quantum Optimization for Combinatorial Searches

Details Quantum Optimization for Combinatorial Searches Quantum Optimization for Combinatorial Searches

2001-07-16

arxiv.org/abs/quant-ph/0107081v2

New Journal of Physics 4 (2002) 1.1-1.7

Physics

Quantum Physics

Revised, published version

Scientific paper

10.1088/1367-2630/4/1/326

I propose a "quantum annealing" heuristic for the problem of combinatorial search among a frustrated set of states characterized by a cost function to be minimized. The algorithm is probabilistic, with postselection of the measurement result. A unique parameter playing the role of an effective temperature governs the computational load and the overall quality of the optimization. Any level of accuracy can be reached with a computational load independent of the dimension {\it N} of the search set by choosing the effective temperature correspondingly low. This is much better than classical search heuristics, which typically involve computation times growing as powers of log({\it N})

Affiliated with

Also associated with

No associations

Rating

Quantum Optimization for Combinatorial Searches 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 Optimization for Combinatorial Searches, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Optimization for Combinatorial Searches will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472936