Source code for the book "Quantum Computing for Programmers", Cambridge University Press

This project implements Shor's Algorithm in IBM's Qiskit SDK in simulation, to link with the simulators from IBM Q Experience. It was done in the Quantum Information Project Course (AP3421) at TU Delft in the 2nd Quarter of 2018/2019. Authors: Rui Maia and Tiago Leão

😺 Classic implementation of shor's and grover's algorithm to help with understanding.

⚛️ 👨‍🏫 📚 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.

The Sage implementation of a simulator for Regev's factoring algorithm, and of Regev's post-processing 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.

Sage scripts for completely factoring any integer efficiently with very high probability after a single run of an order-finding algorithm.

Algebra and Cryptography Final Project - Shor's Algorithm and Introduction to Quantum Computing

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.

My graduate research paper for Quantum Computation, discussing quantum programming languages and implementing Shor's algorithm in Cirq.

Quantum Phase Estimation is a key component of Shor's Factoring Algorithm.

An implementation of Shor's algorithm for IBM Qiskit.

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.

Solutions for IBM Quantum Challenge 2021 (iqc2021)

An implementation of Shor's quantum factoring algorithm on the number 15.

An implementation of Shor's Quantum Algorithm with sequential QFT. (2*n + 3 qubits)

JavaScript implementation of Shor's algorithm used to find factors of numbers. Because it's meant for quantum computers bruteforcing is more efficient then this.

A language which has Quantum behaviour to implement Shor's Algorithm

Complexity analysis of Qiskit’s implementation of Shor’s algorithm

The Quppy library for Python3 for simulating and post-processing Shor's order-finding and factoring algorithms.