{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4HGOKJ5AJDEV3UW3C72XITSXTO","short_pith_number":"pith:4HGOKJ5A","schema_version":"1.0","canonical_sha256":"e1cce527a048c95dd2db17f5744e579b9d292f3aaf592e13ca79e296f4715119","source":{"kind":"arxiv","id":"1611.07995","version":2},"attestation_state":"computed","paper":{"title":"Factoring using 2n+2 qubits with Toffoli based modular multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Krysta M. Svore, Martin Roetteler, Thomas H\\\"aner","submitted_at":"2016-11-23T21:11:28Z","abstract_excerpt":"We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast to previous space-optimized implementations, ours features a purely Toffoli based modular multiplication circuit. The circuit depth and the overall gate count are in O(n^3) and O(n^3 log(n)), respectively. We thus achieve the same space and time costs as Takahashi et al., while using a purely classical modular multiplication circuit. As a consequence, our approach evades most of the cost overheads originating from rotation synthesis and enables testing and localization of faul"},"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":"1611.07995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-11-23T21:11:28Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"b0328afd95190bf8c23a9334412cb862a93ace66d8a70627a26577163e36ae51","abstract_canon_sha256":"4de9f1701a1d062db1fcf3a60a2ec03bd8419c15e06912e71da2782c69a2384b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:18.189269Z","signature_b64":"nCrNHH0KGvJRV3/HwvmCjvlMyYtq6rKWOQGiQyZi5NVFXvbOrGf4BFCVd2n9I98OYuh1Wx/WfRvFJoRvMEcKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1cce527a048c95dd2db17f5744e579b9d292f3aaf592e13ca79e296f4715119","last_reissued_at":"2026-05-18T00:43:18.188617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:18.188617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factoring using 2n+2 qubits with Toffoli based modular multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Krysta M. Svore, Martin Roetteler, Thomas H\\\"aner","submitted_at":"2016-11-23T21:11:28Z","abstract_excerpt":"We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast to previous space-optimized implementations, ours features a purely Toffoli based modular multiplication circuit. The circuit depth and the overall gate count are in O(n^3) and O(n^3 log(n)), respectively. We thus achieve the same space and time costs as Takahashi et al., while using a purely classical modular multiplication circuit. As a consequence, our approach evades most of the cost overheads originating from rotation synthesis and enables testing and localization of faul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07995","kind":"arxiv","version":2},"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":"1611.07995","created_at":"2026-05-18T00:43:18.188714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07995v2","created_at":"2026-05-18T00:43:18.188714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07995","created_at":"2026-05-18T00:43:18.188714+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HGOKJ5AJDEV","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HGOKJ5AJDEV3UW3","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HGOKJ5A","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07983","citing_title":"Price and Payoff: Non-Determinism in Fault Tolerant Quantum Computation","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2508.19160","citing_title":"Architecting Distributed Quantum Computers: Design Insights from Resource Estimation","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO","json":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO.json","graph_json":"https://pith.science/api/pith-number/4HGOKJ5AJDEV3UW3C72XITSXTO/graph.json","events_json":"https://pith.science/api/pith-number/4HGOKJ5AJDEV3UW3C72XITSXTO/events.json","paper":"https://pith.science/paper/4HGOKJ5A"},"agent_actions":{"view_html":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO","download_json":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO.json","view_paper":"https://pith.science/paper/4HGOKJ5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07995&json=true","fetch_graph":"https://pith.science/api/pith-number/4HGOKJ5AJDEV3UW3C72XITSXTO/graph.json","fetch_events":"https://pith.science/api/pith-number/4HGOKJ5AJDEV3UW3C72XITSXTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/action/storage_attestation","attest_author":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/action/author_attestation","sign_citation":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/action/citation_signature","submit_replication":"https://pith.science/pith/4HGOKJ5AJDEV3UW3C72XITSXTO/action/replication_record"}},"created_at":"2026-05-18T00:43:18.188714+00:00","updated_at":"2026-05-18T00:43:18.188714+00:00"}