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

无权图上的QASPA-MaxCut:边编码与QAOA重启

QASPA-MaxCut on Unweighted Graphs: Edge Encoding and QAOA Restarts

Dmytro Sapozhnyk

AI总结:

本文提出用于无权图最大割的QASPA-MaxCut移位相位电路,通过边编码实现,经精确模拟对比,其选择比优于深度1的QAOA,为浅电路下最大割的经典搜索预算研究提供了依据。

摘要:

最大割(Max-Cut)是近期量子优化的常用测试平台,因其具有简单的伊辛哈密顿量、成熟的经典基线,以及性能依赖外部经典优化器的参数化量子电路。本文开发了用于最大割的QASPA-MaxCut,这是一种移位相位电路,通过形式为$\text{CX}_{ij}R_y(\theta_{ij})\text{CX}_{ij}$的受控$R_y$旋转对图边进行编码。我们推导了边块的精确两量子比特代数,追踪了一个无权四顶点示例,并通过精确态矢量模拟将单层QASPA-MaxCut与深度为1的QAOA进行比较。该协议使用种子42,评估具有额外边概率$p_{\text{edge}}\u2208\{0.1,0.3,0.5,0.7\}$的连通主干增强随机图,并添加了19种自定义无权拓扑。QASPA-MaxCut得分在算法的经典选择阶段后报告:对前四个QASPA比特串计算最大割目标,并保留最佳割;QAOA得分是局部优化后的期望近似比,报告为1到10次重启的最佳k曲线。在这些小型精确模拟中,固定角度QASPA-MaxCut产生的报告组平均选择比在0.955到1.000之间,在规则$\u23080.03047\cdot2^n+1016.2\u2309$下,保留的有限次测量检查中的拓扑级读出不变,深度为1的QAOA随额外经典重启而提升,但在报告的平均汇总中仍低于QASPA选择得分。该比较为进一步研究在浅电路深度下获得有竞争力的最大割样本所需的经典搜索预算提供了动机。

英文摘要:

Max-Cut is a common testbed for near-term quantum optimization because it has a simple Ising Hamiltonian, established classical baselines, and a parameterized quantum circuit whose performance depends on the outer classical optimizer. This paper develops QASPA-MaxCut, a shift-phase circuit for Max-Cut that encodes graph edges through controlled $R_y$ rotations of the form $\mathrm{CX}_{ij}R_y(θ_{ij})\mathrm{CX}_{ij}$. We derive the exact two-qubit algebra of the edge block, trace an unweighted four-vertex example, and compare one-layer QASPA-MaxCut with depth-one QAOA by exact state-vector simulation. The protocol uses seed 42, evaluates connected backbone-augmented random graphs with additional-edge probabilities $p_{\mathrm{edge}}\in\{0.1,0.3,0.5,0.7\}$, and adds nineteen custom unweighted topologies. The QASPA-MaxCut score is reported after the algorithm's classical selection stage: the four leading QASPA bit strings are evaluated by the Max-Cut objective, and the best cut is retained. The QAOA score is the expected approximation ratio after local optimization, reported as a best-of-$k$ curve over one to ten restarts. In these small exact simulations, fixed-angle QASPA-MaxCut produces reported group-mean selection ratios between $0.955$ and $1.000$, the topology-level readout is unchanged in the retained finite-shot checks under the rule $\lceil 0.03047\cdot 2^n+1016.2\rceil$, and depth-one QAOA improves with additional classical restarts while remaining lower than the QASPA selection score in the reported mean summaries. This comparison motivates further study of the classical search budget needed to obtain competitive Max-Cut samples at shallow circuit depth.

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

↑