{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VFFINFV6CTGRDEV42UNUOUWKCN","short_pith_number":"pith:VFFINFV6","schema_version":"1.0","canonical_sha256":"a94a8696be14cd1192bcd51b4752ca13588645eb74d841812a13750cadd1ea73","source":{"kind":"arxiv","id":"2305.12444","version":1},"attestation_state":"computed","paper":{"title":"On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Han-Hsuan Lin, Kai-Min Chung, Nai-Hui Chia, Yao-Ching Hsieh, Yao-Ting Lin, Yu-Ching Shen","submitted_at":"2023-05-21T12:30:00Z","abstract_excerpt":"Hamiltonian simulation is one of the most important problems in the field of quantum computing. There have been extended efforts on designing algorithms for faster simulation, and the evolution time $T$ for the simulation turns out to largely affect algorithm runtime. While there are some specific types of Hamiltonians that can be fast-forwarded, i.e., simulated within time $o(T)$, for large enough classes of Hamiltonians (e.g., all local/sparse Hamiltonians), existing simulation algorithms require running time at least linear in the evolution time $T$. On the other hand, while there exist low"},"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":"2305.12444","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-21T12:30:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6e2743fc9f03a446532732bc8761c69196e84dccc8f225455683c4e6bcbebdf3","abstract_canon_sha256":"9bff2507297709c7d407fad26a3f8572d7b8c9aca3a79cba17e0cd046874bf4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:12:10.615759Z","signature_b64":"k1NwnouRDYmoj/VVZuN84QgRsJTFuJMffIpkTSIe3JghwpYs9gdHxMbGjtx+Fm8/7mAdSdD5iCGpAW95axVmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a94a8696be14cd1192bcd51b4752ca13588645eb74d841812a13750cadd1ea73","last_reissued_at":"2026-07-05T06:12:10.615300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:12:10.615300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Han-Hsuan Lin, Kai-Min Chung, Nai-Hui Chia, Yao-Ching Hsieh, Yao-Ting Lin, Yu-Ching Shen","submitted_at":"2023-05-21T12:30:00Z","abstract_excerpt":"Hamiltonian simulation is one of the most important problems in the field of quantum computing. There have been extended efforts on designing algorithms for faster simulation, and the evolution time $T$ for the simulation turns out to largely affect algorithm runtime. While there are some specific types of Hamiltonians that can be fast-forwarded, i.e., simulated within time $o(T)$, for large enough classes of Hamiltonians (e.g., all local/sparse Hamiltonians), existing simulation algorithms require running time at least linear in the evolution time $T$. On the other hand, while there exist low"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12444","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/2305.12444/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":"2305.12444","created_at":"2026-07-05T06:12:10.615382+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.12444v1","created_at":"2026-07-05T06:12:10.615382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12444","created_at":"2026-07-05T06:12:10.615382+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFFINFV6CTGR","created_at":"2026-07-05T06:12:10.615382+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFFINFV6CTGRDEV4","created_at":"2026-07-05T06:12:10.615382+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFFINFV6","created_at":"2026-07-05T06:12:10.615382+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/VFFINFV6CTGRDEV42UNUOUWKCN","json":"https://pith.science/pith/VFFINFV6CTGRDEV42UNUOUWKCN.json","graph_json":"https://pith.science/api/pith-number/VFFINFV6CTGRDEV42UNUOUWKCN/graph.json","events_json":"https://pith.science/api/pith-number/VFFINFV6CTGRDEV42UNUOUWKCN/events.json","paper":"https://pith.science/paper/VFFINFV6"},"agent_actions":{"view_html":"https://pith.science/pith/VFFINFV6CTGRDEV42UNUOUWKCN","download_json":"https://pith.science/pith/VFFINFV6CTGRDEV42UNUOUWKCN.json","view_paper":"https://pith.science/paper/VFFINFV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.12444&json=true","fetch_graph":"https://pith.science/api/pith-number/VFFINFV6CTGRDEV42UNUOUWKCN/graph.json","fetch_events":"https://pith.science/api/pith-number/VFFINFV6CTGRDEV42UNUOUWKCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFFINFV6CTGRDEV42UNUOUWKCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFFINFV6CTGRDEV42UNUOUWKCN/action/storage_attestation","attest_author":"https://pith.science/pith/VFFINFV6CTGRDEV42UNUOUWKCN/action/author_attestation","sign_citation":"https://pith.science/pith/VFFINFV6CTGRDEV42UNUOUWKCN/action/citation_signature","submit_replication":"https://pith.science/pith/VFFINFV6CTGRDEV42UNUOUWKCN/action/replication_record"}},"created_at":"2026-07-05T06:12:10.615382+00:00","updated_at":"2026-07-05T06:12:10.615382+00:00"}