arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.02557cs.CC
收藏

用傅立叶变换的$\eps$ -副本计算(几乎)酉矩阵的复杂性

The Complexity of Computing (Almost) Unitary Matrices With $\eps$-Copies of the Fourier Transform

Nir Ailon, Gal Yehuda

摘要:

计算傅里叶变换的复杂性是一个长期存在的公开问题。最近,Ailon(2013,2014,2015)在一系列论文中指出,粗略地说,傅里叶变换计算的加速意味着数值病态。论文还量化了这种权衡。证明这些结果的主要方法是通过一个称为准熵的势函数,让人想起香农熵。准熵方法为理解重要的傅立叶变换的计算复杂性打开了新的大门。然而,它受到各种明显的限制。本文的动机,这样的限制,部分克服它,而在同一时间揭示了新的兴趣,和问题的交集计算复杂性和群论。本文还解释了为什么这个研究方向,如果富有成效,有机会解决更大的问题的复杂性傅立叶变换。

英文摘要:

The complexity of computing the Fourier transform is a longstanding open problem. Very recently, Ailon (2013, 2014, 2015) showed in a collection of papers that, roughly speaking, a speedup of the Fourier transform computation implies numerical ill-condition. The papers also quantify this tradeoff. The main method for proving these results is via a potential function called quasi-entropy, reminiscent of Shannon entropy. The quasi-entropy method opens new doors to understanding the computational complexity of the important Fourier transformation. However, it suffers from various obvious limitations. This paper, motivated by one such limitation, partly overcomes it, while at the same time sheds llight on new interesting, and problems on the intersection of computational complexity and group theory. The paper also explains why this research direction, if fruitful, has a chance of solving much bigger questions about the complexity of the Fourier transform.

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

↑