{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ADXMZHKF7KWERYBCBTNLKN6V6F","short_pith_number":"pith:ADXMZHKF","schema_version":"1.0","canonical_sha256":"00eecc9d45faac48e0220cdab537d5f1657d21d9bb6c2ab219a5ebe6ad5e32ad","source":{"kind":"arxiv","id":"2608.06094","version":1},"attestation_state":"computed","paper":{"title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Boyang Chen, Minbo Gao, Shuo Zhou, Xinzhao Wang","submitted_at":"2026-08-06T14:35:47Z","abstract_excerpt":"We give a query-optimal algorithm for simulating a general $n$-qubit time-dependent Hamiltonian $H(t)$ on $[0,T]$, assuming that $H$ is Lipschitz continuous and $\\|H(t)\\|\\leq\\alpha$. In the standard $\\mathrm{HAM\\mbox{-}T}$ access model, the algorithm approximates the time-ordered propagator $U_H(T)$ to error $\\varepsilon$ using $$ O\\left(\n  \\alpha T+\\frac{\\log(1/\\varepsilon)}\n  {\\log(e+\\log(1/\\varepsilon)/(\\alpha T))}\n  \\right) $$ $\\mathrm{HAM\\mbox{-}T}$ queries. This matches the known query lower bound for time-independent Hamiltonians, showing that time dependence incurs no asymptotic query "},"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":"2608.06094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-06T14:35:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9a9931a1fda2ac25569da97c75937a510379b5f59e4054637bb2409c7a2fa723","abstract_canon_sha256":"8d8232267979fbc752cedc2cd078de86b7b8248d437829e0e40fcdd7980763ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T01:40:31.441083Z","signature_b64":"YXkSzVsMDVE+XXu/vSIJ1g1LCJkHyBnfx7G/FCTlydDnz8Ya5gIwAwIVCIk/wWIGgDYSomoobKoGBcRB8LGzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00eecc9d45faac48e0220cdab537d5f1657d21d9bb6c2ab219a5ebe6ad5e32ad","last_reissued_at":"2026-08-07T01:40:31.439503Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T01:40:31.439503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Boyang Chen, Minbo Gao, Shuo Zhou, Xinzhao Wang","submitted_at":"2026-08-06T14:35:47Z","abstract_excerpt":"We give a query-optimal algorithm for simulating a general $n$-qubit time-dependent Hamiltonian $H(t)$ on $[0,T]$, assuming that $H$ is Lipschitz continuous and $\\|H(t)\\|\\leq\\alpha$. In the standard $\\mathrm{HAM\\mbox{-}T}$ access model, the algorithm approximates the time-ordered propagator $U_H(T)$ to error $\\varepsilon$ using $$ O\\left(\n  \\alpha T+\\frac{\\log(1/\\varepsilon)}\n  {\\log(e+\\log(1/\\varepsilon)/(\\alpha T))}\n  \\right) $$ $\\mathrm{HAM\\mbox{-}T}$ queries. This matches the known query lower bound for time-independent Hamiltonians, showing that time dependence incurs no asymptotic query "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06094","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/2608.06094/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":"2608.06094","created_at":"2026-08-07T01:40:31.442053+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.06094v1","created_at":"2026-08-07T01:40:31.442053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06094","created_at":"2026-08-07T01:40:31.442053+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADXMZHKF7KWE","created_at":"2026-08-07T01:40:31.442053+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADXMZHKF7KWERYBC","created_at":"2026-08-07T01:40:31.442053+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADXMZHKF","created_at":"2026-08-07T01:40:31.442053+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/ADXMZHKF7KWERYBCBTNLKN6V6F","json":"https://pith.science/pith/ADXMZHKF7KWERYBCBTNLKN6V6F.json","graph_json":"https://pith.science/api/pith-number/ADXMZHKF7KWERYBCBTNLKN6V6F/graph.json","events_json":"https://pith.science/api/pith-number/ADXMZHKF7KWERYBCBTNLKN6V6F/events.json","paper":"https://pith.science/paper/ADXMZHKF"},"agent_actions":{"view_html":"https://pith.science/pith/ADXMZHKF7KWERYBCBTNLKN6V6F","download_json":"https://pith.science/pith/ADXMZHKF7KWERYBCBTNLKN6V6F.json","view_paper":"https://pith.science/paper/ADXMZHKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.06094&json=true","fetch_graph":"https://pith.science/api/pith-number/ADXMZHKF7KWERYBCBTNLKN6V6F/graph.json","fetch_events":"https://pith.science/api/pith-number/ADXMZHKF7KWERYBCBTNLKN6V6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADXMZHKF7KWERYBCBTNLKN6V6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADXMZHKF7KWERYBCBTNLKN6V6F/action/storage_attestation","attest_author":"https://pith.science/pith/ADXMZHKF7KWERYBCBTNLKN6V6F/action/author_attestation","sign_citation":"https://pith.science/pith/ADXMZHKF7KWERYBCBTNLKN6V6F/action/citation_signature","submit_replication":"https://pith.science/pith/ADXMZHKF7KWERYBCBTNLKN6V6F/action/replication_record"}},"created_at":"2026-08-07T01:40:31.442053+00:00","updated_at":"2026-08-07T01:40:31.442053+00:00"}