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

CO-MAP:一种用于量子比特分配问题的强化学习方法

CO-MAP: A Reinforcement Learning Approach to the Qubit Allocation Problem

Fujitsu Research of America(富士通美国研究院)

Ankit Kulshrestha, Xiaoyuan Liu

AI总结:

本文提出CO-MAP方法,通过强化学习策略优化量子比特映射,显著减少SWAP门开销,实测数据表明在MQTBench和Queko电路中SWAP开销降低65-85%。

摘要:

量子编译器是量子计算流程中的关键组件,它允许抽象量子电路在物理量子计算机上运行。量子编译中的一个重要子问题是如何生成逻辑到物理量子比特的映射。通常在量子编译器中,这一步是通过随机或启发式方法实现的,旨在最小化量子电路中的额外(SWAP)门开销。本文提出了一种解决量子比特映射问题的替代方法。具体而言,我们将量子比特映射问题 formulations 为一个组合优化(CO)目标。然后,我们提出了一种通过训练强化学习(RL)策略来求解CO问题的方法。我们还提出了一种基于局部搜索的后处理算法,以进一步减少开销。我们的结果表明,与传统技术相比,在减少SWAP门数量方面有显著改进。在不同的真实世界数据集如MQTBench和Queko电路中,我们的训练策略在与现有量子编译器相比时,实现了65-85%的SWAP开销减少。

英文摘要:

A quantum compiler is a critical piece in the quantum computing pipeline since it allows an abstract quantum circuit to be run on a physical quantum computer. One extremely important subproblem in quantum compilation is the generation of a logical to physical qubit mapping. Typically in quantum compilers this step is either implemented as a random or a heuristic based assignment that aims to minimize additional (SWAP) gate overhead in the quantum circuit. In this paper, we present an alternative approach to solving the qubit mapping problem. Specifically, we formulate the qubit mapping problem with a combinatorial optimization (CO) objective. We then present a method to find a solution to the CO problem by training a reinforcement learning (RL) policy. We also propose a local search based post-processing algorithm to further reduce the overhead. Our results show a dramatic improvement over conventional techniques in reducing the number of SWAPs. On different real world datasets like MQTBench and Queko circuits, our trained policy achieves a \textbf{65-85\%} reduction in SWAP overhead when compared to existing quantum compilers.

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

↑