{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VBUFRCPBG3FDYLRBX4BYYZ3JXF","short_pith_number":"pith:VBUFRCPB","schema_version":"1.0","canonical_sha256":"a8685889e136ca3c2e21bf038c6769b950e8185c68ee9b4dcf8db4d88f1c3bcd","source":{"kind":"arxiv","id":"2509.00171","version":1},"attestation_state":"computed","paper":{"title":"Large time-step discretisation of adiabatic quantum dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Dominic W. Berry, Dong An, Pedro C. S. Costa","submitted_at":"2025-08-29T18:12:48Z","abstract_excerpt":"Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra computational overhead or complicated quantum control logic. In this work, we show that the time step sizes in time discretization can be much larger than expected, and the overall complexity is greatly reduced. Remarkably, regardless of the general convergence order of the numerical method, we can choose a uniform time step size independent of tolerated error and e"},"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":"2509.00171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-29T18:12:48Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"8b77cb2a5a9c9f25e1eace067b7fdcb011c48181240117b85edad47554777a90","abstract_canon_sha256":"a093b01df4454e9e432815afa15d5ee599f2712b1f3436eacbe037fc5d3e311b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:10.650543Z","signature_b64":"hyWvVvjHHNCHHgYRYsX0cW5U1zXTS0eA0gkPiAWjNItJr28hjIqgvIBpDaj6+tKepISUtadARLzsN+brGB/DDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8685889e136ca3c2e21bf038c6769b950e8185c68ee9b4dcf8db4d88f1c3bcd","last_reissued_at":"2026-07-05T12:02:10.650018Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:10.650018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large time-step discretisation of adiabatic quantum dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Dominic W. Berry, Dong An, Pedro C. S. Costa","submitted_at":"2025-08-29T18:12:48Z","abstract_excerpt":"Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra computational overhead or complicated quantum control logic. In this work, we show that the time step sizes in time discretization can be much larger than expected, and the overall complexity is greatly reduced. Remarkably, regardless of the general convergence order of the numerical method, we can choose a uniform time step size independent of tolerated error and e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00171","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/2509.00171/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":"2509.00171","created_at":"2026-07-05T12:02:10.650077+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.00171v1","created_at":"2026-07-05T12:02:10.650077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00171","created_at":"2026-07-05T12:02:10.650077+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBUFRCPBG3FD","created_at":"2026-07-05T12:02:10.650077+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBUFRCPBG3FDYLRB","created_at":"2026-07-05T12:02:10.650077+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBUFRCPB","created_at":"2026-07-05T12:02:10.650077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.28599","citing_title":"Thermodynamic-limit dispersion relations on trapped-ion quantum hardware","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30110","citing_title":"Alternative adiabatic quantum dynamics with algorithmic applications","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBUFRCPBG3FDYLRBX4BYYZ3JXF","json":"https://pith.science/pith/VBUFRCPBG3FDYLRBX4BYYZ3JXF.json","graph_json":"https://pith.science/api/pith-number/VBUFRCPBG3FDYLRBX4BYYZ3JXF/graph.json","events_json":"https://pith.science/api/pith-number/VBUFRCPBG3FDYLRBX4BYYZ3JXF/events.json","paper":"https://pith.science/paper/VBUFRCPB"},"agent_actions":{"view_html":"https://pith.science/pith/VBUFRCPBG3FDYLRBX4BYYZ3JXF","download_json":"https://pith.science/pith/VBUFRCPBG3FDYLRBX4BYYZ3JXF.json","view_paper":"https://pith.science/paper/VBUFRCPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.00171&json=true","fetch_graph":"https://pith.science/api/pith-number/VBUFRCPBG3FDYLRBX4BYYZ3JXF/graph.json","fetch_events":"https://pith.science/api/pith-number/VBUFRCPBG3FDYLRBX4BYYZ3JXF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBUFRCPBG3FDYLRBX4BYYZ3JXF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBUFRCPBG3FDYLRBX4BYYZ3JXF/action/storage_attestation","attest_author":"https://pith.science/pith/VBUFRCPBG3FDYLRBX4BYYZ3JXF/action/author_attestation","sign_citation":"https://pith.science/pith/VBUFRCPBG3FDYLRBX4BYYZ3JXF/action/citation_signature","submit_replication":"https://pith.science/pith/VBUFRCPBG3FDYLRBX4BYYZ3JXF/action/replication_record"}},"created_at":"2026-07-05T12:02:10.650077+00:00","updated_at":"2026-07-05T12:02:10.650077+00:00"}