旅行商问题的量子启发式算法
Quantum heuristic algorithm for traveling salesman problem
摘要：
通过推广Grover搜索，提出了一种求解旅行商问题的量子启发式算法.充分条件的推导，大大提高了概率找到旅游极值成本，几乎达到1，他们所示的旅游成本的统计特性的特点。特别是高斯分布的旅游沿成本，我们表明，量子算法表现出的二次加速其经典的同行，类似于Grover搜索。
英文摘要：
We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to unity and they are shown characterized by statistical properties of tour costs. In particular for a Gaussian distribution of the tours along the cost we show that the quantum algorithm exhibits the quadratic speedup of its classical counterpart, similarly to Grover search.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
