arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.00568quant-phcs.DM
收藏

离散二次模型的 QUBO 解空间结构

Discrete quadratic model QUBO solution landscapes

Tristan Zaborniak, Ulrike Stege

AI总结:

本文研究了离散二次模型(DQM)转换为 QUBO 模型时,编码方式(one-hot 和 domain-wall)与惩罚强度对解空间结构及优化的影响,为量子及量子启发式硬件求解 NP-hard 问题提供理论分析。

摘要:

许多计算问题涉及具有二次交互的离散变量优化。这些问题被称为离散二次模型(DQM),通常属于 NP-hard 问题。因此,人们越来越关注将 DQM 编码为二次无约束二值优化(QUBO)模型,以便通过专门为此类问题类型设计的架构和求解方法的量子及量子启发式硬件来求解。然而,将 DQM 转换为 QUBO 模型通常会在 QUBO 模型的解空间中引入无效解。必须通过在 QUBO 目标函数中引入适当的约束来惩罚这些解,约束由可调惩罚参数加权,以确保全局最优解是有效的。然而,考虑到该参数对解空间结构的影响,选择其强度并非易事。在此,我们研究了编码选择和惩罚强度对 QUBO DQM 解空间结构及其优化的影响,特别关注 one-hot 和 domain-wall 编码。

英文摘要:

Many computational problems involve optimization over discrete variables with quadratic interactions. Known as discrete quadratic models (DQMs), these problems in general are NP-hard. Accordingly, there is increasing interest in encoding DQMs as quadratic unconstrained binary optimization (QUBO) models to allow their solution by quantum and quantum-inspired hardware with architectures and solution methods designed specifically for such problem types. However, converting DQMs to QUBO models often introduces invalid solutions to the solution space of the QUBO models. These solutions must be penalized by introducing appropriate constraints to the QUBO objective function that are weighted by a tunable penalty parameter to ensure that the global optimum is valid. However, selecting the strength of this parameter is non-trivial, given its influence on solution landscape structure. Here, we investigate the effects of choice of encoding and penalty strength on the structure of QUBO DQM solution landscapes and their optimization, focusing specifically on one-hot and domain-wall encodings.

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

↑