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

SUTURE:噪声硬件上分段保可行变分量子算法的综合征引导修复

SUTURE: Syndrome-Guided Repair for Segmented Feasibility-Preserving VQAs on Noisy Hardware

Sokea Sang, Leanghok Hour, Sanghyeon Lee, Youngsun Han

首次发表
浏览论文内容

中文总结 AI 辅助

针对噪声硬件上分段保可行VQA因纯化丢弃测量导致执行链终止的问题,提出综合征引导修复运行时SUTURE,通过检测并修复不可行测量,在72量子位实验中完成全部分段且延迟开销极低。

中文摘要 AI 辅助

约束二元优化是调度、资源分配和金融领域中一类具有代表性的NP难问题。分段保可行变分量子算法(VQA)是一种有前景的方法,它将理想电路演化限制在可行赋值上,并执行短的测量-再播种分段。现有的边界运行时通过纯化来强制可行性,这会丢弃违反约束的测量结果。随着问题规模和噪声的增加,可行测量变得稀少;如果没有样本存活,执行链就会终止。在我们于真实设备IBM Heron上进行的72量子位图着色实验中,12条纯化链中有11条在完成所有分段之前终止。我们提出SUTURE:综合征引导修复,一种修复不可行测量而非丢弃它们的运行时,并且可部署在当前量子设备上。SUTURE利用问题约束诱导出的类奇偶校验结构:违反的约束形成综合征,该综合征检测并定位损坏,并且在合适的结构条件下,通常能识别出修正。SUTURE结合了三个阶段:(1)编译时分析器,使用编译后的约束和可行初始化样本预测单翻转恢复,在四个约束族上的最大误差为0.011;(2)有界运行时解码器,替换分段执行循环内的纯化;(3)机制分析,确定何时修复优于纯化。在多达120量子位的模拟中,SUTURE在纯化崩溃的噪声水平之上继续执行链。在IBM Heron硬件上的相同72量子位实验中,SUTURE在所有12次运行中完成了所有分段,并且硬件计时实验显示,解码仅增加执行路径延迟的1.6%和总流水线延迟的不到1%。

英文摘要

Constrained binary optimization is a representative class of NP-hard problems in scheduling, resource allocation, and finance. Segmented feasibility-preserving variational quantum algorithms (VQAs) are a promising approach that restricts ideal circuit evolution to feasible assignments and executes short measure-and-reseed segments. The existing boundary runtime enforces feasibility through purification, which discards measurements that violate the constraints. As problem size and noise increase, feasible measurements become rare; if no shot survives, the execution chain terminates. In our 72-qubit graph-coloring experiment on a real-device IBM Heron, 11 of 12 purification chains terminate before completing all segments. We propose SUTURE: syndrome-guided repair, a runtime that repairs infeasible measurements instead of discarding them and is deployable on current quantum devices. SUTURE exploits a parity-check-like structure induced by the problem constraints: violated constraints form a syndrome that detects and localizes corruption and, under suitable structural conditions, often identifies a correction. SUTURE combines three stages: (1) a compile-time profiler that uses the compiled constraints and feasible initialization samples to predict single-flip recovery, with a maximum error of 0.011 across four constraint families; (2) a bounded runtime decoder that replaces purification inside the segmented execution loop; and (3) a regime analysis that identifies when repair is preferable to purification. In simulation up to 120 qubits, SUTURE continues the execution chain far beyond the noise level at which purification collapses. In the same 72-qubit experiment on IBM Heron hardware, SUTURE completes all segments in all 12 runs, and hardware timing experiment, decoding adds 1.6% to execution-path latency and less than 1% to total pipeline latency.

发表机构

  • Pukyong National University(釜庆国立大学)

机构由 AI 辅助整理,请以论文原文为准。

↑