Skip to content

Latest commit

 

History

History
14 lines (10 loc) · 996 Bytes

README.md

File metadata and controls

14 lines (10 loc) · 996 Bytes

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

The purpose of this project is to perform complexity analysis of IBM Qiskit’s implementation of Shor’s algorithm to help understand the number of Qubits required in the quantum circuit to be able to factorize a given number N. This is the final project for the CS 510 - Intro to Quantum Computing at PSU.

Following is the result:
Analysis

Final Project Deliverables

Resources