量子逆快速傅里叶变换
Quantum Inverse Fast Fourier Transform
AI总结:
本文提出适用于量子数据的量子逆快速傅里叶变换(QIFFT)算法,给出完整公式与蝶形图,其在计算复杂度、量子并行性及通用性上优于常规量子傅里叶变换求逆方法。
摘要:
本文提出了一种适用于量子数据的量子逆快速傅里叶变换(QIFFT)算法。与经典离散信号类似,量子信号可以用狄拉克符号表示,QIFFT的应用是从频域到时域的张量变换。若张量仅为复数项,则得到经典场景。我们从经典模型出发给出了QIFFT算法的完整公式,并包含了蝶形图。QIFFT在计算复杂度、量子并行性和通用性提升方面均优于常规的量子傅里叶变换(QFT)求逆方法。
英文摘要:
In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a tensor transformation from frequency domain to time domain. If the tensors are merely complex entries, then we get the classical scenario. We have included the complete formulation of QIFFT algorithm from the classical model and have included butterfly diagram. QIFFT outperforms regular inversion of Quantum Fourier Transform (QFT) in terms of computational complexity, quantum parallelism and improved versatility.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。