{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2FWQZRX7EAOZ5HAFAY6J7H743Z","short_pith_number":"pith:2FWQZRX7","schema_version":"1.0","canonical_sha256":"d16d0cc6ff201d9e9c05063c9f9ffcde7f169ecd8c88321a551f243a7c09a598","source":{"kind":"arxiv","id":"1501.01715","version":3},"attestation_state":"computed","paper":{"title":"Hamiltonian simulation with nearly optimal dependence on all parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Dominic W. Berry, Robin Kothari","submitted_at":"2015-01-08T03:19:04Z","abstract_excerpt":"We present an algorithm for sparse Hamiltonian simulation whose complexity is optimal (up to log factors) as a function of all parameters of interest. Previous algorithms had optimal or near-optimal scaling in some parameters at the cost of poor scaling in others. Hamiltonian simulation via a quantum walk has optimal dependence on the sparsity at the expense of poor scaling in the allowed error. In contrast, an approach based on fractional-query simulation provides optimal scaling in the error at the expense of poor scaling in the sparsity. Here we combine the two approaches, achieving the bes"},"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":"1501.01715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-01-08T03:19:04Z","cross_cats_sorted":[],"title_canon_sha256":"626bc7d4202fd38ff46afb0bcaf56ba6804fd4cb957ca45b921de9bf429c8bc4","abstract_canon_sha256":"6da2e9a9d1326df026b1a06cda49aff6153f3aa77aae83aeb67ef154ef8ac6a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:24.579799Z","signature_b64":"TfsB+Gwb+m79krZWrVuJ1iarAGftfr3/xJo+4guiImJ38fTHVLjmqRm90r65i1IF5xUNKKA5TSLvf/M6whC9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d16d0cc6ff201d9e9c05063c9f9ffcde7f169ecd8c88321a551f243a7c09a598","last_reissued_at":"2026-05-18T01:23:24.579152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:24.579152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonian simulation with nearly optimal dependence on all parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Dominic W. Berry, Robin Kothari","submitted_at":"2015-01-08T03:19:04Z","abstract_excerpt":"We present an algorithm for sparse Hamiltonian simulation whose complexity is optimal (up to log factors) as a function of all parameters of interest. Previous algorithms had optimal or near-optimal scaling in some parameters at the cost of poor scaling in others. Hamiltonian simulation via a quantum walk has optimal dependence on the sparsity at the expense of poor scaling in the allowed error. In contrast, an approach based on fractional-query simulation provides optimal scaling in the error at the expense of poor scaling in the sparsity. Here we combine the two approaches, achieving the bes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01715","kind":"arxiv","version":3},"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":"1501.01715","created_at":"2026-05-18T01:23:24.579243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01715v3","created_at":"2026-05-18T01:23:24.579243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01715","created_at":"2026-05-18T01:23:24.579243+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FWQZRX7EAOZ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FWQZRX7EAOZ5HAF","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FWQZRX7","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.29741","citing_title":"Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2606.30396","citing_title":"Provable Quantum Advantage for Dynamical Phase Transition","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2FWQZRX7EAOZ5HAFAY6J7H743Z","json":"https://pith.science/pith/2FWQZRX7EAOZ5HAFAY6J7H743Z.json","graph_json":"https://pith.science/api/pith-number/2FWQZRX7EAOZ5HAFAY6J7H743Z/graph.json","events_json":"https://pith.science/api/pith-number/2FWQZRX7EAOZ5HAFAY6J7H743Z/events.json","paper":"https://pith.science/paper/2FWQZRX7"},"agent_actions":{"view_html":"https://pith.science/pith/2FWQZRX7EAOZ5HAFAY6J7H743Z","download_json":"https://pith.science/pith/2FWQZRX7EAOZ5HAFAY6J7H743Z.json","view_paper":"https://pith.science/paper/2FWQZRX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01715&json=true","fetch_graph":"https://pith.science/api/pith-number/2FWQZRX7EAOZ5HAFAY6J7H743Z/graph.json","fetch_events":"https://pith.science/api/pith-number/2FWQZRX7EAOZ5HAFAY6J7H743Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FWQZRX7EAOZ5HAFAY6J7H743Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FWQZRX7EAOZ5HAFAY6J7H743Z/action/storage_attestation","attest_author":"https://pith.science/pith/2FWQZRX7EAOZ5HAFAY6J7H743Z/action/author_attestation","sign_citation":"https://pith.science/pith/2FWQZRX7EAOZ5HAFAY6J7H743Z/action/citation_signature","submit_replication":"https://pith.science/pith/2FWQZRX7EAOZ5HAFAY6J7H743Z/action/replication_record"}},"created_at":"2026-05-18T01:23:24.579243+00:00","updated_at":"2026-05-18T01:23:24.579243+00:00"}