arXiv:2504.16350quant-phcs.AI2025-04被引 23

用AI生成高效量子优化电路,省去传统调参耗时。

QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits

  • 用GPT模型直接生成针对特定问题的量子线路
  • 在未见图上生成高质量电路,参数优化成功率高
  • 适合想快速部署量子算法的研究者和开发者

量子计算有望在特定条件下为经典计算机难以解决的优化问题提供加速。本文提出QAOA-GPT,一种基于生成式预训练变换器(GPT)的框架,可直接生成用于求解无约束二次二值优化问题的量子电路,并在图的MaxCut问题上验证。为提升训练电路多样性和质量,采用自适应QAOA方法构建合成数据集,逐步构建并优化问题专用电路。在精选图实例上的实验表明,QAOA-GPT能为训练中未见的新问题生成高质量电路,并成功完成参数化。结果表明,该方法显著降低传统QAOA及自适应方法所需的经典计算开销,避免频繁梯度评估与参数优化。本工作证明生成式AI是实现可扩展、紧凑量子电路生成的有前景路径。

原文摘要 · Abstract (English)

Quantum computing has the potential to improve our ability to solve certain optimization problems that are computationally difficult for classical computers, by offering new algorithmic approaches that may provide speedups under specific conditions. In this work, we introduce QAOA-GPT, a generative framework that leverages Generative Pretrained Transformers (GPT) to directly synthesize quantum circuits for solving quadratic unconstrained binary optimization problems, and demonstrate it on the MaxCut problem on graphs. To diversify the training circuits and ensure their quality, we have generated a synthetic dataset using the adaptive QAOA approach, a method that incrementally builds and optimizes problem-specific circuits. The experiments conducted on a curated set of graph instances demonstrate that QAOA-GPT, generates high quality quantum circuits for new problem instances unseen in the training as well as successfully parametrizes QAOA. Our results show that using QAOA-GPT to generate quantum circuits will significantly decrease both the computational overhead of classical QAOA and adaptive approaches that often use gradient evaluation to generate the circuit and the classical optimization of the circuit parameters. Our work shows that generative AI could be a promising avenue to generate compact quantum circuits in a scalable way.

量子算法生成模型QAOA

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。