arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/9611004quant-ph
收藏

量子搜索启发式框架

A Framework for Quantum Search Heuristics

Tad Hogg

摘要:

提出了一种用于组合搜索的量子算法,为利用搜索算法提供了一个简单的框架。该算法在一个新的情况下,这是一个非结构化版本的图着色问题进行评估。平均而言,在对应于先前在搜索困难中识别的相变的情况下,它的表现明显优于直接使用量子并行性。这种改善的条件进行了说明。该算法的大部分是独立的特定问题的情况下,使其适合作为一个特殊用途的设备实现。

英文摘要:

A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs significantly better than the direct use of quantum parallelism, on average, in cases corresponding to previously identified phase transitions in search difficulty. The conditions underlying this improvement are described. Much of the algorithm is independent of particular problem instances, making it suitable for implementation as a special purpose device.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑