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

利用PennyLane库实现Shor算法的量子基元

Efficient realization of quantum primitives for Shor's algorithm using PennyLane library

A. V. Antipov, E. O. Kiktenko, A. K. Fedorov

摘要:

量子算法的有效实现是走向实用化量子计算的主要挑战之一。量子软件工程的各种库和框架已经开发出来。在这里,我们提出了一个软件包,包含各种量子门和著名的量子算法的实现使用PennyLane库。此外,我们使用了一种简化的技术,将算法分解为一组门,这是本地的捕获离子量子处理器,并实现了这种技术使用PennyLane库。分解用于分析在捕获离子量子计算机的本机操作水平上执行Shor算法所需的资源。我们原来的贡献是推导系数需要执行的分解。软件包中的模板包括Shor算法量子部分的所有必需元素,具体来说,可以为用户指定的任意数量的量子位实现的高效模幂运算和量子傅里叶变换。所有的量子位操作都被分解成在PennyLane库中实现的基本门。在定义QNode时,开发包中的模板可以用作量子位操作。

英文摘要:

Efficient realization of quantum algorithms is among main challenges on the way towards practical quantum computing. Various libraries and frameworks for quantum software engineering have been developed. Here we present a software package containing implementations of various quantum gates and well-known quantum algorithms using PennyLane library. Additoinally, we used a simplified technique for decomposition of algorithms into a set of gates which are native for trapped-ion quantum processor and realized this technique using PennyLane library. The decomposition is used to analyze resources required for an execution of Shor's algorithm on the level of native operations of trapped-ion quantum computer. Our original contribution is the derivation of coefficients needed for implementation of the decomposition. Templates within the package include all required elements from the quantum part of Shor's algorithm, specifically, efficient modular exponentiation and quantum Fourier transform that can be realized for an arbitrary number of qubits specified by a user. All the qubit operations are decomposed into elementary gates realized in PennyLane library. Templates from the developed package can be used as qubit-operations when defining a QNode.

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

↑