{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/polynomial-time-algorithms-for-prime","title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","arxiv_id":"quant-ph/9508027","date":"1995-08-30","proceeding":null,"authors":["Peter W. Shor"],"abstract":"A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.","url_abs":"https://arxiv.org/abs/quant-ph/9508027v2","url_pdf":"https://arxiv.org/pdf/quant-ph/9508027v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"polynomial-time-algorithms-for-prime","repo_url":"https://github.com/Aurelien-Pelissier/IBMQ-Quantum-Programming","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"polynomial-time-algorithms-for-prime","repo_url":"https://github.com/BallMJ92/Anubis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"polynomial-time-algorithms-for-prime","repo_url":"https://github.com/bartek-bartlomiej/master-thesis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"polynomial-time-algorithms-for-prime","repo_url":"https://github.com/iic-jku/quantum_circuits","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"polynomial-time-algorithms-for-prime","repo_url":"https://github.com/isospikey/Aaa","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"polynomial-time-algorithms-for-prime","repo_url":"https://github.com/vasekp/quantum-ga","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=quant-ph%2F9508027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"quant-ph/9508027"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/isospikey/Aaa","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/vasekp/quantum-ga","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/bartek-bartlomiej/master-thesis","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/iic-jku/quantum_circuits","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/BallMJ92/Anubis","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Aurelien-Pelissier/IBMQ-Quantum-Programming","reach":{"status":"ok"}}],"summary":{"unverified":4},"by_repo_kind":{"listed":{"samples":4,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"523ce1fbc696c0f8","entry":"as_bits","repo":"bartek-bartlomiej/master-thesis","repo_kind":"listed","path":"utils/bits.py","file_url":"https://github.com/bartek-bartlomiej/master-thesis/blob/HEAD/utils/bits.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"523ce1fbc696c0f8"}},{"code_sha256_prefix":"ad70d8cb9c9fc075","entry":"as_bits_reversed","repo":"bartek-bartlomiej/master-thesis","repo_kind":"listed","path":"utils/bits.py","file_url":"https://github.com/bartek-bartlomiej/master-thesis/blob/HEAD/utils/bits.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"ad70d8cb9c9fc075"}},{"code_sha256_prefix":"3e2993e45d02c360","entry":"as_bits_reversed","repo":"bartek-bartlomiej/master-thesis","repo_kind":"listed","path":"gates/beauregard/constant_adder.py","file_url":"https://github.com/bartek-bartlomiej/master-thesis/blob/HEAD/gates/beauregard/constant_adder.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"3e2993e45d02c360"}},{"code_sha256_prefix":"ef0e631c995d56f6","entry":"get_angles","repo":"bartek-bartlomiej/master-thesis","repo_kind":"listed","path":"gates/beauregard/constant_adder.py","file_url":"https://github.com/bartek-bartlomiej/master-thesis/blob/HEAD/gates/beauregard/constant_adder.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"ef0e631c995d56f6"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}