期刊
INFORMATION SCIENCES
卷 128, 期 3-4, 页码 181-197出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/S0020-0255(00)00052-9
关键词
-
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据