{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UWKE4L5FCSPLT4HHOOVPDRNPER","short_pith_number":"pith:UWKE4L5F","canonical_record":{"source":{"id":"1207.2307","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-10T10:58:40Z","cross_cats_sorted":[],"title_canon_sha256":"fa0d97d45a545c8dd170fac433e6d3fdaa641c61380f98a00d7d69aed34d421f","abstract_canon_sha256":"8bdac101c2f9775d82d903a798fecee8d99901ced74052d8fc43caf8db3766bc"},"schema_version":"1.0"},"canonical_sha256":"a5944e2fa5149eb9f0e773aaf1c5af246cf15f15609c3a1c7cd62670f3b20187","source":{"kind":"arxiv","id":"1207.2307","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2307","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2307v2","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2307","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"UWKE4L5FCSPL","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"UWKE4L5FCSPLT4HH","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"UWKE4L5F","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UWKE4L5FCSPLT4HHOOVPDRNPER","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2307","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-10T10:58:40Z","cross_cats_sorted":[],"title_canon_sha256":"fa0d97d45a545c8dd170fac433e6d3fdaa641c61380f98a00d7d69aed34d421f","abstract_canon_sha256":"8bdac101c2f9775d82d903a798fecee8d99901ced74052d8fc43caf8db3766bc"},"schema_version":"1.0"},"canonical_sha256":"a5944e2fa5149eb9f0e773aaf1c5af246cf15f15609c3a1c7cd62670f3b20187","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:17.547281Z","signature_b64":"F075WJbvHOwARKU4eYjXsK9DdxKcyQqVfK0h91kwSgv+Qf13lkB40Oc4HYBxWQEXtwxsPSBzkUrrKFGEwxm3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5944e2fa5149eb9f0e773aaf1c5af246cf15f15609c3a1c7cd62670f3b20187","last_reissued_at":"2026-05-18T03:31:17.546491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:17.546491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2307","source_version":2,"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-05-18T03:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgTkgF+oOSeyv7c/r+1vlZLqrPoPU5d65J6ldwy1k5644wug4H8oHV2+zgDyYilFVqvyJ7q8C3wJ7Y62PgUKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:47:21.115857Z"},"content_sha256":"eec34e931c8b067e438c3f99aed02941c3bda57f6a061763eb0097ee0e93a8a8","schema_version":"1.0","event_id":"sha256:eec34e931c8b067e438c3f99aed02941c3bda57f6a061763eb0097ee0e93a8a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UWKE4L5FCSPLT4HHOOVPDRNPER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Distributed Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aram Harrow, Dan Shepherd, Mark Stather, Noah Linden, Oliver Gray, Robert Beals, Samuel Kutin, Stephen Brierley","submitted_at":"2012-07-10T10:58:40Z","abstract_excerpt":"We provide algorithms for efficiently addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with low overhead by the more realistic model of a distributed quantum computer. As a result, the circuit model can be used by algorithm designers without worrying whether the underlying architecture supports the connectivity of the circuit. In addition, we apply our results to existing memory intensive quantum algorithms. We present a parallel quantum search algorithm and improve the time-space trade-off for the Element Distinctness and Collision problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2307","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"},"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-05-18T03:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHbMDRn96HeCLsT0uUG4YhLO1U+ZaSpESdgSpnSjTqbGRhObiIWpEWmAjF4ARB1toX5fI7XP/cSOyxdiaFKSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:47:21.116517Z"},"content_sha256":"7ef7774e95e0f15da8a2e679140c3711c9b087173e8e17d66f666af56fd56792","schema_version":"1.0","event_id":"sha256:7ef7774e95e0f15da8a2e679140c3711c9b087173e8e17d66f666af56fd56792"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWKE4L5FCSPLT4HHOOVPDRNPER/bundle.json","state_url":"https://pith.science/pith/UWKE4L5FCSPLT4HHOOVPDRNPER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWKE4L5FCSPLT4HHOOVPDRNPER/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-05-30T03:47:21Z","links":{"resolver":"https://pith.science/pith/UWKE4L5FCSPLT4HHOOVPDRNPER","bundle":"https://pith.science/pith/UWKE4L5FCSPLT4HHOOVPDRNPER/bundle.json","state":"https://pith.science/pith/UWKE4L5FCSPLT4HHOOVPDRNPER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWKE4L5FCSPLT4HHOOVPDRNPER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UWKE4L5FCSPLT4HHOOVPDRNPER","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":"8bdac101c2f9775d82d903a798fecee8d99901ced74052d8fc43caf8db3766bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-10T10:58:40Z","title_canon_sha256":"fa0d97d45a545c8dd170fac433e6d3fdaa641c61380f98a00d7d69aed34d421f"},"schema_version":"1.0","source":{"id":"1207.2307","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2307","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2307v2","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2307","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"UWKE4L5FCSPL","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"UWKE4L5FCSPLT4HH","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"UWKE4L5F","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:7ef7774e95e0f15da8a2e679140c3711c9b087173e8e17d66f666af56fd56792","target":"graph","created_at":"2026-05-18T03:31:17Z","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"},"paper":{"abstract_excerpt":"We provide algorithms for efficiently addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with low overhead by the more realistic model of a distributed quantum computer. As a result, the circuit model can be used by algorithm designers without worrying whether the underlying architecture supports the connectivity of the circuit. In addition, we apply our results to existing memory intensive quantum algorithms. We present a parallel quantum search algorithm and improve the time-space trade-off for the Element Distinctness and Collision problems.","authors_text":"Aram Harrow, Dan Shepherd, Mark Stather, Noah Linden, Oliver Gray, Robert Beals, Samuel Kutin, Stephen Brierley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-10T10:58:40Z","title":"Efficient Distributed Quantum Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2307","kind":"arxiv","version":2},"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:eec34e931c8b067e438c3f99aed02941c3bda57f6a061763eb0097ee0e93a8a8","target":"record","created_at":"2026-05-18T03:31:17Z","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":"8bdac101c2f9775d82d903a798fecee8d99901ced74052d8fc43caf8db3766bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-10T10:58:40Z","title_canon_sha256":"fa0d97d45a545c8dd170fac433e6d3fdaa641c61380f98a00d7d69aed34d421f"},"schema_version":"1.0","source":{"id":"1207.2307","kind":"arxiv","version":2}},"canonical_sha256":"a5944e2fa5149eb9f0e773aaf1c5af246cf15f15609c3a1c7cd62670f3b20187","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5944e2fa5149eb9f0e773aaf1c5af246cf15f15609c3a1c7cd62670f3b20187","first_computed_at":"2026-05-18T03:31:17.546491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:17.546491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F075WJbvHOwARKU4eYjXsK9DdxKcyQqVfK0h91kwSgv+Qf13lkB40Oc4HYBxWQEXtwxsPSBzkUrrKFGEwxm3Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:17.547281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2307","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eec34e931c8b067e438c3f99aed02941c3bda57f6a061763eb0097ee0e93a8a8","sha256:7ef7774e95e0f15da8a2e679140c3711c9b087173e8e17d66f666af56fd56792"],"state_sha256":"5d463076a7b0aec267ccf5ade7e064a64b9f6cf188a422e5436f256024e2cf14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yr33ss9KEG3+0GYswN0kn3CUqo6WVHpVDMKkhA0ucaOpTryZKm3rfESmfEtzMap0w4rd9WXZYwPz+Eqn5IvlDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:47:21.119895Z","bundle_sha256":"79c3c06dccca9fdcc0bc8d28fcc4dfffcba5ea217ae9c93d0f0ae9cdb7ff08ff"}}