Synthesis of quantum-logic circuits

Shende, V.V., Bullock, S.S., Markov, I.L. · 2006 · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

| 编号 NA091 | 主题 线路综合与等价验证 | DOI 10.1109/tcad.2005.855930 |

摘要

摘要保留原文（英文）

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

2006 · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state-space of an n-qubit register is not finite and contains exponential superpositions of classical bit strings. Our proposed circuits are asymptotically optimal for respective tasks and improve published results by at least a factor of two. The circuits for generic quantum computation constructed by our algorithms are the most efficient known today in terms of the number of expensive gates (quantum controlled-NOTs). They are based on an analogue of the Shannon decomposition of Boolean functions and a new circuit block, quantum multiplexor, that generalizes several known constructions. A theoretical lower bound implies that our circuits cannot be improved by more than a factor of two. We additionally show how to accommodate the severe architectural limitation of using only nearest-neighbor gates that is representative of current implementation technologies. This increases the number of gates by almost an order of magnitude, but preserves the asymptotic optimality of gate counts.

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

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