Graphical Fourier Theory and the Cost of Quantum Addition

Stach Kuijpers · John van de Wetering · Aleks Kissinger · 2019 · arXiv 预印本

| 编号 QCV039 | 主题 连续变量与玻色子算术 | 链接 arXiv:1904.07551 |

摘要

摘要保留原文（英文）

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

The ZX-calculus is a convenient formalism for expressing and reasoning about quantum circuits at a low level, whereas the recently-proposed ZH-calculus yields convenient expressions of mid-level quantum gates such as Toffoli and CCZ. In this paper, we will show that the two calculi are linked by Fourier transform. In particular, we will derive new Fourier expansion rules using the ZH-calculus, and show that we can straightforwardly pass between ZH- and ZX-diagrams using them. Furthermore, we demonstrate that the graphical Fourier expansion of a ZH normal-form corresponds to the standard Fourier transform of a semi-Boolean function. As an illustration of the calculational power of this technique, we then show that several tricks for reducing the T-gate cost of Toffoli circuits, which include for instance quantum adders, can be derived using graphical Fourier theory and straightforwardly generalized to more qubits.

引用口径

该文属于数态（qubit）框架，不是连续变量或玻色子加法工作。本站引用它时，只用作”怎样把一条加法线路的成本写下来”的方法论参照系。

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