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

N=21的Shor因子分解算法在IBM量子处理器上的演示

Demonstration of Shor's factoring algorithm for N=21 on IBM quantum processors

Unathi Skosana, Mark Tame

摘要:

我们报告了一个概念验证演示的量子秩序发现算法因式分解的整数21。我们的演示涉及使用量子相位估计例程的编译版本,并建立在Martín-López等人在Nature Photonics 6,773(2012)中的先前演示的基础上。我们超越了这项工作,通过使用近似Toffoli门与残余相移的配置,它保留了功能的正确性,并允许我们实现一个完整的因式分解N=21。我们在IBM量子处理器上仅使用5个量子位实现了该算法,并成功验证了控制和工作寄存器量子位之间存在纠缠,这是该算法总体加速的必要条件。我们采用的技术可能是有用的,在执行肖尔的算法较大的整数,或其他算法的系统与有限数量的噪声量子位。

英文摘要:

We report a proof-of-concept demonstration of a quantum order-finding algorithm for factoring the integer 21. Our demonstration involves the use of a compiled version of the quantum phase estimation routine, and builds upon a previous demonstration by Martín-López et al. in Nature Photonics 6, 773 (2012). We go beyond this work by using a configuration of approximate Toffoli gates with residual phase shifts, which preserves the functional correctness and allows us to achieve a complete factoring of N=21. We implemented the algorithm on IBM quantum processors using only 5 qubits and successfully verified the presence of entanglement between the control and work register qubits, which is a necessary condition for the algorithm's speedup in general. The techniques we employ may be useful in carrying out Shor's algorithm for larger integers, or other algorithms in systems with a limited number of noisy qubits.

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

↑