Efficient realization of quantum primitives for Shor's algorithm using PennyLane library
Anatoly Antipov, Evgeniy Kiktenko, Aleksey Fedorov
Quantum computing
Shor's algorithm
modular exponentiation
quantum Fourier transform
quantum arithmetics
Abstract
The following protocol describes how to use a software package
containing implementations of various quantum gates and well-known quantum
algorithms using PennyLane library. 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.
Steps
First of all, you should install the PennyLane library using the regular python environment and set up the Jupyter Notebook's environment
Content of the Github repository should be uploaded on your PC via the following link:
http://github.com/Anatoly-Antipov/QuantumOperations
Files with the extension ".py" represent original python code that realizes the software package with new useful functions built upon the PennyLane library. Functions from this software package are ready-to-use commands similar to PennyLane's functions and commands.
Files with the extension ".ipynb" are Jupyter Notebooks that contain examples of the use of commands from the software package.
See the README.md file in the repository to view an up-to-date description of included files
Use the file "Example.ipynb" or the file "ExampleOrderFinding.ipynb" to get the simplest example of the use of a new function. The file "Test.ipynb" contains the full list of newly introduced functions alongside the demonstration of its use in a Jupyter Notebook's environment.
