{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JUDCN7ZVST5EE3FIYCBYBOOJCR","short_pith_number":"pith:JUDCN7ZV","schema_version":"1.0","canonical_sha256":"4d0626ff3594fa426ca8c08380b9c91465add71f732f67d21f746ccc4fb97a4e","source":{"kind":"arxiv","id":"2302.14811","version":2},"attestation_state":"computed","paper":{"title":"qSWIFT: High-order randomized compiler for Hamiltonian simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alan Aspuru-Guzik, Kouhei Nakaji, Mohsen Bagherimehrab","submitted_at":"2023-02-28T18:02:39Z","abstract_excerpt":"Hamiltonian simulation is known to be one of the fundamental building blocks of a variety of quantum algorithms such as its most immediate application, that of simulating many-body systems to extract their physical properties. In this work, we present qSWIFT, a high-order randomized algorithm for Hamiltonian simulation. In qSWIFT, the required number of gates for a given precision is independent of the number of terms in Hamiltonian, while the systematic error is exponentially reduced with regards to the order parameter. In this respect, our qSWIFT is a higher-order counterpart of the previous"},"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":"2302.14811","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-02-28T18:02:39Z","cross_cats_sorted":[],"title_canon_sha256":"7430f5d3915e982e346c55d4b3eb5a13ebd61f1949b9fa8b536e80f5090e9241","abstract_canon_sha256":"5b311623d6728ac36c9057f653985dc7ef180917c0e727f3fa8e0dc9191ecc33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:02.357293Z","signature_b64":"MBggR1f8/4BGlb0YoxYOjCDiwvNlBgWs9WKc9ZwBRXgiOZiqqlGF4nPMvn/t12yOZB18f1DiFIv0aVh8MVuNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d0626ff3594fa426ca8c08380b9c91465add71f732f67d21f746ccc4fb97a4e","last_reissued_at":"2026-07-05T08:34:02.356789Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:02.356789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"qSWIFT: High-order randomized compiler for Hamiltonian simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alan Aspuru-Guzik, Kouhei Nakaji, Mohsen Bagherimehrab","submitted_at":"2023-02-28T18:02:39Z","abstract_excerpt":"Hamiltonian simulation is known to be one of the fundamental building blocks of a variety of quantum algorithms such as its most immediate application, that of simulating many-body systems to extract their physical properties. In this work, we present qSWIFT, a high-order randomized algorithm for Hamiltonian simulation. In qSWIFT, the required number of gates for a given precision is independent of the number of terms in Hamiltonian, while the systematic error is exponentially reduced with regards to the order parameter. In this respect, our qSWIFT is a higher-order counterpart of the previous"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.14811","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/2302.14811/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":"2302.14811","created_at":"2026-07-05T08:34:02.356872+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.14811v2","created_at":"2026-07-05T08:34:02.356872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.14811","created_at":"2026-07-05T08:34:02.356872+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUDCN7ZVST5E","created_at":"2026-07-05T08:34:02.356872+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUDCN7ZVST5EE3FI","created_at":"2026-07-05T08:34:02.356872+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUDCN7ZV","created_at":"2026-07-05T08:34:02.356872+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06557","citing_title":"Quantum Channel Polynomial Processing","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2606.11759","citing_title":"Random Grover Search","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29741","citing_title":"Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02854","citing_title":"Continuous-time evolution via probabilistic angle interpolation and its applications","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JUDCN7ZVST5EE3FIYCBYBOOJCR","json":"https://pith.science/pith/JUDCN7ZVST5EE3FIYCBYBOOJCR.json","graph_json":"https://pith.science/api/pith-number/JUDCN7ZVST5EE3FIYCBYBOOJCR/graph.json","events_json":"https://pith.science/api/pith-number/JUDCN7ZVST5EE3FIYCBYBOOJCR/events.json","paper":"https://pith.science/paper/JUDCN7ZV"},"agent_actions":{"view_html":"https://pith.science/pith/JUDCN7ZVST5EE3FIYCBYBOOJCR","download_json":"https://pith.science/pith/JUDCN7ZVST5EE3FIYCBYBOOJCR.json","view_paper":"https://pith.science/paper/JUDCN7ZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.14811&json=true","fetch_graph":"https://pith.science/api/pith-number/JUDCN7ZVST5EE3FIYCBYBOOJCR/graph.json","fetch_events":"https://pith.science/api/pith-number/JUDCN7ZVST5EE3FIYCBYBOOJCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUDCN7ZVST5EE3FIYCBYBOOJCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUDCN7ZVST5EE3FIYCBYBOOJCR/action/storage_attestation","attest_author":"https://pith.science/pith/JUDCN7ZVST5EE3FIYCBYBOOJCR/action/author_attestation","sign_citation":"https://pith.science/pith/JUDCN7ZVST5EE3FIYCBYBOOJCR/action/citation_signature","submit_replication":"https://pith.science/pith/JUDCN7ZVST5EE3FIYCBYBOOJCR/action/replication_record"}},"created_at":"2026-07-05T08:34:02.356872+00:00","updated_at":"2026-07-05T08:34:02.356872+00:00"}