{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IH6D7WSRNNNTJ3UE7ZADNMJDDS","short_pith_number":"pith:IH6D7WSR","schema_version":"1.0","canonical_sha256":"41fc3fda516b5b34ee84fe4036b1231cb3f5dd639187ecc16a59216944317669","source":{"kind":"arxiv","id":"1807.03967","version":1},"attestation_state":"computed","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 \\"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.03967","created_at":"2026-05-17T23:40:49.638737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03967v1","created_at":"2026-05-17T23:40:49.638737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03967","created_at":"2026-05-17T23:40:49.638737+00:00"},{"alias_kind":"pith_short_12","alias_value":"IH6D7WSRNNNT","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IH6D7WSRNNNTJ3UE","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IH6D7WSR","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS","json":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS.json","graph_json":"https://pith.science/api/pith-number/IH6D7WSRNNNTJ3UE7ZADNMJDDS/graph.json","events_json":"https://pith.science/api/pith-number/IH6D7WSRNNNTJ3UE7ZADNMJDDS/events.json","paper":"https://pith.science/paper/IH6D7WSR"},"agent_actions":{"view_html":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS","download_json":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS.json","view_paper":"https://pith.science/paper/IH6D7WSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03967&json=true","fetch_graph":"https://pith.science/api/pith-number/IH6D7WSRNNNTJ3UE7ZADNMJDDS/graph.json","fetch_events":"https://pith.science/api/pith-number/IH6D7WSRNNNTJ3UE7ZADNMJDDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/action/storage_attestation","attest_author":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/action/author_attestation","sign_citation":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/action/citation_signature","submit_replication":"https://pith.science/pith/IH6D7WSRNNNTJ3UE7ZADNMJDDS/action/replication_record"}},"created_at":"2026-05-17T23:40:49.638737+00:00","updated_at":"2026-05-17T23:40:49.638737+00:00"}