Source code for the book "Quantum Computing for Programmers", Cambridge University Press
-
Updated
Sep 10, 2024 - C++
Source code for the book "Quantum Computing for Programmers", Cambridge University Press
Solutions for IBM Quantum Challenge 2021 (iqc2021)
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.
The Sage implementation of a simulator for Regev's factoring algorithm, and of Ekerå–Gärtner's extensions to discrete logarithm finding, order finding and factoring via order finding.
The source code of MPI programs for simulating quantum algorithms and for post-processing the output from these algorithms. The focus is on Shor's groundbreaking algorithms, and on various derivatives of Shor's algorithms.
Sage scripts for completely factoring any integer efficiently with very high probability after a single run of an order-finding algorithm.
Implementations of some quantum algorithms with Qiskit.
The below code is for the following article:
An implementation of Shor's algorithm for IBM Qiskit.
The Quppy library for Python3 for simulating and post-processing Shor's order-finding and factoring algorithms.
Some basic quantum computing circuits that can be run on IBM quantum computers. Written in quantum assembly (OpenQASM2.0)
⚛️ 👨🏫 📚 A two-week intensive Summer School on Quantum Computing from IBM Quantum, using mostly the features of the IBM's Qiskit library. In this Summer School, were lectured topics on basics of Quantum Information, Quantum Entanglement, Quantum Algorithms, Quantum Error Mitigation, among many others.
An implementation of Shor's quantum factoring algorithm on the number 15.
Quantum Computing course, Computer Science M.Sc., Ben Gurion University of the Negev, 2020
Entry for the Qiskit quantum computing hackathon at the 2022 World of Quantum fair in Munich
Using Shor's Algorithm, a quantum computer will be able to crack any RSA encryption since the main problem is to find two large prime numbers that multiplied have the value "x". Quantum Superposition gives us a fast answer to this problem.
Algebra and Cryptography Final Project - Shor's Algorithm and Introduction to Quantum Computing
Quantum experiments exploring the improvement of Shor's algorithm using various languages and libraries such as Q#, Qiskit, QASM.
A language which has Quantum behaviour to implement Shor's Algorithm
The code demonstrates how a third party can break the RSA by obtaining the secret key by using public key and interrupt the communication and modifies the messages in transit.
Add a description, image, and links to the shors-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the shors-algorithm topic, visit your repo's landing page and select "manage topics."