This directory contains Jupyter notebooks that exemplify the use of the Quaspy library.
For examples that illustrate how to use the Quaspy library to simulate quantum order finding, and to solve the frequency returned by the quantum part of the order-finding algorithm for the order, please see the orderfinding.ipynb notebook.
The examples in this notebook are based on the modified version of Shor's algorithm for the order-finding problem described in [E24], and on the post-processing described in [E24].
For examples on how to use the Quaspy library to simulate factoring general integers via quantum order finding, and to solve the frequency returned by the quantum part of the order-finding algorithm for the factors, please see the factoring.ipynb notebook.
The examples in this notebook are based on the modified version of Shor's algorithm for the order-finding problem described in [E24], and on the post-processing described in [E24] and [E21b].
For examples on how to use the Quaspy library to heuristically simulate computing discrete logarithms quantumly, and to solve the frequency pair returned by the quantum part of the algorithm for the logarithm, please see the logarithmfinding.ipynb notebook.
The examples in this notebook are based on the modified version of Shor's algorithm for the discrete logarithm problem described in [E19p].
For examples on how to use the Quaspy library to simulate computing short discrete logarithms quantumly, and to solve the frequency pair returned by the quantum part of the algorithm for the logarithm, please see the logarithmfinding-short.ipynb notebook.
The examples in this notebook are based on Ekerå–Håstad's variation of Shor's algorithm as described in [EH17] with the post-processing described in [E23p] (that is an improved version of the post-processing in [E20]).
For examples on how to use the Quaspy library to simulate factoring RSA integers by computing a short discrete logarithm quantumly, and to solve the frequency returned by the quantum part of the logarithm-finding algorithm for the factors, please see the factoring-rsa.ipynb notebook.
The examples in this notebook are based on Ekerå–Håstad's variation of Shor's algorithm as described in [EH17] with the post-processing described in [E23p] (that is an improved version of the post-processing in [E20]).