{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:B2BKELKUSTCAQXWEE2ZUIIQYC3","short_pith_number":"pith:B2BKELKU","canonical_record":{"source":{"id":"quant-ph/0601097","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-15T20:22:55Z","cross_cats_sorted":[],"title_canon_sha256":"a1c8ac470dff820c4259b2987bd7b1627b3f69fabda72351d3964722af111e8b","abstract_canon_sha256":"dbbd513c04466375b5db9be97ed7bb17014bbdd1b765f6b76a84fe686e1ad8c8"},"schema_version":"1.0"},"canonical_sha256":"0e82a22d5494c4085ec426b344221816dc4689486000b372760b89f2274121c5","source":{"kind":"arxiv","id":"quant-ph/0601097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0601097","created_at":"2026-07-04T14:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0601097v1","created_at":"2026-07-04T14:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0601097","created_at":"2026-07-04T14:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"B2BKELKUSTCA","created_at":"2026-07-04T14:52:57Z"},{"alias_kind":"pith_short_16","alias_value":"B2BKELKUSTCAQXWE","created_at":"2026-07-04T14:52:57Z"},{"alias_kind":"pith_short_8","alias_value":"B2BKELKU","created_at":"2026-07-04T14:52:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:B2BKELKUSTCAQXWEE2ZUIIQYC3","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0601097","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-15T20:22:55Z","cross_cats_sorted":[],"title_canon_sha256":"a1c8ac470dff820c4259b2987bd7b1627b3f69fabda72351d3964722af111e8b","abstract_canon_sha256":"dbbd513c04466375b5db9be97ed7bb17014bbdd1b765f6b76a84fe686e1ad8c8"},"schema_version":"1.0"},"canonical_sha256":"0e82a22d5494c4085ec426b344221816dc4689486000b372760b89f2274121c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:52:57.475072Z","signature_b64":"cmVL84UQ8JWVPN25HH4rXtf07Uaq810U9vrlj/oVWPyMpVaiI7B6n18FGrx1WW5I2bxRm/25WF5UCiciQMH4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e82a22d5494c4085ec426b344221816dc4689486000b372760b89f2274121c5","last_reissued_at":"2026-07-04T14:52:57.474719Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:52:57.474719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0601097","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ww0KfQWQmwf95beX/qR7zSFys3xOEh0RgFhr4HDMXvnr4jcEXZSNWewTsY3ZTXs193zgPBwseZG+y4Vh+uFZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:33:11.200455Z"},"content_sha256":"6aa9a3baeadc45f69bab6954aef30b8b4deb7081f68de997556b69a91b817fdb","schema_version":"1.0","event_id":"sha256:6aa9a3baeadc45f69bab6954aef30b8b4deb7081f68de997556b69a91b817fdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:B2BKELKUSTCAQXWEE2ZUIIQYC3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shor's algorithm with fewer (pure) qubits","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christof Zalka","submitted_at":"2006-01-15T20:22:55Z","abstract_excerpt":"In this note we consider optimised circuits for implementing Shor's quantum factoring algorithm. First I give a circuit for which none of the about 2n qubits need to be initialised (though we still have to make the usual 2n measurements later on). Then I show how the modular additions in the algorithm can be carried out with a superposition of an arithmetic sequence. This makes parallelisation of Shor's algorithm easier. Finally I show how one can factor with only about 1.5n qubits, and maybe even fewer."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0601097","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/0601097/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRCY3X9SI61vNPtQGyzqcnb/c89XB/GTMQ8LcPi71R7kISfo5yhJwP0pSld4z9fK7d85Pc2PmI095NuDeVJJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:33:11.200954Z"},"content_sha256":"49bc0593142a3fc1478f63428f91cb89d89266ce3c573df667d499e12cdffc99","schema_version":"1.0","event_id":"sha256:49bc0593142a3fc1478f63428f91cb89d89266ce3c573df667d499e12cdffc99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2BKELKUSTCAQXWEE2ZUIIQYC3/bundle.json","state_url":"https://pith.science/pith/B2BKELKUSTCAQXWEE2ZUIIQYC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2BKELKUSTCAQXWEE2ZUIIQYC3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T23:33:11Z","links":{"resolver":"https://pith.science/pith/B2BKELKUSTCAQXWEE2ZUIIQYC3","bundle":"https://pith.science/pith/B2BKELKUSTCAQXWEE2ZUIIQYC3/bundle.json","state":"https://pith.science/pith/B2BKELKUSTCAQXWEE2ZUIIQYC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2BKELKUSTCAQXWEE2ZUIIQYC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:B2BKELKUSTCAQXWEE2ZUIIQYC3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dbbd513c04466375b5db9be97ed7bb17014bbdd1b765f6b76a84fe686e1ad8c8","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-15T20:22:55Z","title_canon_sha256":"a1c8ac470dff820c4259b2987bd7b1627b3f69fabda72351d3964722af111e8b"},"schema_version":"1.0","source":{"id":"quant-ph/0601097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0601097","created_at":"2026-07-04T14:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0601097v1","created_at":"2026-07-04T14:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0601097","created_at":"2026-07-04T14:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"B2BKELKUSTCA","created_at":"2026-07-04T14:52:57Z"},{"alias_kind":"pith_short_16","alias_value":"B2BKELKUSTCAQXWE","created_at":"2026-07-04T14:52:57Z"},{"alias_kind":"pith_short_8","alias_value":"B2BKELKU","created_at":"2026-07-04T14:52:57Z"}],"graph_snapshots":[{"event_id":"sha256:49bc0593142a3fc1478f63428f91cb89d89266ce3c573df667d499e12cdffc99","target":"graph","created_at":"2026-07-04T14:52:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0601097/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this note we consider optimised circuits for implementing Shor's quantum factoring algorithm. First I give a circuit for which none of the about 2n qubits need to be initialised (though we still have to make the usual 2n measurements later on). Then I show how the modular additions in the algorithm can be carried out with a superposition of an arithmetic sequence. This makes parallelisation of Shor's algorithm easier. Finally I show how one can factor with only about 1.5n qubits, and maybe even fewer.","authors_text":"Christof Zalka","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2006-01-15T20:22:55Z","title":"Shor's algorithm with fewer (pure) qubits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0601097","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6aa9a3baeadc45f69bab6954aef30b8b4deb7081f68de997556b69a91b817fdb","target":"record","created_at":"2026-07-04T14:52:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dbbd513c04466375b5db9be97ed7bb17014bbdd1b765f6b76a84fe686e1ad8c8","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-15T20:22:55Z","title_canon_sha256":"a1c8ac470dff820c4259b2987bd7b1627b3f69fabda72351d3964722af111e8b"},"schema_version":"1.0","source":{"id":"quant-ph/0601097","kind":"arxiv","version":1}},"canonical_sha256":"0e82a22d5494c4085ec426b344221816dc4689486000b372760b89f2274121c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e82a22d5494c4085ec426b344221816dc4689486000b372760b89f2274121c5","first_computed_at":"2026-07-04T14:52:57.474719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:52:57.474719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cmVL84UQ8JWVPN25HH4rXtf07Uaq810U9vrlj/oVWPyMpVaiI7B6n18FGrx1WW5I2bxRm/25WF5UCiciQMH4DQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:52:57.475072Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0601097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6aa9a3baeadc45f69bab6954aef30b8b4deb7081f68de997556b69a91b817fdb","sha256:49bc0593142a3fc1478f63428f91cb89d89266ce3c573df667d499e12cdffc99"],"state_sha256":"056c6be37a760eb2a26e5a137266df1e8896f71804776ddbc806273aa4c36200"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wECXEHFZrmT5Al9rvyu/ufPHzBIsSOiNmh5xgwAIp46xqWy2FgIc4YALoHuspMld64GBdTr8McIpI1tGIxG9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:33:11.206256Z","bundle_sha256":"52f21c48d24f32bdc160c7796f5ea2a51156caf52fb34d35dab1ba1a7c086cea"}}