发表机构
Peter Gr\"unberg Institute 12 , Forschungszentrum J\"ulich, J\"ulich 52428, Germany
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对超导量子处理器频率拥挤问题，提出基于哈密顿量的最大k割映射与簇拼接协议，结合DC-QAOA和模拟退火优化频率分配，抑制碰撞惩罚并实现硬件感知的处理器级规划。
AI 中文摘要
频率拥挤，即量子比特跃迁的紧密排列，通过串扰、泄漏和旁观者依赖误差限制了超导量子处理器。我们引入了一个基于哈密顿量的框架，将二体和三体碰撞机制映射到量子比特频率分配上的最大k割问题。为了使更大的晶格易于处理，我们引入了一种簇拼接协议，将较大的晶格分解为重叠子图，并将其局部频率分配协调为全局一致的配置。我们在多种量子比特架构上测试了所提出的框架，通过揭示硬件残余串扰来抑制主要的碰撞惩罚。我们对数字化反绝热QAOA（DC-QAOA）、标准QAOA和模拟退火进行了基准测试。反绝热项在陡峭的碰撞惩罚附近改善了QAOA优化，而模拟退火在测试实例上实现了最低成本。这些结果表明，我们的硬件感知优化将微观相互作用物理与处理器级频率规划联系起来。这些结果使可扩展的软硬件协同设计的基准测试系统求解器成为可能。
英文摘要
Frequency crowding, the close spacing of qubit transitions, limits superconducting quantum processors through crosstalk, leakage, and spectator dependent errors. We introduce a Hamiltonian based framework that maps two- and three-body collision mechanisms onto a Max-k-Cut problem on qubit frequency allocation. In order to make larger lattices tractable, we introduce a cluster-stitching protocol that decomposes larger lattices into overlapping subgraphs and reconciles their local frequency assignments into globally consistent configurations. We tested our proposed framework across multiple qubit architectures to suppress dominant collision penalties by revealing a hardware residual crosstalk. We benchmark digitized counterdiabatic QAOA (DC-QAOA), standard QAOA, and simulated annealing. Counterdiabatic terms improve QAOA optimization near steep collision penalties, while simulated annealing achieves the lowest costs on the tested instances. These results indicate that our hardware-aware optimization connects microscopic interaction physics to processor-level frequency planning. These results enable a systematic solver for benchmarking of scalable software hardware co design.
Comments14 pages, 5 figures
