{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:PGOCAPEOOZA4RX3EDILTMAYSOH","short_pith_number":"pith:PGOCAPEO","canonical_record":{"source":{"id":"quant-ph/0508139","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-18T20:15:03Z","cross_cats_sorted":[],"title_canon_sha256":"69f92a45ec3f5cb98f15f690e114cfe7429330b72677a4d7c88343cd60969c59","abstract_canon_sha256":"0a7286bc42b08abe79f7a61513897842a9968c9923f383b5eda5cf4887eb3891"},"schema_version":"1.0"},"canonical_sha256":"799c203c8e7641c8df641a1736031271d9665d851105484bdf7887491341835a","source":{"kind":"arxiv","id":"quant-ph/0508139","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0508139","created_at":"2026-07-04T15:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0508139v2","created_at":"2026-07-04T15:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0508139","created_at":"2026-07-04T15:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"PGOCAPEOOZA4","created_at":"2026-07-04T15:00:42Z"},{"alias_kind":"pith_short_16","alias_value":"PGOCAPEOOZA4RX3E","created_at":"2026-07-04T15:00:42Z"},{"alias_kind":"pith_short_8","alias_value":"PGOCAPEO","created_at":"2026-07-04T15:00:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:PGOCAPEOOZA4RX3EDILTMAYSOH","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0508139","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-18T20:15:03Z","cross_cats_sorted":[],"title_canon_sha256":"69f92a45ec3f5cb98f15f690e114cfe7429330b72677a4d7c88343cd60969c59","abstract_canon_sha256":"0a7286bc42b08abe79f7a61513897842a9968c9923f383b5eda5cf4887eb3891"},"schema_version":"1.0"},"canonical_sha256":"799c203c8e7641c8df641a1736031271d9665d851105484bdf7887491341835a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:00:42.974528Z","signature_b64":"pwV0v/ssJzMDoR0x09mPNL3jDcY4Xwa8WO+RdHAgbzGzJmyetyh71Sw8RyQXet5zA4IFBcY9+rOMeQg5vebYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"799c203c8e7641c8df641a1736031271d9665d851105484bdf7887491341835a","last_reissued_at":"2026-07-04T15:00:42.974175Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:00:42.974175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0508139","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-07-04T15:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqhnXFLcetIILer6O8xfHxtuGMcUyA4LXA0v3KI8w1a6S1WyoeqfLqEw0EUwnPu+N1NmcaLgxTWkdXvJui11Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T20:39:45.928923Z"},"content_sha256":"ffb632745c935605a63986ecb42cf0c5b15184a0ff43a86ead644df24dd2a2ce","schema_version":"1.0","event_id":"sha256:ffb632745c935605a63986ecb42cf0c5b15184a0ff43a86ead644df24dd2a2ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:PGOCAPEOOZA4RX3EDILTMAYSOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient quantum algorithms for simulating sparse Hamiltonians","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Dominic W. Berry, Graeme Ahokas, Richard Cleve","submitted_at":"2005-08-18T20:15:03Z","abstract_excerpt":"We present an efficient quantum algorithm for simulating the evolution of a sparse Hamiltonian H for a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a constant number of nonzero entries in each row/column, and |H| is bounded by a constant, we may select any positive integer $k$ such that the simulation requires O((\\log^*n)t^{1+1/2k}) accesses to matrix entries of H. We show that the temporal scaling cannot be significantly improved beyond this, because sublinear time scaling is not possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0508139","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0508139/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-04T15:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+a/OLIaNNkeRDugZA/GnVAIJEoBl1nwQDHCX6A43bnbsREvNw8LxYfW9Ljf27nI4XFq7tHB9//67/fS7DmjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T20:39:45.929438Z"},"content_sha256":"2ab86323843aae7e6d5c32bdfef6787fdb85da2211395810740002c2080107af","schema_version":"1.0","event_id":"sha256:2ab86323843aae7e6d5c32bdfef6787fdb85da2211395810740002c2080107af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/bundle.json","state_url":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/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-15T20:39:45Z","links":{"resolver":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH","bundle":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/bundle.json","state":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:PGOCAPEOOZA4RX3EDILTMAYSOH","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":"0a7286bc42b08abe79f7a61513897842a9968c9923f383b5eda5cf4887eb3891","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-18T20:15:03Z","title_canon_sha256":"69f92a45ec3f5cb98f15f690e114cfe7429330b72677a4d7c88343cd60969c59"},"schema_version":"1.0","source":{"id":"quant-ph/0508139","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0508139","created_at":"2026-07-04T15:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0508139v2","created_at":"2026-07-04T15:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0508139","created_at":"2026-07-04T15:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"PGOCAPEOOZA4","created_at":"2026-07-04T15:00:42Z"},{"alias_kind":"pith_short_16","alias_value":"PGOCAPEOOZA4RX3E","created_at":"2026-07-04T15:00:42Z"},{"alias_kind":"pith_short_8","alias_value":"PGOCAPEO","created_at":"2026-07-04T15:00:42Z"}],"graph_snapshots":[{"event_id":"sha256:2ab86323843aae7e6d5c32bdfef6787fdb85da2211395810740002c2080107af","target":"graph","created_at":"2026-07-04T15:00:42Z","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/0508139/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an efficient quantum algorithm for simulating the evolution of a sparse Hamiltonian H for a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a constant number of nonzero entries in each row/column, and |H| is bounded by a constant, we may select any positive integer $k$ such that the simulation requires O((\\log^*n)t^{1+1/2k}) accesses to matrix entries of H. We show that the temporal scaling cannot be significantly improved beyond this, because sublinear time scaling is not possible.","authors_text":"Barry C. Sanders, Dominic W. Berry, Graeme Ahokas, Richard Cleve","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-08-18T20:15:03Z","title":"Efficient quantum algorithms for simulating sparse Hamiltonians"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0508139","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:ffb632745c935605a63986ecb42cf0c5b15184a0ff43a86ead644df24dd2a2ce","target":"record","created_at":"2026-07-04T15:00:42Z","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":"0a7286bc42b08abe79f7a61513897842a9968c9923f383b5eda5cf4887eb3891","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-18T20:15:03Z","title_canon_sha256":"69f92a45ec3f5cb98f15f690e114cfe7429330b72677a4d7c88343cd60969c59"},"schema_version":"1.0","source":{"id":"quant-ph/0508139","kind":"arxiv","version":2}},"canonical_sha256":"799c203c8e7641c8df641a1736031271d9665d851105484bdf7887491341835a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"799c203c8e7641c8df641a1736031271d9665d851105484bdf7887491341835a","first_computed_at":"2026-07-04T15:00:42.974175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:00:42.974175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pwV0v/ssJzMDoR0x09mPNL3jDcY4Xwa8WO+RdHAgbzGzJmyetyh71Sw8RyQXet5zA4IFBcY9+rOMeQg5vebYCw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:00:42.974528Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0508139","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffb632745c935605a63986ecb42cf0c5b15184a0ff43a86ead644df24dd2a2ce","sha256:2ab86323843aae7e6d5c32bdfef6787fdb85da2211395810740002c2080107af"],"state_sha256":"5d06f6cb0d3bd6ab172a063888367eb0b3078460b5b0cec49bff3aa03c183956"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UAB4mBjk7nD1vF1MYNxaGugRleuaf0NnX07Jj4StrioZRo9n53XSxohUCjQZ0mzBdh2FnHILItUA2eJMDDG0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T20:39:45.934629Z","bundle_sha256":"2c9ac0b17925a9fcd902032525a972d82e68c6a476426222b3cf98b9b7531cf8"}}