Lowering the T-depth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic Networks
Thomas Häner, Mathias Soeken · 2020 · arXiv quant-ph
| 编号 QRC018 | 主题 可逆计算与编译 | 链接 arXiv:2006.03845 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
The multiplicative depth of a logic network over the gate basis is the largest number of gates on any path from a primary input to a primary output in the network. We describe a dynamic programming based logic synthesis algorithm to reduce the multiplicative depth in logic networks. It makes use of cut enumeration, tree balancing, and exclusive sum-of-products (ESOP) representations. Our algorithm has applications to cryptography and quantum computing, as a reduction in the multiplicative depth directly translates to a lower -depth of the corresponding quantum circuit. Our experimental results show improvements in -depth over state-of-the-art methods and over several hand-optimized quantum circuits for instances of AES, SHA, and floating-point arithmetic.
本站词条在引用该文献时，会以 wikilink（sources/QRC018）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。