Open Access
Peer-Reviewed
Research Articles
Fault-Tolerant Quantum Circuit Synthesis via Graph State ZX-Calculus Simplification
Optimal T-Count Reduction in Surface Code Architectures
Abstract
Minimizing non-Clifford T-gate count is the dominating computational bottleneck in fault-tolerant quantum computing under magic state distillation. We propose a ZX-calculus graph rewrite algorithm that preserves stabilizer parity while reducing total magic state requirements by up to 28% across standard Shor and Grover benchmark circuits.
Keywords
Quantum Computing
ZX-Calculus
Fault Tolerance
Magic State Distillation
Circuit Optimization
Declarations & Ethics
Funding:
UK National Quantum Technologies Programme.
Conflicts of Interest:
The authors declare no competing financial or institutional interests.
Peer Review:
Double-blind peer reviewed by international subject specialists.
License:
Creative Commons Attribution 4.0 International (CC BY 4.0).
How to Cite This Article
APA / MLA / BibTeX
Chen, et al. (2026). Fault-Tolerant Quantum Circuit Synthesis via Graph State ZX-Calculus Simplification. Journal of Advanced Computing and Applied Sciences, 4(1). https://doi.org/10.1234/jcas.2026.040101
Chen, et al. "Fault-Tolerant Quantum Circuit Synthesis via Graph State ZX-Calculus Simplification." Journal of Advanced Computing and Applied Sciences, vol. 4, no. 1, 2026. https://doi.org/10.1234/jcas.2026.040101
Chen, et al. "Fault-Tolerant Quantum Circuit Synthesis via Graph State ZX-Calculus Simplification." Journal of Advanced Computing and Applied Sciences 4, no. 1 (2026). https://doi.org/10.1234/jcas.2026.040101