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

Quantum Fast Fourier Transform Viewed as a Special Case of Recursive Application of Cosine-Sine Decomposition

Robert R. Tucci

英文摘要:

A quantum compiler is a software program for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). Coppersmith showed that the $\nb$-bit Discrete Fourier Transform matrix $U_{FT}$ can be decomposed in a very efficient way, as a sequence of order($\nb^2$) elementary operations. Can a quantum compiler that doesn't know a priori about Coppersmith's decomposition nevertheless decompose $U_{FT}$ as a sequence of order($\nb^2$) elementary operations? In other words, can it rediscover Coppersmith's decomposition by following a much more general algorithm? Yes it can, if that more general algorithm is the recursive application of the Cosine-Sine Decomposition (CSD).

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

↑