An efficient quantum compiler that reduces T count

Heyfron, Luke E, Campbell, Earl T · 2018 · Quantum Science and Technology

| 编号 NA096 | 主题 线路综合与等价验证 | DOI 10.1088/2058-9565/aad604 |

摘要

摘要保留原文（英文）

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

2018 · Quantum Science and Technology Before executing a quantum algorithm, one must first decompose the algorithm into machine-level instructions compatible with the architecture of the quantum computer, a process known as quantum compiling. There are many different quantum circuit decompositions for the same algorithm but it is desirable to compile leaner circuits. A fundamentally important cost metric is the $T$ count — the number of $T$ gates in a circuit. For the single qubit case, optimal compiling is essentially a solved problem. However, multi-qubit compiling is a harder problem with optimal algorithms requiring classical runtime exponential in the number of qubits. Here, we present and compare several efficient quantum compilers for multi-qubit Clifford + $T$ circuits. We implemented our compilers in C++ and benchmarked them on random circuits, from which we determine that our TODD compiler yields the lowest $T$ counts on average. We also benchmarked TODD on a library of reversible logic circuits that appear in quantum algorithms and found that it reduced the $T$ count for 97% of the circuits with an average $T$-count saving of 20% when compared against the best of all previous circuit decompositions.

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

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