用生成流网络实现快速多样化的量子线路合成
QFlowNet: Fast, Diverse, and Efficient Unitary Synthesis with Generative Flow Networks
- 结合生成流网络与Transformer,从稀疏奖励中高效学习
- 3量子比特基准上成功率99.7%,生成多种紧凑线路
- 适合需要多样化量子编译结果的研究者
量子编译中的酉矩阵分解(单位阵合成)是核心挑战。现有强化学习方法常因奖励信号稀疏而需复杂奖励设计或长时间训练,且通常收敛到单一解,缺乏多样性。本文提出QFlowNet框架,通过生成流网络(GFlowNet)与Transformer结合,解决两大问题:首先,GFlowNet天然支持按奖励比例采样多样化解,突破单策略限制,推理速度优于扩散模型等生成模型;其次,Transformer作为强大编码器,捕捉酉矩阵的非局部结构,将高维状态压缩为稠密潜在表示供策略网络使用。实验显示,该代理在3量子比特基准(线路长度1-12)上整体成功率达99.7%,并发现多种紧凑线路,确立了QFlowNet在单位阵合成中高效且多样的新范式。
原文摘要 · Abstract (English)
Unitary Synthesis, the decomposition of a unitary matrix into a sequence of quantum gates, is a fundamental challenge in quantum compilation. Prevailing reinforcement learning (RL) approaches are often hampered by sparse reward signals, which necessitate complex reward shaping or long training times, and typically converge to a single policy, lacking solution diversity. In this work, we propose QFlowNet, a novel framework that learns efficiently from sparse signals by pairing a Generative Flow Network (GFlowNet) with Transformers. Our approach addresses two key challenges. First, the GFlowNet framework is fundamentally designed to learn a diverse policy that samples solutions proportional to their reward, overcoming the single-solution limitation of RL while offering faster inference than other generative models like diffusion. Second, the Transformers act as a powerful encoder, capturing the non-local structure of unitary matrices and compressing a high-dimensional state into a dense latent representation for the policy network. Our agent achieves an overall success rate of 99.7% on a 3-qubit benchmark(lengths 1-12) and discovers a diverse set of compact circuits, establishing QFlowNet as an efficient and diverse paradigm for unitary synthesis.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。