Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus

Riu, Jordi, Nogué, Jan, Vilaplana, Gerard, Garcia-Saez, Artur, et al. · 2025 · Quantum

| 编号 NA133 | 主题 强化学习与智能体 | DOI 10.22331/q-2025-05-28-1758 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

2025 · Quantum We propose a novel Reinforcement Learning (RL) method for optimizing quantum circuits using graph-theoretic simplification rules of ZX-diagrams. The agent, trained using the Proximal Policy Optimization (PPO) algorithm, employs Graph Neural Networks to approximate the policy and value functions. We demonstrate the capacity of our approach by comparing it against the best performing ZX-Calculus-based algorithm for the problem in hand. After training on small Clifford+T circuits of 5-qubits and few tenths of gates, the agent consistently improves the state-of-the-art for this type of circuits, for at least up to 80-qubit and 2100 gates, whilst remaining competitive in terms of computational performance. Additionally, we illustrate the versatility of the agent by incorporating additional optimization routines on the workflow during training, improving the two-qubit gate count state-of-the-art on multiple structured quantum circuits for relevant applications of much larger dimension and different gate distributions than the circuits the agent trains on. This conveys the potential of tailoring the reward function to the specific characteristics of each application and hardware backend. Our approach is a valuable tool for the implementation of quantum algorithms in the near-term intermediate-scale range (NISQ).

全文共 22 页；文本提取件位于 .extracted/papers/NA133.txt（不随站点发布）。

本站词条在引用该文献时，会以 wikilink（sources/NA133）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。