{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EID5AUNGWYQICZKH7I2WLEK3IO","short_pith_number":"pith:EID5AUNG","schema_version":"1.0","canonical_sha256":"2207d051a6b620816547fa3565915b438310d61ae97ae53ce31366a39af387c3","source":{"kind":"arxiv","id":"1808.03623","version":1},"attestation_state":"computed","paper":{"title":"Mitigating algorithmic errors in Hamiltonian simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Qi Zhao, Simon Benjamin, Suguru Endo, Xiao Yuan, Ying Li","submitted_at":"2018-08-10T16:59:51Z","abstract_excerpt":"Quantum computers can efficiently simulate many-body systems. As a widely used Hamiltonian simulation tool, the Trotter-Suzuki scheme splits the evolution into the number of Trotter steps $N$ and approximates the evolution of each step by a product of exponentials of each individual term of the total Hamiltonian. The algorithmic error due to the approximation can be reduced by increasing $N$, which however requires a longer circuit and hence inevitably introduces more physical errors. In this work, we first study such a trade-off and numerically find the optimal number of Trotter steps $N_{\\te"},"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":"1808.03623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-08-10T16:59:51Z","cross_cats_sorted":[],"title_canon_sha256":"0c69739420fdf536447c42e995c5b084655cd39809cb38062a183fc61fef12f1","abstract_canon_sha256":"605b4dc60b21a5b799818a49b01d6c77a05057fd38850f8d84e23fc0a91bdc07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:55.646702Z","signature_b64":"i6r38xD0uFDVnrqfQv9G0gKJiGkmoavnyPovkm3iGcCdwXeiMrlZKMrdk3sXC7x8wMMFBnZpVhK/L4Ft+YI9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2207d051a6b620816547fa3565915b438310d61ae97ae53ce31366a39af387c3","last_reissued_at":"2026-05-17T23:55:55.646053Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:55.646053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mitigating algorithmic errors in Hamiltonian simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Qi Zhao, Simon Benjamin, Suguru Endo, Xiao Yuan, Ying Li","submitted_at":"2018-08-10T16:59:51Z","abstract_excerpt":"Quantum computers can efficiently simulate many-body systems. As a widely used Hamiltonian simulation tool, the Trotter-Suzuki scheme splits the evolution into the number of Trotter steps $N$ and approximates the evolution of each step by a product of exponentials of each individual term of the total Hamiltonian. The algorithmic error due to the approximation can be reduced by increasing $N$, which however requires a longer circuit and hence inevitably introduces more physical errors. In this work, we first study such a trade-off and numerically find the optimal number of Trotter steps $N_{\\te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03623","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":""},"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":"1808.03623","created_at":"2026-05-17T23:55:55.646155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03623v1","created_at":"2026-05-17T23:55:55.646155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03623","created_at":"2026-05-17T23:55:55.646155+00:00"},{"alias_kind":"pith_short_12","alias_value":"EID5AUNGWYQI","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EID5AUNGWYQICZKH","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EID5AUNG","created_at":"2026-05-18T12:32:22.470017+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/EID5AUNGWYQICZKH7I2WLEK3IO","json":"https://pith.science/pith/EID5AUNGWYQICZKH7I2WLEK3IO.json","graph_json":"https://pith.science/api/pith-number/EID5AUNGWYQICZKH7I2WLEK3IO/graph.json","events_json":"https://pith.science/api/pith-number/EID5AUNGWYQICZKH7I2WLEK3IO/events.json","paper":"https://pith.science/paper/EID5AUNG"},"agent_actions":{"view_html":"https://pith.science/pith/EID5AUNGWYQICZKH7I2WLEK3IO","download_json":"https://pith.science/pith/EID5AUNGWYQICZKH7I2WLEK3IO.json","view_paper":"https://pith.science/paper/EID5AUNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03623&json=true","fetch_graph":"https://pith.science/api/pith-number/EID5AUNGWYQICZKH7I2WLEK3IO/graph.json","fetch_events":"https://pith.science/api/pith-number/EID5AUNGWYQICZKH7I2WLEK3IO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EID5AUNGWYQICZKH7I2WLEK3IO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EID5AUNGWYQICZKH7I2WLEK3IO/action/storage_attestation","attest_author":"https://pith.science/pith/EID5AUNGWYQICZKH7I2WLEK3IO/action/author_attestation","sign_citation":"https://pith.science/pith/EID5AUNGWYQICZKH7I2WLEK3IO/action/citation_signature","submit_replication":"https://pith.science/pith/EID5AUNGWYQICZKH7I2WLEK3IO/action/replication_record"}},"created_at":"2026-05-17T23:55:55.646155+00:00","updated_at":"2026-05-17T23:55:55.646155+00:00"}