{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:PGOCAPEOOZA4RX3EDILTMAYSOH","short_pith_number":"pith:PGOCAPEO","schema_version":"1.0","canonical_sha256":"799c203c8e7641c8df641a1736031271d9665d851105484bdf7887491341835a","source":{"kind":"arxiv","id":"quant-ph/0508139","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0508139","created_at":"2026-07-04T15:00:42.974235+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0508139v2","created_at":"2026-07-04T15:00:42.974235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0508139","created_at":"2026-07-04T15:00:42.974235+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGOCAPEOOZA4","created_at":"2026-07-04T15:00:42.974235+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGOCAPEOOZA4RX3E","created_at":"2026-07-04T15:00:42.974235+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGOCAPEO","created_at":"2026-07-04T15:00:42.974235+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2606.12770","citing_title":"Explicit Quantum Circuit Simulation of Nonlinear 1-Dimensional Fluid with Carleman-linearized Boltzmann Method","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2606.29741","citing_title":"Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2606.30396","citing_title":"Provable Quantum Advantage for Dynamical Phase Transition","ref_index":60,"is_internal_anchor":true},{"citing_arxiv_id":"2605.25178","citing_title":"Pseudorandom Dynamics in the SYK Model and Cryptographic Censorship in JT Gravity","ref_index":74,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH","json":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH.json","graph_json":"https://pith.science/api/pith-number/PGOCAPEOOZA4RX3EDILTMAYSOH/graph.json","events_json":"https://pith.science/api/pith-number/PGOCAPEOOZA4RX3EDILTMAYSOH/events.json","paper":"https://pith.science/paper/PGOCAPEO"},"agent_actions":{"view_html":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH","download_json":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH.json","view_paper":"https://pith.science/paper/PGOCAPEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0508139&json=true","fetch_graph":"https://pith.science/api/pith-number/PGOCAPEOOZA4RX3EDILTMAYSOH/graph.json","fetch_events":"https://pith.science/api/pith-number/PGOCAPEOOZA4RX3EDILTMAYSOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/action/storage_attestation","attest_author":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/action/author_attestation","sign_citation":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/action/citation_signature","submit_replication":"https://pith.science/pith/PGOCAPEOOZA4RX3EDILTMAYSOH/action/replication_record"}},"created_at":"2026-07-04T15:00:42.974235+00:00","updated_at":"2026-07-04T15:00:42.974235+00:00"}