{"id":21864610,"url":"https://github.com/aru71727/quantum-factoring21","last_synced_at":"2026-05-16T12:32:35.791Z","repository":{"id":142595569,"uuid":"261431548","full_name":"aru71727/Quantum-Factoring21","owner":"aru71727","description":"Shor’s algorithm is a quantum algorithm for factoring a number N in O((log N)3) time and O(log N) space,","archived":false,"fork":false,"pushed_at":"2020-05-07T06:51:46.000Z","size":12,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-21T20:47:45.436Z","etag":null,"topics":["factor","factor-analysis","factorization","factorization-algorithm","python3","quantum","quantum-algorithms","quantum-computing"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/aru71727.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-05-05T10:45:42.000Z","updated_at":"2020-07-10T21:12:53.000Z","dependencies_parsed_at":"2023-03-14T08:45:15.887Z","dependency_job_id":null,"html_url":"https://github.com/aru71727/Quantum-Factoring21","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/aru71727/Quantum-Factoring21","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aru71727%2FQuantum-Factoring21","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aru71727%2FQuantum-Factoring21/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aru71727%2FQuantum-Factoring21/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aru71727%2FQuantum-Factoring21/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aru71727","download_url":"https://codeload.github.com/aru71727/Quantum-Factoring21/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aru71727%2FQuantum-Factoring21/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33102795,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-16T04:41:52.686Z","status":"ssl_error","status_checked_at":"2026-05-16T04:41:52.009Z","response_time":115,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["factor","factor-analysis","factorization","factorization-algorithm","python3","quantum","quantum-algorithms","quantum-computing"],"created_at":"2024-11-28T04:10:30.476Z","updated_at":"2026-05-16T12:32:35.776Z","avatar_url":"https://github.com/aru71727.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Quantum-Factoring21\nShor’s algorithm is a quantum algorithm for factoring a number N in O((log N)3) time and O(log N) space, named after Peter Shor.\n\nThe problem we are trying to solve is that, given an integer N, we try to find another integer p between 1 and N that divides N.\nShor’s algorithm consists of two parts:\n1. A reduction of the factoring problem to the problem of order-finding, which can be done on a classical computer.\n2. A quantum algorithm to solve the order-finding problem.\n\n\nNote: For this you will need an API token which you can get by registering here: https://quantum-computing.ibm.com/ \n\n//run on IBM’s quantum computers with Python and Qiskit. \n\n\nFor detailed explanantion\n\nvisit blog : https://medium.com/@kush.aradhana007/shors-factoring-algorithm-cd70802e0544\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faru71727%2Fquantum-factoring21","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faru71727%2Fquantum-factoring21","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faru71727%2Fquantum-factoring21/lists"}