Description and implementation of the Shor's algorithm (to solve the prime factorization problem) using the IBM SDK Qiskit and the framework ProjectQ.
-
Updated
Sep 11, 2024 - Jupyter Notebook
Description and implementation of the Shor's algorithm (to solve the prime factorization problem) using the IBM SDK Qiskit and the framework ProjectQ.
Quantum cracking encryption. Shor Algorithm.
Shor's factoring algorithm in Rust
A simple hand detection code for lazy people like me so you can use hand gesture to open apps from your taskbar!
Shor's Algorithm implemented factorizing 63 on Qiskit using SWAP gates, Python 3.X
A toy RSA breaker based on Shor's algorithm ft. IBM QISKIT
This is a python implemented factoring algorithm, that can be executed in polynomial time on a quantum computer such that it has sufficient Qbits and accuracy.
The title of the thesis is Shor's algorithm in Quantum Cryptography. This repository contains the data and Jupyter notebooks containing the codes used in the Quantum simulations of different variants of Shor's quantum factoring algorithm. While IBM Qiskit has already implemented the algorithm using the standard Quantum Fourier Transform (QFT), t…
Shor's algorithm is a Quantum Algorithm for Integer Factorisation, Finding Prime Factors of Large Composite Numbers. It Offers an Exponential Speedup Over Classical Methods, Posing a Profound Threat to Modern Public-Key Cryptography like RSA Encryption, Which Relies on Factoring Difficulty
Simulate quantum circuits in C++20, from Bell states to Shor's algorithm — up to 25 qubits, hardware-accelerated, with noise simulation, Bloch sphere and interactive REPL.
A repository about Shor's algorithm
Learn Quantum Computing visually — interactive lessons, simulators, paradoxes, BB84, QFT, error correction. HTML/CSS/JS only, no backend.
Writing factoring algorithms for classical and quantum computers and benchmarking them
Estimate the eigenphase φ=1/8 of the T gate: U|ψ⟩=e^{i2πφ}|ψ⟩ using 3 counting qubits.
Implementation of Shor's quantum algorithm for integer factorization
4-qubit Quantum Fourier Transform (QFT): the quantum analogue of the discrete Fourier transform.
Shor period-finding demo factoring small composites
A faster implementation of Shor's algorithm in Qiskit.
Quantitative resource and cost modelling for fault-tolerant quantum computing, including a Shor / RSA-2048 physical-qubit estimate.
Add a description, image, and links to the shor topic page so that developers can more easily learn about it.
To associate your repository with the shor topic, visit your repo's landing page and select "manage topics."