{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:4KPJV6GVEDXLXROBDKU4YOL2AI","short_pith_number":"pith:4KPJV6GV","schema_version":"1.0","canonical_sha256":"e29e9af8d520eebbc5c11aa9cc397a021c95708cf80c0eb77aacc44f6fee28d5","source":{"kind":"arxiv","id":"quant-ph/9602016","version":1},"attestation_state":"computed","paper":{"title":"Efficient Networks for Quantum Factoring","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Amalavoyal N. Chari, David Beckman, John Preskill (Caltech), Srikrishna Devabhaktuni","submitted_at":"1996-02-21T22:36:14Z","abstract_excerpt":"We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory qubits and the number of operations required to perform factorization, using the algorithm suggested by Shor. A $K$-bit number can be factored in time of order $K^3$ using a machine capable of storing $5K+1$ qubits. Evaluation of the modular exponential function (the bottleneck of Shor's algorithm) could be achieved with about $72 K^3$ elementary quantum gates; implementation using a linear ion trap would require about $396 K^3$ laser pulses. A proof-of-p"},"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/9602016","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-02-21T22:36:14Z","cross_cats_sorted":[],"title_canon_sha256":"679d2bf9a74c918af88ea0fb1680c16d9d90eaa38e376d516b48c8ab7d0b1baf","abstract_canon_sha256":"85825e45ed30910450b4545eaf005952618f5edc85eb9c7e429a45ad5b0d766b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:34:57.488925Z","signature_b64":"Uf4AzQhv3okI0qS57zB5z33xqmfJo7ouKIGR3CIUUS/OgekC/G/2p8JBuJZGf+Z9LuRoj/cWoXJxfum7lSNEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e29e9af8d520eebbc5c11aa9cc397a021c95708cf80c0eb77aacc44f6fee28d5","last_reissued_at":"2026-07-04T15:34:57.488516Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:34:57.488516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Networks for Quantum Factoring","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Amalavoyal N. Chari, David Beckman, John Preskill (Caltech), Srikrishna Devabhaktuni","submitted_at":"1996-02-21T22:36:14Z","abstract_excerpt":"We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory qubits and the number of operations required to perform factorization, using the algorithm suggested by Shor. A $K$-bit number can be factored in time of order $K^3$ using a machine capable of storing $5K+1$ qubits. Evaluation of the modular exponential function (the bottleneck of Shor's algorithm) could be achieved with about $72 K^3$ elementary quantum gates; implementation using a linear ion trap would require about $396 K^3$ laser pulses. A proof-of-p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9602016","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9602016/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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/9602016","created_at":"2026-07-04T15:34:57.488579+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9602016v1","created_at":"2026-07-04T15:34:57.488579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9602016","created_at":"2026-07-04T15:34:57.488579+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KPJV6GVEDXL","created_at":"2026-07-04T15:34:57.488579+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KPJV6GVEDXLXROB","created_at":"2026-07-04T15:34:57.488579+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KPJV6GV","created_at":"2026-07-04T15:34:57.488579+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21031","citing_title":"Introducing the Quantum Economic Advantage Online Calculator","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KPJV6GVEDXLXROBDKU4YOL2AI","json":"https://pith.science/pith/4KPJV6GVEDXLXROBDKU4YOL2AI.json","graph_json":"https://pith.science/api/pith-number/4KPJV6GVEDXLXROBDKU4YOL2AI/graph.json","events_json":"https://pith.science/api/pith-number/4KPJV6GVEDXLXROBDKU4YOL2AI/events.json","paper":"https://pith.science/paper/4KPJV6GV"},"agent_actions":{"view_html":"https://pith.science/pith/4KPJV6GVEDXLXROBDKU4YOL2AI","download_json":"https://pith.science/pith/4KPJV6GVEDXLXROBDKU4YOL2AI.json","view_paper":"https://pith.science/paper/4KPJV6GV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9602016&json=true","fetch_graph":"https://pith.science/api/pith-number/4KPJV6GVEDXLXROBDKU4YOL2AI/graph.json","fetch_events":"https://pith.science/api/pith-number/4KPJV6GVEDXLXROBDKU4YOL2AI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KPJV6GVEDXLXROBDKU4YOL2AI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KPJV6GVEDXLXROBDKU4YOL2AI/action/storage_attestation","attest_author":"https://pith.science/pith/4KPJV6GVEDXLXROBDKU4YOL2AI/action/author_attestation","sign_citation":"https://pith.science/pith/4KPJV6GVEDXLXROBDKU4YOL2AI/action/citation_signature","submit_replication":"https://pith.science/pith/4KPJV6GVEDXLXROBDKU4YOL2AI/action/replication_record"}},"created_at":"2026-07-04T15:34:57.488579+00:00","updated_at":"2026-07-04T15:34:57.488579+00:00"}