{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:2WW2AJDYI4QD564VL6S25HVE7B","short_pith_number":"pith:2WW2AJDY","schema_version":"1.0","canonical_sha256":"d5ada0247847203efb955fa5ae9ea4f854295d9fecba0e48f653b8910a6bd518","source":{"kind":"arxiv","id":"quant-ph/0205095","version":3},"attestation_state":"computed","paper":{"title":"Circuit for Shor's algorithm using 2n+3 qubits","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Stephane Beauregard","submitted_at":"2002-05-15T20:53:10Z","abstract_excerpt":"We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n+3 qubits and O(n^3 lg(n)) elementary quantum gates in a depth of O(n^3) to implement the factorization algorithm. The circuit is computable in polynomial time on a classical computer and is completely general as it does not rely on any property of the number to be factored.\n Keywords: Factorization, quantum circuits, modular arithmetics"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/0205095","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-05-15T20:53:10Z","cross_cats_sorted":[],"title_canon_sha256":"8ed0a37d7d3d08b1deb2b0bdbf9fd83a7644f0444a341f90a53440120e09870e","abstract_canon_sha256":"be9af0f5deeccb815ff09c2278997f333ede76f223f1cb0c25e0e4c1da5471af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:04.549330Z","signature_b64":"1HpNXpA5fBGGmB/qfmuGnAuKJjYWpH/VZmv4iv5Ks3WTHFIssJq6RLY5+ki03qKSeTUokiKeR3q39ZdDiH5bBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5ada0247847203efb955fa5ae9ea4f854295d9fecba0e48f653b8910a6bd518","last_reissued_at":"2026-05-18T01:05:04.548698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:04.548698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circuit for Shor's algorithm using 2n+3 qubits","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Stephane Beauregard","submitted_at":"2002-05-15T20:53:10Z","abstract_excerpt":"We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n+3 qubits and O(n^3 lg(n)) elementary quantum gates in a depth of O(n^3) to implement the factorization algorithm. The circuit is computable in polynomial time on a classical computer and is completely general as it does not rely on any property of the number to be factored.\n Keywords: Factorization, quantum circuits, modular arithmetics"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0205095","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0205095","created_at":"2026-05-18T01:05:04.548804+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0205095v3","created_at":"2026-05-18T01:05:04.548804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0205095","created_at":"2026-05-18T01:05:04.548804+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WW2AJDYI4QD","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WW2AJDYI4QD564V","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WW2AJDY","created_at":"2026-05-18T12:25:50.845339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2408.03085","citing_title":"Universal Matrix Multiplication on Quantum Computer","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2312.10054","citing_title":"Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2WW2AJDYI4QD564VL6S25HVE7B","json":"https://pith.science/pith/2WW2AJDYI4QD564VL6S25HVE7B.json","graph_json":"https://pith.science/api/pith-number/2WW2AJDYI4QD564VL6S25HVE7B/graph.json","events_json":"https://pith.science/api/pith-number/2WW2AJDYI4QD564VL6S25HVE7B/events.json","paper":"https://pith.science/paper/2WW2AJDY"},"agent_actions":{"view_html":"https://pith.science/pith/2WW2AJDYI4QD564VL6S25HVE7B","download_json":"https://pith.science/pith/2WW2AJDYI4QD564VL6S25HVE7B.json","view_paper":"https://pith.science/paper/2WW2AJDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0205095&json=true","fetch_graph":"https://pith.science/api/pith-number/2WW2AJDYI4QD564VL6S25HVE7B/graph.json","fetch_events":"https://pith.science/api/pith-number/2WW2AJDYI4QD564VL6S25HVE7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WW2AJDYI4QD564VL6S25HVE7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WW2AJDYI4QD564VL6S25HVE7B/action/storage_attestation","attest_author":"https://pith.science/pith/2WW2AJDYI4QD564VL6S25HVE7B/action/author_attestation","sign_citation":"https://pith.science/pith/2WW2AJDYI4QD564VL6S25HVE7B/action/citation_signature","submit_replication":"https://pith.science/pith/2WW2AJDYI4QD564VL6S25HVE7B/action/replication_record"}},"created_at":"2026-05-18T01:05:04.548804+00:00","updated_at":"2026-05-18T01:05:04.548804+00:00"}