arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/9803072quant-ph
收藏

量子算法:纠缠增强的信息处理

Quantum Algorithms: Entanglement Enhanced Information Processing

Artur Ekert, Richard Jozsa

摘要:

我们讨论的基本作用纠缠的基本非经典特征提供了计算速度在已知的量子算法。我们回顾了阿贝尔群上傅里叶变换的构造和快速傅里叶变换算法的基本原理。我们描述了在量子背景下整数模2^n群的FFT算法的实现,展示了群论形式主义如何导致标准量子网络,并确定了引起指数加速的纠缠特性(与经典FFT相比)。最后,我们概述了使用傅立叶变换提取周期性,这是它的效用在已知的量子算法的基础。

英文摘要:

We discuss the fundamental role of entanglement as the essential nonclassical feature providing the computational speed-up in the known quantum algorithms. We review the construction of the Fourier transform on an Abelian group and the principles underlying the fast Fourier transform algorithm. We describe the implementation of the FFT algorithm for the group of integers modulo 2^n in the quantum context, showing how the group-theoretic formalism leads to the standard quantum network and identifying the property of entanglement that gives rise to the exponential speedup (compared to the classical FFT). Finally we outline the use of the Fourier transform in extracting periodicities, which underlies its utility in the known quantum algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑