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

关于随机线性方程组的求解

On solving systems of random linear disequations

Gabor Ivanyos

摘要:

隐子群问题的一个重要子情形等价于交换群上的移位问题。后一个问题的有效解决方案将作为可解群上量子隐子群算法的构建块。转移问题的一个有前途的方法的主要思想是减少到解决有限阿贝尔群中的某些随机disequations系统。随机双方程实际上是线性函数在核中不包含特定群元素的那些函数上几乎均匀分布的推广。本文给出了一个算法,它可求阿贝尔p群A中N个随机线性方程组在N中的时间多项式中的解,其中N=(log |A|)^{O(q)},q是A的指数.

英文摘要:

An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable groups. The main idea of a promising approach to the shift problem is reduction to solving systems of certain random disequations in finite abelian groups. The random disequations are actually generalizations of linear functions distributed nearly uniformly over those not containing a specific group element in the kernel. In this paper we give an algorithm which finds the solutions of a system of N random linear disequations in an abelian p-group A in time polynomial in N, where N=(log|A|)^{O(q)}, and q is the exponent of A.

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

↑