论文标题
使用Pennylane库有效地实现了Shor算法的量子原语
Efficient realization of quantum primitives for Shor's algorithm using PennyLane library
论文作者
论文摘要
量子算法的有效实现是实用量子计算途径的主要挑战。已经开发了各种用于量子软件工程的库和框架。在这里，我们提供了一个软件包，其中包含使用Pennylane库的各种量子门和众所周知的量子算法的实现。添加意义上，我们使用了一种简化的技术将算法分解为一组门，这些门是被困的离子量子处理器本地的，并使用Pennylane库实现了这一技术。该分解用于分析执行Shor算法在被困ION量子计算机的本机操作水平上所需的资源。我们最初的贡献是实施分解所需的系数的推导。软件包中的模板包括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.
