{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6HZE7F54Z6VDYDDEPOP6SESZB2","short_pith_number":"pith:6HZE7F54","schema_version":"1.0","canonical_sha256":"f1f24f97bccfaa3c0c647b9fe912590e82edf952dff9c665ef4f37cd153a8ab8","source":{"kind":"arxiv","id":"2607.19852","version":1},"attestation_state":"computed","paper":{"title":"Optimal Lower Bounds for Hamiltonian Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Zlokapa, Aram W. Harrow, Richard R. Allen","submitted_at":"2026-07-22T07:41:32Z","abstract_excerpt":"For Hamiltonian $H = \\sum_j h_j$, we prove asymptotically tight lower bounds on the gate and query complexities of simulating time evolution on a quantum computer. Our bounds hold for arbitrary term norms $\\|h_j\\|$, time $t$, and trace-distance error $\\epsilon$. The matching upper bound (known as composite qDRIFT) consists of high-order Trotterization of the large terms and a randomized first-order Trotterization of the small terms. Unlike prior work that chooses worst-case $\\|h_j\\|$ to encode the computation of parity or other Boolean functions in time evolution, our proof is elementary and b"},"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":"2607.19852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-22T07:41:32Z","cross_cats_sorted":[],"title_canon_sha256":"7de7cfdedfe39de045bd2e6aa46f06b02875b859c7fbe2076d46257f55af5acd","abstract_canon_sha256":"a97e20aab017ecf3ba17e113e3fe1927573d7f70f0ae3e7b2ec6f8893213e0e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:24:03.676836Z","signature_b64":"iFnMfNvHykC9Ui8ZIdTHVk1gKEAd/gM16i3RDLCAPFt4Yu5rqFY8auxZzaKWcG8AaEqidrTlb8f43d1tY71sAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1f24f97bccfaa3c0c647b9fe912590e82edf952dff9c665ef4f37cd153a8ab8","last_reissued_at":"2026-07-23T01:24:03.676014Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:24:03.676014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Lower Bounds for Hamiltonian Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Zlokapa, Aram W. Harrow, Richard R. Allen","submitted_at":"2026-07-22T07:41:32Z","abstract_excerpt":"For Hamiltonian $H = \\sum_j h_j$, we prove asymptotically tight lower bounds on the gate and query complexities of simulating time evolution on a quantum computer. Our bounds hold for arbitrary term norms $\\|h_j\\|$, time $t$, and trace-distance error $\\epsilon$. The matching upper bound (known as composite qDRIFT) consists of high-order Trotterization of the large terms and a randomized first-order Trotterization of the small terms. Unlike prior work that chooses worst-case $\\|h_j\\|$ to encode the computation of parity or other Boolean functions in time evolution, our proof is elementary and b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19852","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.19852/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":"2607.19852","created_at":"2026-07-23T01:24:03.676438+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.19852v1","created_at":"2026-07-23T01:24:03.676438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19852","created_at":"2026-07-23T01:24:03.676438+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HZE7F54Z6VD","created_at":"2026-07-23T01:24:03.676438+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HZE7F54Z6VDYDDE","created_at":"2026-07-23T01:24:03.676438+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HZE7F54","created_at":"2026-07-23T01:24:03.676438+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/6HZE7F54Z6VDYDDEPOP6SESZB2","json":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2.json","graph_json":"https://pith.science/api/pith-number/6HZE7F54Z6VDYDDEPOP6SESZB2/graph.json","events_json":"https://pith.science/api/pith-number/6HZE7F54Z6VDYDDEPOP6SESZB2/events.json","paper":"https://pith.science/paper/6HZE7F54"},"agent_actions":{"view_html":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2","download_json":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2.json","view_paper":"https://pith.science/paper/6HZE7F54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.19852&json=true","fetch_graph":"https://pith.science/api/pith-number/6HZE7F54Z6VDYDDEPOP6SESZB2/graph.json","fetch_events":"https://pith.science/api/pith-number/6HZE7F54Z6VDYDDEPOP6SESZB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/action/storage_attestation","attest_author":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/action/author_attestation","sign_citation":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/action/citation_signature","submit_replication":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/action/replication_record"}},"created_at":"2026-07-23T01:24:03.676438+00:00","updated_at":"2026-07-23T01:24:03.676438+00:00"}