Snake-in-the-box 与 Coil-in-the-box 问题的 QUBO 建模
QUBO formulation for the Snake-in-the-box and Coil-in-the-box problems
AI总结：
本文为 SITB、CITB 及最大公共诱导子图问题提出并证明了新的 QUBO 建模，且经经典与量子求解器验证可求得至多 5 维的最优解。
摘要：
本文提出了首批针对 Snake-in-the-box（SITB）和 Coil-in-the-box（CITB）问题的 QUBO 建模。两种建模还分别能够求解最大诱导路径和最大诱导环这两个 NP-Hard 问题。在此过程中，我们还发现了一种用于最大公共诱导子图问题的新 QUBO 建模。我们证明了针对 SITB、CITB 和最大公共子图问题所提建模的正确性，并在经典求解器和量子求解器上测试了 SITB 与 CITB 的建模，能够获得至多 5 维的最优解。
英文摘要：
This paper present the first QUBO formulations for the Snake-in-the-box (SITB) and Coil-in-the-box (CITB) problems. Both formulations are also capable of solving the NP-Hard problems of Maximum induced path and Maximum induced cylce respectively. In the process we also found a new QUBO formulation for the Maximum Common Induced Sub-graph problem. We proved the correctness of our formulations for the SITB, CITB and Maximum Common Sub-graph problem, and tested the formulations of the SITB and CITB in both classical and quantum solvers, being able to get the best solution for up to 5 dimensions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
