Quantum Circuit Optimization of Arithmetic circuits using ZX Calculus

Aravind Joshi 等 · 2023 · arXiv quant-ph

| 编号 QM013 | 主题 模运算与乘法 | 链接 arXiv:2306.02264 |

摘要

摘要保留原文（英文）

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

Quantum computing is an emerging technology in which quantum mechanical properties are suitably utilized to perform certain compute-intensive operations faster than classical computers. Quantum algorithms are designed as a combination of quantum circuits that each require a large number of quantum gates, which is a challenge considering the limited number of qubit resources available in quantum computing systems. Our work proposes a technique to optimize quantum arithmetic algorithms by reducing the hardware resources and the number of qubits based on ZX calculus. We have utilised ZX calculus rewrite rules for the optimization of fault-tolerant quantum multiplier circuits where we are able to achieve a significant reduction in the number of ancilla bits and T-gates as compared to the originally required numbers to achieve fault-tolerance. Our work is the first step in the series of arithmetic circuit optimization using graphical rewrite tools and it paves the way for advancing the optimization of various complex quantum circuits and establishing the potential for new applications of the same.

主题边界

本文是用 ZX 微积分的重写规则优化算术线路，不是”模算术的反向传播”。引用时请勿按后者解读。

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