从最大割到最大独立集
From Maximum Cut to Maximum Independent Set
AI总结：
本研究基于最大割、最大独立集均与Ising模型相关的特性，提出用Max-Cut/Ising求解器解决MIS问题，在随机Erdős-Rényi图近似和编码理论基准测试中表现优异，为相关量子算法发展铺路。
摘要：
最大割（Max-Cut）问题可自然表示为二次无约束二元优化（QUBO）形式，也可表示为Ising模型。长期以来已知最大独立集（MIS）问题也可与一种特定的Ising模型相关联。因此，用各类Max-Cut/Ising求解器来解决MIS问题是很自然的思路。结果表明，该策略极大提升了对随机Erdős-Rényi图独立数的近似效果，在编码理论的一个基准测试上也表现出完美性能。这些结果为MIS问题上近似量子算法的进一步发展，尤其是对应编码问题的相关研究铺平了道路。
英文摘要：
The Maximum Cut (Max-Cut) problem could be naturally expressed either in a Quadratic Unconstrained Binary Optimization (QUBO) formulation, or as an Ising model. It has long been known that the Maximum Independent Set (MIS) problem could also be related to a specific Ising model. Therefore, it would be natural to attack MIS with various Max-Cut/Ising solvers. It turns out that this strategy greatly improves the approximation for the independence number of random Erdős-Rényi graphs. It also exhibits perfect performance on a benchmark arising from coding theory. These results pave the way for further development of approximate quantum algorithms on MIS, and specifically on the corresponding coding problems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
