Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization

Staudacher, Korbinian, Guggemos, Tobias, Grundner-Culemann, Sophia, Gehrke, Wolfgang · 2023 · Electronic Proceedings in Theoretical Computer Science

| 编号 NA121 | 主题 线路综合与等价验证 | DOI 10.4204/eptcs.394.3 |

摘要

摘要保留原文（英文）

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

2023 · Electronic Proceedings in Theoretical Computer Science In the near term, programming quantum computers will remain severely limited by low quantum volumes. Therefore, it is desirable to implement quantum circuits with the fewest resources possible. For the common Clifford+T circuits, most research is focused on reducing the number of T gates, since they are an order of magnitude more expensive than Clifford gates in quantum error corrected encoding schemes. However, this optimization sometimes leads to more 2-qubit gates, which, even though they are less expensive in terms of fault-tolerance, contribute significantly to the overall circuit cost. Approaches based on the ZX-calculus have recently gained some popularity in the field, but reduction of 2-qubit gates is not their focus. In this work, we present an alternative for improving 2-qubit gate count of a quantum circuit with the ZX-calculus by using heuristics in ZX-diagram simplification. Our approach maintains the good reduction of the T gate count provided by other strategies based on ZX-calculus, thus serving as an extension for other optimization algorithms. Our results show that combining the available ZX-calculus-based optimizations with our algorithms can reduce the number of 2-qubit gates by as much as 40% compared to current approaches using ZX-calculus. Additionally, we improve the results of the best currently available optimization technique of Nam et. al for some circuits by up to 15%.

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

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