arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.08939quant-ph
收藏

基于基准优化问题的量子退火器与混合求解器的实验分析

Experimental analysis of quantum annealers and hybrid solvers using benchmark optimization problems

Evangelos Stogiannos, Christos Papalitsas, Theodore Andronikos

AI总结:

本文针对 D-Wave 量子系统上的 HCP 和 TSP 问题提出新的矩阵公式以自动集成基准实例,并通过实验比较不同量子退火器与混合求解器的性能,揭示不完全图需要更多量子比特的原因。

摘要:

本文研究了 D-Wave 量子系统上的哈密顿回路问题(HCP)和旅行商问题(TSP)。最初,由于大多数库以邻接矩阵的形式提供其基准实例,我们为 HCP 和 TSP 哈密顿量开发了一种新颖的矩阵公式,从而能够在量子平台上无缝且自动地集成基准实例。我们广泛的实验测试得出了一些有趣的结论。D-Wave 的 Advantage_system4.1 在量子比特利用率和解的质量方面均优于 Advantage_system1.1。最后,我们通过实验证实,D-Wave 的混合求解器始终能为问题提供有效解,且不违反 QUBO 约束,即使对于规模高达 120 个节点的任意大规模问题也是如此。在求解 TSP 实例时,量子退火器产生的解往往是无效的,即它们违反了图的拓扑结构。为了解决这一问题,我们主张对 TSP 哈密顿量的系数使用 min-max 归一化。最后,我们对表达 HCP 和 TSP 哈密顿量所需的精确约束数量进行了全面的数学分析。该分析定量地解释了为什么运行不完全图实例几乎总是比完全图实例需要更多的量子比特。结果表明,不完全图比完全图需要更多的二次约束,这一事实已通过一系列实验得到证实。

英文摘要:

This paper studies the Hamiltonian Cycle Problem (HCP) and the Traveling Salesman Problem (TSP) on D-Wave's quantum systems. Initially, motivated by the fact that most libraries present their benchmark instances in terms of adjacency matrices, we develop a novel matrix formulation for the HCP and TSP Hamiltonians, which enables the seamless and automatic integration of benchmark instances in quantum platforms. our extensive experimental tests have led us to some interesting conclusions. D-Wave's {\tt Advantage\_system4.1} is more efficient than {\tt Advantage\_system1.1} both in terms of qubit utilization and quality of solutions. Finally, we experimentally establish that D-Wave's Hybrid solvers always provide a valid solution to a problem, without violating the QUBO constraints, even for arbitrarily big problems, of the order of $120$ nodes. When solving TSP instances, the solutions produced by the quantum annealer are often invalid, in the sense that they violate the topology of the graph. To address this use we advocate the use of \emph{min-max normalization} for the coefficients of the TSP Hamiltonian. Finally, we present a thorough mathematical analysis on the precise number of constraints required to express the HCP and TSP Hamiltonians. This analysis, explains quantitatively why, almost always, running incomplete graph instances requires more qubits than complete instances. It turns out that incomplete graph require more quadratic constraints than complete graphs, a fact that has been corroborated by a series of experiments.

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

↑