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

一种有效的确定性量子算法求解无平方分解问题

An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem

Jun Li, Xinhua Peng, Jiangfeng Du, Dieter Suter

摘要:

量子计算机在质量上比经典计算机更强大,但到目前为止,只有少数不同的算法被发现实际使用这种潜力。因此,非常希望开发其他类型的量子算法,以扩大可能的应用范围。在这里,我们提出了一个有效的和确定性的量子算法找到一个大整数的平方自由的一部分-一个问题,没有有效的经典算法存在。该算法依赖于高斯和的性质,并使用量子傅里叶变换。我们给出了一个显式的量子网络的算法。我们的算法引入了迄今为止在量子信息处理中尚未使用的新概念和方法,并且可能适用于更广泛的一类问题。

英文摘要:

Quantum computers are known to be qualitatively more powerful than classical computers, but so far only a small number of different algorithms have been discovered that actually use this potential. It would therefore be highly desirable to develop other types of quantum algorithms that widen the range of possible applications. Here we propose an efficient and deterministic quantum algorithm for finding the square-free part of a large integer - a problem for which no efficient classical algorithm exists. The algorithm relies on properties of Gauss sums and uses the quantum Fourier transform. We give an explicit quantum network for the algorithm. Our algorithm introduces new concepts and methods that have not been used in quantum information processing so far and may be applicable to a wider class of problems.

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

↑