arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0712.3829quant-phcs.DS
收藏

群可解性的量子性质检验

Quantum Property Testing of Group Solvability

Yoshifumi Inui, Francois Le Gall

摘要:

有效地测试有限集合是否是一个群,在属性测试领域是一个著名的公开问题。最近,Friedl,Ivanyos和Santha在解决这个问题的方向上迈出了重要的一步,他们证明了可以有效地测试输入是否是阿贝尔群或远离任何阿贝尔群。在本文中,我们更进一步,并构造了一个有效的量子算法,测试输入是否是一个可解群,或远离任何可解群。更准确地说,我们的算法使用的查询的数量是在集的大小的多对数。

英文摘要:

Testing efficiently whether a finite set with a binary operation over it, given as an oracle, is a group is a well-known open problem in the field of property testing. Recently, Friedl, Ivanyos and Santha have made a significant step in the direction of solving this problem by showing that it it possible to test efficiently whether the input is an Abelian group or is far, with respect to some distance, from any Abelian group. In this paper, we make a step further and construct an efficient quantum algorithm that tests whether the input is a solvable group, or is far from any solvable group. More precisely, the number of queries used by our algorithm is polylogarithmic in the size of the set.

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

↑