Journal
INFORMATION SCIENCES
Volume 128, Issue 3-4, Pages 181-197Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/S0020-0255(00)00052-9
Keywords
-
Categories
Ask authors/readers for more resources
We present a quantum algorithm for combinatorial optimization using the cost structure of the search states. Its behavior is illustrated for overconstrained satisfiability (SAT) and asymmetric traveling salesman problems (ATSP). Simulations with randomly generated problem instances show each step of the algorithm shifts amplitude preferentially towards lower cost states, thereby concentrating amplitudes into low-cost states, on average. These results are compared with conventional heuristics for these problems. (C) 2000 Elsevier Science Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available