{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WA2BNMG2HW27JUOY33ABDRTGA5","short_pith_number":"pith:WA2BNMG2","schema_version":"1.0","canonical_sha256":"b03416b0da3db5f4d1d8dec011c6660755d69b06ba103e273512625c669b7bc5","source":{"kind":"arxiv","id":"2504.21564","version":2},"attestation_state":"computed","paper":{"title":"Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Kushagra Garg, Shantanav Chakraborty, Subhadip Mitra, Zeeshan Ahmed","submitted_at":"2025-04-30T12:09:54Z","abstract_excerpt":"We develop randomized quantum algorithms to simulate quantum collision models, also known as repeated interaction schemes, which provide a rich framework to model various open-system dynamics. The underlying technique involves composing time evolutions of the total (system, bath, and interaction) Hamiltonian and intermittent tracing out of the environment degrees of freedom. This results in a unified framework where any near-term Hamiltonian simulation algorithm can be incorporated to implement an arbitrary number of such collisions on early fault-tolerant quantum computers: we do not assume a"},"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":"2504.21564","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-30T12:09:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac6605769709225e80e9bf5300d2b7a43f8627b231139b8c0c47835eaef7275d","abstract_canon_sha256":"0505ec02d53ef34642e6f22cf4bab10a2977443ad621f389f3d18ad3497aad14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:03.433175Z","signature_b64":"IjbnQr8+2K7kch/9UpVxMRprE9lSas1F8CzyAyQ2ofnVzg0dAS00wyR+RWwFuXmEUEKgelvz91EEZWz0O4hnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b03416b0da3db5f4d1d8dec011c6660755d69b06ba103e273512625c669b7bc5","last_reissued_at":"2026-07-05T11:56:03.432701Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:03.432701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Kushagra Garg, Shantanav Chakraborty, Subhadip Mitra, Zeeshan Ahmed","submitted_at":"2025-04-30T12:09:54Z","abstract_excerpt":"We develop randomized quantum algorithms to simulate quantum collision models, also known as repeated interaction schemes, which provide a rich framework to model various open-system dynamics. The underlying technique involves composing time evolutions of the total (system, bath, and interaction) Hamiltonian and intermittent tracing out of the environment degrees of freedom. This results in a unified framework where any near-term Hamiltonian simulation algorithm can be incorporated to implement an arbitrary number of such collisions on early fault-tolerant quantum computers: we do not assume a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21564","kind":"arxiv","version":2},"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/2504.21564/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":"2504.21564","created_at":"2026-07-05T11:56:03.432762+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.21564v2","created_at":"2026-07-05T11:56:03.432762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21564","created_at":"2026-07-05T11:56:03.432762+00:00"},{"alias_kind":"pith_short_12","alias_value":"WA2BNMG2HW27","created_at":"2026-07-05T11:56:03.432762+00:00"},{"alias_kind":"pith_short_16","alias_value":"WA2BNMG2HW27JUOY","created_at":"2026-07-05T11:56:03.432762+00:00"},{"alias_kind":"pith_short_8","alias_value":"WA2BNMG2","created_at":"2026-07-05T11:56:03.432762+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/WA2BNMG2HW27JUOY33ABDRTGA5","json":"https://pith.science/pith/WA2BNMG2HW27JUOY33ABDRTGA5.json","graph_json":"https://pith.science/api/pith-number/WA2BNMG2HW27JUOY33ABDRTGA5/graph.json","events_json":"https://pith.science/api/pith-number/WA2BNMG2HW27JUOY33ABDRTGA5/events.json","paper":"https://pith.science/paper/WA2BNMG2"},"agent_actions":{"view_html":"https://pith.science/pith/WA2BNMG2HW27JUOY33ABDRTGA5","download_json":"https://pith.science/pith/WA2BNMG2HW27JUOY33ABDRTGA5.json","view_paper":"https://pith.science/paper/WA2BNMG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.21564&json=true","fetch_graph":"https://pith.science/api/pith-number/WA2BNMG2HW27JUOY33ABDRTGA5/graph.json","fetch_events":"https://pith.science/api/pith-number/WA2BNMG2HW27JUOY33ABDRTGA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WA2BNMG2HW27JUOY33ABDRTGA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WA2BNMG2HW27JUOY33ABDRTGA5/action/storage_attestation","attest_author":"https://pith.science/pith/WA2BNMG2HW27JUOY33ABDRTGA5/action/author_attestation","sign_citation":"https://pith.science/pith/WA2BNMG2HW27JUOY33ABDRTGA5/action/citation_signature","submit_replication":"https://pith.science/pith/WA2BNMG2HW27JUOY33ABDRTGA5/action/replication_record"}},"created_at":"2026-07-05T11:56:03.432762+00:00","updated_at":"2026-07-05T11:56:03.432762+00:00"}