ZX-Diagram T-Count Reduction Based on Proximal Policy Optimization
Intelligent Computing · 01.01.2026 · 5
DOI: 10.34133/icomputing.0418 ↗Kurz gefasst
Fachartikel in der Zeitschrift Intelligent Computing, online erschienen am 14.07.2026. Verfasst von Keyu Xiong und 3 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Beijing Municipality.
Abstract (Originalsprache)
In fault-tolerant quantum computing systems, the T gates consume more fault-tolerant resources. In this paper, we propose an automated optimization method based on the Proximal Policy Optimization (PPO) algorithm. We first translate quantum circuits into ZX-diagrams using ZX-calculus, transforming the circuit optimization problem into a graph rewriting task. Subsequently, the PPO agent, powered by graph neural networks (GNNs) to encode the complex graph structures of the ZX-diagrams, learns to predict efficient transformation paths by focusing on local node and edge features. The PPO algorithm ensures stable policy updates through its clipped objective function, which prevents excessively large and potentially detrimental changes during optimization. Experimental results confirm the method’s effectiveness, showing an average reduction in T-count of 3.12% compared to the baseline approach.
Förderung
- National Natural Science Foundation of China
- Natural Science Foundation of Beijing Municipality
Zitieren
APA
Xiong, K., Shang, T., Zhang, C., & Liu, Y. (2026). ZX-Diagram T-Count Reduction Based on Proximal Policy Optimization. Intelligent Computing, 5. https://doi.org/10.34133/icomputing.0418
Vancouver
Xiong K, Shang T, Zhang C, Liu Y. ZX-Diagram T-Count Reduction Based on Proximal Policy Optimization. Intelligent Computing. 2026;5. doi:10.34133/icomputing.0418
BibTeX
@article{Xiong2026,
author = {Xiong, Keyu and Shang, Tao and Zhang, Chenyi and Liu, Yuchen},
title = {ZX-Diagram T-Count Reduction Based on Proximal Policy Optimization},
journal = {Intelligent Computing},
year = {2026},
volume = {5},
doi = {10.34133/icomputing.0418}
}
EUVIMED