Skip to content
/ quaspy Public

The Quaspy library for Python for simulating and post-processing various quantum algorithms, including Shor's algorithms and Ekerå–Håstad's variations of Shor's algorithms.

License

Notifications You must be signed in to change notification settings

ekera/quaspy

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

38 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Quaspy

The Quaspy library for Python

The Quaspy (Quantum algorithm simulations in Python) library for Python contains modules that implement:

  • Simulators for the quantum part of Shor's order-finding algorithm [Shor94], modified as in [E24], and the classical post-processing in [E24] that recovers the order in a single run with very high success probability.

    Examples | Documentation | Open In Colab

  • Simulators for factoring general integers via order-finding, and the post-processing in [E21b] and [E24] that factors any integer completely in a single order-finding run with very high success probability.

    Examples | Documentation | Open In Colab

  • Simulators for the quantum part of Shor's algorithm for computing general discrete logarithms [Shor94], modified as in [E19p], and the post-processing in [E19p] that recovers the logarithm given the order in a single run with very high probability of success.

    Examples | Documentation | Open In Colab

  • Simulators for the quantum part of Ekerå–Håstad's algorithm for computing short discrete logarithms [EH17], modified as in [E20] and [E23p], and the post-processing in [E23p] that recovers the logarithm in a single run with very high probability of success. This algorithm does not require the order to be known.

    Examples | Documentation | Open In Colab

  • Simulators for factoring RSA integers via short discrete logarithms, by using the reduction in [EH17], modified as in [E20] and [E23p], and the post-processing in [E23p] that factors random RSA integers in a single run with very high probability of success.

    Examples | Documentation | Open In Colab

All modules, classes, methods and functions in Quaspy are documented using Python docstrings.

Note that Quaspy does not implement support for tradeoffs in the aforementioned algorithms. Support for tradeoffs may potentially be added in the future. For the time being, see instead the Qunundrum repository with its suite of MPI programs. Note furthermore that portions of Quaspy are inherited from the Factoritall repository.

Quaspy is a work in progress, and may be subject to major changes without prior notice. Quaspy was developed for academic research purposes. It grew out of our research project in an organic manner as research questions were posed and answered. It is distributed "as is" without warranty of any kind, either expressed or implied. For further details, see the license.

Prerequisites

To install Python under Ubuntu 22.04 LTS, along with required dependencies, execute:

$ sudo apt install python3 python3-pip python3-venv
$ sudo apt install libgmp-dev libmpfr-dev libmpc-dev

For other Linux and Unix distributions, or operating systems, you may need to download Python and install it manually along with the required dependencies.

Installing the library

To install the Quaspy library, execute:

$ pip3 install dist/quaspy-0.9.3-py3-none-any.whl

You may also install Quaspy via Pip3 by executing:

$ pip3 install quaspy

Examples

For examples that illustrate how to use Quaspy, please see the examples directory.

See also the documentation for Quaspy for help on how to use the library.

About and acknowledgments

The Quaspy library was developed by Martin Ekerå, in part at KTH, the Royal Institute of Technology, in Stockholm, Sweden. Valuable comments and advice were provided by Johan Håstad throughout the development process.

Funding and support was provided by the Swedish NCSA that is a part of the Swedish Armed Forces.

About

The Quaspy library for Python for simulating and post-processing various quantum algorithms, including Shor's algorithms and Ekerå–Håstad's variations of Shor's algorithms.

Topics

Resources

License

Stars

Watchers

Forks

Packages

No packages published