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

一种精确的量子定序算法及其应用

An exact quantum order finding algorithm and its applications

Muhammad Imran

摘要:

当已知阶数为$r$的倍数$m$时,我们提出了一个有效的精确量子找阶算法.该算法由两个主要成分组成。第一个成分是Mosca和Zalka在[MZ 03]中提出的精确量子傅里叶变换。第二种成分是[BH 97]中的Bullard和Hoyer的振幅放大版本,结合[MZ 03]中Mosca和Zalka的精确离散对数程序中的一些想法。作为应用,我们展示了该算法如何去随机化Donis-Vela和Garcia-Escartin在[DVGE 18]中提出的素性测试量子算法,并作为一个高效的精确量子算法的子程序,用于在任意有限域中寻找本原元素。.

英文摘要:

We present an efficient exact quantum algorithm for order finding problem when a multiple $m$ of the order $r$ is known. The algorithm consists of two main ingredients. The first ingredient is the exact quantum Fourier transform proposed by Mosca and Zalka in [MZ03]. The second ingredient is an amplitude amplification version of Brassard and Hoyer in [BH97] combined with some ideas from the exact discrete logarithm procedure by Mosca and Zalka in [MZ03]. As applications, we show how the algorithm derandomizes the quantum algorithm for primality testing proposed by Donis-Vela and Garcia-Escartin in [DVGE18], and serves as a subroutine of an efficient exact quantum algorithm for finding primitive elements in arbitrary finite fields. .

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

↑