{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LFFRYEOWGJSNMULC3KTUEJCHOF","short_pith_number":"pith:LFFRYEOW","schema_version":"1.0","canonical_sha256":"594b1c11d63264d65162daa7422447716b25e9972d79d721e287c6361f283a82","source":{"kind":"arxiv","id":"2602.21145","version":2},"attestation_state":"computed","paper":{"title":"Reducing the Gate Count with Efficient Trotter-Suzuki Schemes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-lat","authors_text":"Johann Ostmeyer, Marko Male\\v{z}i\\v{c}","submitted_at":"2026-02-24T17:48:26Z","abstract_excerpt":"Hamiltonian formulations of lattice field theories provide access to real-time dynamics, but their simulation is difficult to implement efficiently. Trotter-Suzuki decompositions are at the center of time evolution computation, either on quantum hardware or classically, for instance with the use of tensor networks. While low-order Trotterizations remain the standard choice due to their simplicity, higher-order schemes offer the potential for improved efficiency. In this work we outline a short guide to Trotter-Suzuki schemes and their implementations in general. To help with this, we highlight"},"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":"2602.21145","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"hep-lat","submitted_at":"2026-02-24T17:48:26Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"6d0860136b1908479f3f3fbe7ee0878b2633d8d436f1b5fdbc157032d445d6eb","abstract_canon_sha256":"5841e6f32f06c4e71f599c06a59a19f304115085509fdea01bb4a51144c91d6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"594b1c11d63264d65162daa7422447716b25e9972d79d721e287c6361f283a82","last_reissued_at":"2026-07-31T01:33:17.367831Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:33:17.367831Z"},"graph_snapshot":{"paper":{"title":"Reducing the Gate Count with Efficient Trotter-Suzuki Schemes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-lat","authors_text":"Johann Ostmeyer, Marko Male\\v{z}i\\v{c}","submitted_at":"2026-02-24T17:48:26Z","abstract_excerpt":"Hamiltonian formulations of lattice field theories provide access to real-time dynamics, but their simulation is difficult to implement efficiently. Trotter-Suzuki decompositions are at the center of time evolution computation, either on quantum hardware or classically, for instance with the use of tensor networks. While low-order Trotterizations remain the standard choice due to their simplicity, higher-order schemes offer the potential for improved efficiency. In this work we outline a short guide to Trotter-Suzuki schemes and their implementations in general. To help with this, we highlight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.21145","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/2602.21145/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":"2602.21145","created_at":"2026-07-31T01:33:17.370863+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.21145v2","created_at":"2026-07-31T01:33:17.370863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.21145","created_at":"2026-07-31T01:33:17.370863+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFFRYEOWGJSN","created_at":"2026-07-31T01:33:17.370863+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFFRYEOWGJSNMULC","created_at":"2026-07-31T01:33:17.370863+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFFRYEOW","created_at":"2026-07-31T01:33:17.370863+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/LFFRYEOWGJSNMULC3KTUEJCHOF","json":"https://pith.science/pith/LFFRYEOWGJSNMULC3KTUEJCHOF.json","graph_json":"https://pith.science/api/pith-number/LFFRYEOWGJSNMULC3KTUEJCHOF/graph.json","events_json":"https://pith.science/api/pith-number/LFFRYEOWGJSNMULC3KTUEJCHOF/events.json","paper":"https://pith.science/paper/LFFRYEOW"},"agent_actions":{"view_html":"https://pith.science/pith/LFFRYEOWGJSNMULC3KTUEJCHOF","download_json":"https://pith.science/pith/LFFRYEOWGJSNMULC3KTUEJCHOF.json","view_paper":"https://pith.science/paper/LFFRYEOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.21145&json=true","fetch_graph":"https://pith.science/api/pith-number/LFFRYEOWGJSNMULC3KTUEJCHOF/graph.json","fetch_events":"https://pith.science/api/pith-number/LFFRYEOWGJSNMULC3KTUEJCHOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFFRYEOWGJSNMULC3KTUEJCHOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFFRYEOWGJSNMULC3KTUEJCHOF/action/storage_attestation","attest_author":"https://pith.science/pith/LFFRYEOWGJSNMULC3KTUEJCHOF/action/author_attestation","sign_citation":"https://pith.science/pith/LFFRYEOWGJSNMULC3KTUEJCHOF/action/citation_signature","submit_replication":"https://pith.science/pith/LFFRYEOWGJSNMULC3KTUEJCHOF/action/replication_record"}},"created_at":"2026-07-31T01:33:17.370863+00:00","updated_at":"2026-07-31T01:33:17.370863+00:00"}