{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IH6D7WSRNNNTJ3UE7ZADNMJDDS","short_pith_number":"pith:IH6D7WSR","canonical_record":{"source":{"id":"1807.03967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-11T07:02:42Z","cross_cats_sorted":[],"title_canon_sha256":"9dc944a96c5eed0f7b801108beff0d5a3019e75e5967cdf4b7f1413c924fff51","abstract_canon_sha256":"223dd00358d0a79426cd0baca22ff63f00a4acb5993bb3c4081c418caba4571a"},"schema_version":"1.0"},"canonical_sha256":"41fc3fda516b5b34ee84fe4036b1231cb3f5dd639187ecc16a59216944317669","source":{"kind":"arxiv","id":"1807.03967","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03967","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03967v1","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03967","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"pith_short_12","alias_value":"IH6D7WSRNNNT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IH6D7WSRNNNTJ3UE","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IH6D7WSR","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IH6D7WSRNNNTJ3UE7ZADNMJDDS","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-11T07:02:42Z","cross_cats_sorted":[],"title_canon_sha256":"9dc944a96c5eed0f7b801108beff0d5a3019e75e5967cdf4b7f1413c924fff51","abstract_canon_sha256":"223dd00358d0a79426cd0baca22ff63f00a4acb5993bb3c4081c418caba4571a"},"schema_version":"1.0"},"canonical_sha256":"41fc3fda516b5b34ee84fe4036b1231cb3f5dd639187ecc16a59216944317669","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:49.639366Z","signature_b64":"AKpsyRObklQWFvI9ulyzSj55UO4quckTYTIo7nHBBhQC3AQGyH4NmVO0DyhV3XanfwMJjuW8Lhg7ANdT4gPiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41fc3fda516b5b34ee84fe4036b1231cb3f5dd639187ecc16a59216944317669","last_reissued_at":"2026-05-17T23:40:49.638598Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:49.638598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03967","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-05-17T23:40:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcaWSLU5i0F0M7y3aGFx6L9XoTQQtykBbeAHFWnefa+NuWxZQ+E7fFRF/E3jBVsCTpWtTANtOv/kqFzD3xISAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:16:21.720129Z"},"content_sha256":"d11fa222c52de091dbb885c011122b81d4164e07686e8a02fd8d4cf339a63891","schema_version":"1.0","event_id":"sha256:d11fa222c52de091dbb885c011122b81d4164e07686e8a02fd8d4cf339a63891"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IH6D7WSRNNNTJ3UE7ZADNMJDDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamiltonian simulation with nearly optimal dependence on spectral norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guang Hao Low","submitted_at":"2018-07-11T07:02:42Z","abstract_excerpt":"We present a quantum algorithm for approximating the real time evolution $e^{-iHt}$ of an arbitrary $d$-sparse Hamiltonian to error $\\epsilon$, given black-box access to the positions and $b$-bit values of its non-zero matrix entries. The complexity of our algorithm is $\\mathcal{O}((t\\sqrt{d}\\|H\\|_{1 \\rightarrow 2})^{1+o(1)}/\\epsilon^{o(1)})$ queries and a factor $\\mathcal{O}(b)$ more gates, which is shown to be optimal up to subpolynomial factors through a matching query lower bound. This provides a polynomial speedup in sparsity for the common case where the spectral norm $\\|H\\|\\ge\\|H\\|_{1 \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03967","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":""},"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-17T23:40:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TbYVGdkR/+chKuWJBRDls4XUsEDkDSNlZA02gmf5OWjDWPBCGaTrWxIFLJnzf/6D9ibbZ/+Q7ZkvqR5T5+/EDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:16:21.720491Z"},"content_sha256":"07efed2554f4489bed7dc9171367a2ca4066d8392c8d807c6f7742b5b33f2ec8","schema_version":"1.0","event_id":"sha256:07efed2554f4489bed7dc9171367a2ca4066d8392c8d807c6f7742b5b33f2ec8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/bundle.json","state_url":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/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-06-11T12:16:21Z","links":{"resolver":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS","bundle":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/bundle.json","state":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IH6D7WSRNNNTJ3UE7ZADNMJDDS","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":"223dd00358d0a79426cd0baca22ff63f00a4acb5993bb3c4081c418caba4571a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-11T07:02:42Z","title_canon_sha256":"9dc944a96c5eed0f7b801108beff0d5a3019e75e5967cdf4b7f1413c924fff51"},"schema_version":"1.0","source":{"id":"1807.03967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03967","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03967v1","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03967","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"pith_short_12","alias_value":"IH6D7WSRNNNT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IH6D7WSRNNNTJ3UE","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IH6D7WSR","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:07efed2554f4489bed7dc9171367a2ca4066d8392c8d807c6f7742b5b33f2ec8","target":"graph","created_at":"2026-05-17T23:40:49Z","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 present a quantum algorithm for approximating the real time evolution $e^{-iHt}$ of an arbitrary $d$-sparse Hamiltonian to error $\\epsilon$, given black-box access to the positions and $b$-bit values of its non-zero matrix entries. The complexity of our algorithm is $\\mathcal{O}((t\\sqrt{d}\\|H\\|_{1 \\rightarrow 2})^{1+o(1)}/\\epsilon^{o(1)})$ queries and a factor $\\mathcal{O}(b)$ more gates, which is shown to be optimal up to subpolynomial factors through a matching query lower bound. This provides a polynomial speedup in sparsity for the common case where the spectral norm $\\|H\\|\\ge\\|H\\|_{1 \\","authors_text":"Guang Hao Low","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-11T07:02:42Z","title":"Hamiltonian simulation with nearly optimal dependence on spectral norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03967","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:d11fa222c52de091dbb885c011122b81d4164e07686e8a02fd8d4cf339a63891","target":"record","created_at":"2026-05-17T23:40:49Z","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":"223dd00358d0a79426cd0baca22ff63f00a4acb5993bb3c4081c418caba4571a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-11T07:02:42Z","title_canon_sha256":"9dc944a96c5eed0f7b801108beff0d5a3019e75e5967cdf4b7f1413c924fff51"},"schema_version":"1.0","source":{"id":"1807.03967","kind":"arxiv","version":1}},"canonical_sha256":"41fc3fda516b5b34ee84fe4036b1231cb3f5dd639187ecc16a59216944317669","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41fc3fda516b5b34ee84fe4036b1231cb3f5dd639187ecc16a59216944317669","first_computed_at":"2026-05-17T23:40:49.638598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:49.638598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AKpsyRObklQWFvI9ulyzSj55UO4quckTYTIo7nHBBhQC3AQGyH4NmVO0DyhV3XanfwMJjuW8Lhg7ANdT4gPiAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:49.639366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d11fa222c52de091dbb885c011122b81d4164e07686e8a02fd8d4cf339a63891","sha256:07efed2554f4489bed7dc9171367a2ca4066d8392c8d807c6f7742b5b33f2ec8"],"state_sha256":"06f0c009f5d93f886a789703585843bd26bd74950a5a9eeaf273224c7a9362d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lOOlDx/3Vzw0Yf+u25xKGjwkEz3ipfA7+14Qssvfzskau39ioqfsAsYZoCXROFYQ4GOQii7NLIjKf+RfGa8BAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:16:21.722380Z","bundle_sha256":"939a5cf08e0acfd0bf1178599fd1525197d2da1f2fc91117c3e6d3f2a30634b1"}}