{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:Q75VZ2CGP6FFLSIXXENUHDYB2P","short_pith_number":"pith:Q75VZ2CG","schema_version":"1.0","canonical_sha256":"87fb5ce8467f8a55c917b91b438f01d3f95acfc37d574b609197822944062466","source":{"kind":"arxiv","id":"1005.1318","version":3},"attestation_state":"computed","paper":{"title":"On the Efficiency of Quantum Algorithms for Hamiltonian Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anargyros Papageorgiou, Chi Zhang","submitted_at":"2010-05-08T02:08:01Z","abstract_excerpt":"We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number of exponentials required to approximate $e^{-iHt}$ with error $\\e$. Moreover, we derive the order of the splitting method that optimizes the cost of the resulting algorithm. We show significant speedups relative to previously known results."},"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":"1005.1318","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-05-08T02:08:01Z","cross_cats_sorted":[],"title_canon_sha256":"00140d7d0e7a02f1867afaa189bdfa8faddd59991d11d5036491e6757638b325","abstract_canon_sha256":"81fbb2b2259ad57a8cede27723f3a4c61c067cc23e540134c2ed94eebd2d51e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:38.836213Z","signature_b64":"jA2wTPcxG/6er+JTBt7xnWGNwmLNkQRuOrOSJ47fSXcf8ZvZxY0sEBndyNQLgWZKfyBcLxuIIiFL/ElDAEaIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87fb5ce8467f8a55c917b91b438f01d3f95acfc37d574b609197822944062466","last_reissued_at":"2026-05-18T04:39:38.835761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:38.835761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Efficiency of Quantum Algorithms for Hamiltonian Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anargyros Papageorgiou, Chi Zhang","submitted_at":"2010-05-08T02:08:01Z","abstract_excerpt":"We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number of exponentials required to approximate $e^{-iHt}$ with error $\\e$. Moreover, we derive the order of the splitting method that optimizes the cost of the resulting algorithm. We show significant speedups relative to previously known results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1318","kind":"arxiv","version":3},"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":"1005.1318","created_at":"2026-05-18T04:39:38.835821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.1318v3","created_at":"2026-05-18T04:39:38.835821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1318","created_at":"2026-05-18T04:39:38.835821+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q75VZ2CGP6FF","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q75VZ2CGP6FFLSIX","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q75VZ2CG","created_at":"2026-05-18T12:26:12.377268+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/Q75VZ2CGP6FFLSIXXENUHDYB2P","json":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P.json","graph_json":"https://pith.science/api/pith-number/Q75VZ2CGP6FFLSIXXENUHDYB2P/graph.json","events_json":"https://pith.science/api/pith-number/Q75VZ2CGP6FFLSIXXENUHDYB2P/events.json","paper":"https://pith.science/paper/Q75VZ2CG"},"agent_actions":{"view_html":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P","download_json":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P.json","view_paper":"https://pith.science/paper/Q75VZ2CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.1318&json=true","fetch_graph":"https://pith.science/api/pith-number/Q75VZ2CGP6FFLSIXXENUHDYB2P/graph.json","fetch_events":"https://pith.science/api/pith-number/Q75VZ2CGP6FFLSIXXENUHDYB2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/action/storage_attestation","attest_author":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/action/author_attestation","sign_citation":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/action/citation_signature","submit_replication":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/action/replication_record"}},"created_at":"2026-05-18T04:39:38.835821+00:00","updated_at":"2026-05-18T04:39:38.835821+00:00"}