Semiclassical Fourier Transform for Quantum Computation

Robert B. Griffiths, Chi-Sheng Niu · 1995（期刊 1996）· Phys. Rev. Lett. 76, 3228–3231

| 编号 QQFT023 | 主题 量子傅里叶变换 | 链接 arXiv:quant-ph/9511007 |

摘要

摘要保留原文（英文）

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

Shor’s algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a “classical” (macroscopic) signal resulting from the measurement of one bit (embodied in a two-state quantum system) is employed to determine the type of measurement carried out on the next bit, and so forth. In this way the two-bit gates in the Fourier transform can all be replaced by a smaller number of one-bit gates controlled by classical signals. Success in simplifying the Fourier transform suggests that it may be worthwhile looking for other ways of using semi-classical methods in quantum computing.

读法提示

摘要里的关键句是”傅里叶变换中的双比特门全部可以换成受经典信号控制的一比特门”。这是半经典 QFT 的机制陈述，也是半经典 QFT一词条的主线来源。

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