在量子退火机上研究中国邮递员问题
Investigating the Chinese Postman Problem on a Quantum Annealer
摘要：
量子退火机的最近可用性推动了信息技术的一个新领域，在该领域中，这种设备被应用于利用量子力学现象的硬件来解决实际动机和计算困难的问题。D-Wave退火机是以二次无约束二元优化的形式解决这些问题的有前途的平台。在这里，我们提供了一个制定的中国邮递员问题，可以作为一个工具，用于探测图和网络的局部连通性。我们对待这个问题的经典禁忌算法和使用的D-波设备。我们系统地分析与特定硬件相关的计算参数。我们的研究结果阐明了嵌合体图的有限连通性嵌入、逻辑量子比特的定义以及自旋反转的作用之间的相互作用如何控制达到预期解的概率。
英文摘要：
The recent availability of quantum annealers has fueled a new area of information technology where such devices are applied to address practically motivated and computationally difficult problems with hardware that exploits quantum mechanical phenomena. D-Wave annealers are promising platforms to solve these problems in the form of quadratic unconstrained binary optimization. Here we provide a formulation of the Chinese postman problem that can be used as a tool for probing the local connectivity of graphs and networks. We treat the problem classically with a tabu algorithm and using a D-Wave device. We systematically analyze computational parameters associated with the specific hardware. Our results clarify how the interplay between the embedding due to limited connectivity of the Chimera graph, the definition of logical qubits, and the role of spin-reversal controls the probability of reaching the expected solution.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
