Synthesis of Quantum Logic Circuits

V. V. Shende, S. S. Bullock, I. L. Markov · 2004 · arXiv

| 编号 QC022 | 主题 量子算法工具箱 | 链接 arXiv:quant-ph/0406176 |

摘要

摘要保留原文（英文）

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

The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits [10] to the attention of the Electronic Design Automation community [18, 28, 7, 27, 17]. 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 earlier published results by at least a factor of two.

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