Equivalence Checking of Quantum Circuits With the ZX-Calculus
Peham, Tom, Burgholzer, Lukas, Wille, Robert · 2022 · IEEE Journal on Emerging and Selected Topics in Circuits and Systems
| 编号 NA113 | 主题 线路综合与等价验证 | DOI 10.1109/jetcas.2022.3202204 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
2022 · IEEE Journal on Emerging and Selected Topics in Circuits and Systems As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equivalence checking of quantum circuits is an important, yet hardly automated, task in the development of the quantum software stack. Recently, new methods have been proposed that tackle this problem from widely different perspectives. One of them is based on the ZX-calculus, a graphical rewriting system for quantum computing. However, the power and capability of this equivalence checking method has barely been explored. The aim of this work is to evaluate the ZX-calculus as a tool for equivalence checking of quantum circuits. To this end, it is demonstrated how the ZX-calculus based approach for equivalence checking can be expanded in order to verify the results of compilation flows and optimizations on quantum circuits. It is also shown that the ZX-calculus based method is not completeespecially for quantum circuits with ancillary qubits. In order to properly evaluate the proposed method, we conduct a detailed case study by comparing it to two other state-of-the-art methods for equivalence checking: one based on path-sums and another based on decision diagrams. The proposed methods have been integrated into the publicly available QCEC tool (https://github.com/cda-tum/qcec) which is part of the Munich Quantum Toolkit (MQT).
全文共 15 页；文本提取件位于 .extracted/papers/NA113.txt（不随站点发布）。
本站词条在引用该文献时，会以 wikilink（sources/NA113）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。