{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:WD4MA43I3M3R7JQ5D6SCZU4MV6","short_pith_number":"pith:WD4MA43I","schema_version":"1.0","canonical_sha256":"b0f8c07368db371fa61d1fa42cd38caf8538927a96769b1dc1554059bf52096e","source":{"kind":"arxiv","id":"0910.4157","version":4},"attestation_state":"computed","paper":{"title":"Black-box Hamiltonian simulation and unitary implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Dominic W. Berry","submitted_at":"2009-10-22T19:55:15Z","abstract_excerpt":"We present general methods for simulating black-box Hamiltonians using quantum walks. These techniques have two main applications: simulating sparse Hamiltonians and implementing black-box unitary operations. In particular, we give the best known simulation of sparse Hamiltonians with constant precision. Our method has complexity linear in both the sparseness D (the maximum number of nonzero elements in a column) and the evolution time t, whereas previous methods had complexity scaling as D^4 and were superlinear in t. We also consider the task of implementing an arbitrary unitary operation gi"},"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":"0910.4157","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-10-22T19:55:15Z","cross_cats_sorted":[],"title_canon_sha256":"1db121695bd7993c32e409ee9a01b610f3ef627a6c7a5080fdb3a56fa36d9641","abstract_canon_sha256":"a5e7d76b7f69dbce65396cd7bba3d8538a2acd778459c53d7661ef99c8005d80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:10.688720Z","signature_b64":"M4upOku+CwxtyuoH6F2PRGYzh6S771pPpLNde8bB836kmi9/oPbDls3xO6G8xgUfTvaJY4jfYCBs68tIP8gPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0f8c07368db371fa61d1fa42cd38caf8538927a96769b1dc1554059bf52096e","last_reissued_at":"2026-05-18T00:09:10.688122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:10.688122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Black-box Hamiltonian simulation and unitary implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Dominic W. Berry","submitted_at":"2009-10-22T19:55:15Z","abstract_excerpt":"We present general methods for simulating black-box Hamiltonians using quantum walks. These techniques have two main applications: simulating sparse Hamiltonians and implementing black-box unitary operations. In particular, we give the best known simulation of sparse Hamiltonians with constant precision. Our method has complexity linear in both the sparseness D (the maximum number of nonzero elements in a column) and the evolution time t, whereas previous methods had complexity scaling as D^4 and were superlinear in t. We also consider the task of implementing an arbitrary unitary operation gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.4157","kind":"arxiv","version":4},"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":"0910.4157","created_at":"2026-05-18T00:09:10.688222+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.4157v4","created_at":"2026-05-18T00:09:10.688222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.4157","created_at":"2026-05-18T00:09:10.688222+00:00"},{"alias_kind":"pith_short_12","alias_value":"WD4MA43I3M3R","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"WD4MA43I3M3R7JQ5","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"WD4MA43I","created_at":"2026-05-18T12:26:02.257875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.06949","citing_title":"Quantum Data Fitting Algorithm for Non-sparse Matrices","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":214,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WD4MA43I3M3R7JQ5D6SCZU4MV6","json":"https://pith.science/pith/WD4MA43I3M3R7JQ5D6SCZU4MV6.json","graph_json":"https://pith.science/api/pith-number/WD4MA43I3M3R7JQ5D6SCZU4MV6/graph.json","events_json":"https://pith.science/api/pith-number/WD4MA43I3M3R7JQ5D6SCZU4MV6/events.json","paper":"https://pith.science/paper/WD4MA43I"},"agent_actions":{"view_html":"https://pith.science/pith/WD4MA43I3M3R7JQ5D6SCZU4MV6","download_json":"https://pith.science/pith/WD4MA43I3M3R7JQ5D6SCZU4MV6.json","view_paper":"https://pith.science/paper/WD4MA43I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.4157&json=true","fetch_graph":"https://pith.science/api/pith-number/WD4MA43I3M3R7JQ5D6SCZU4MV6/graph.json","fetch_events":"https://pith.science/api/pith-number/WD4MA43I3M3R7JQ5D6SCZU4MV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WD4MA43I3M3R7JQ5D6SCZU4MV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WD4MA43I3M3R7JQ5D6SCZU4MV6/action/storage_attestation","attest_author":"https://pith.science/pith/WD4MA43I3M3R7JQ5D6SCZU4MV6/action/author_attestation","sign_citation":"https://pith.science/pith/WD4MA43I3M3R7JQ5D6SCZU4MV6/action/citation_signature","submit_replication":"https://pith.science/pith/WD4MA43I3M3R7JQ5D6SCZU4MV6/action/replication_record"}},"created_at":"2026-05-18T00:09:10.688222+00:00","updated_at":"2026-05-18T00:09:10.688222+00:00"}