The quantum Fourier transform on a linear nearest neighbor architecture

Y. Takahashi, N. Kunihiro, K. Ohta · 2007 · Quantum Information and Computation 7(4–5):383–391

| 编号 QQFT012 | 主题 量子傅里叶变换 | 链接 doi:10.26421/qic7.4-7 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。 We show how to construct an efficient quantum circuit for computing a good approximation of the quantum Fourier transform on a linear nearest neighbor architecture. The constructed circuit uses no ancillary qubits and its depth and size are $O(n)$ and $O(n\log n)$, respectively, where $n$ is the length of the input. The circuit is useful for decreasing the size of Fowler et al.’s quantum circuit for Shor’s factoring algorithm on a linear nearest neighbor architecture.

可确认的信息

标题陈述的事实是：讨论量子傅里叶变换在线性最近邻架构上的实现。具体门数与路由代价请以原文为准，本站不代为推断。

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