{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4P7R64G3VMBOTVJXDFY3DGON6P","short_pith_number":"pith:4P7R64G3","schema_version":"1.0","canonical_sha256":"e3ff1f70dbab02e9d5371971b199cdf3c3bcb2990d14c420d7415128609b3ca8","source":{"kind":"arxiv","id":"1910.06255","version":2},"attestation_state":"computed","paper":{"title":"Compilation by stochastic Hamiltonian sparsification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David R. White, Earl T. Campbell, Yingkai Ouyang","submitted_at":"2019-10-14T16:28:38Z","abstract_excerpt":"Simulation of quantum chemistry is expected to be a principal application of quantum computing. In quantum simulation, a complicated Hamiltonian describing the dynamics of a quantum system is decomposed into its constituent terms, where the effect of each term during time-evolution is individually computed. For many physical systems, the Hamiltonian has a large number of terms, constraining the scalability of established simulation methods. To address this limitation we introduce a new scheme that approximates the actual Hamiltonian with a sparser Hamiltonian containing fewer terms. By stochas"},"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":"1910.06255","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-10-14T16:28:38Z","cross_cats_sorted":[],"title_canon_sha256":"6dd59079189bbf4752aa52b6d2011b18bf7d4f9bd851937b176b2d1d02342ee1","abstract_canon_sha256":"5fb2e3b27e4a5fe6e818eb5c2b8cdc359a9ee873c6ce80419301fdacca028da8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:45:12.149740Z","signature_b64":"RshvbemgneHMdu+9X3qAbcnE3aGom/SM8WghMG0KuFiW2GS8QGwglbUvT9lrGDg7UMLkSjuz7cl8Lw91TbMLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ff1f70dbab02e9d5371971b199cdf3c3bcb2990d14c420d7415128609b3ca8","last_reissued_at":"2026-07-05T00:45:12.149198Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:45:12.149198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compilation by stochastic Hamiltonian sparsification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David R. White, Earl T. Campbell, Yingkai Ouyang","submitted_at":"2019-10-14T16:28:38Z","abstract_excerpt":"Simulation of quantum chemistry is expected to be a principal application of quantum computing. In quantum simulation, a complicated Hamiltonian describing the dynamics of a quantum system is decomposed into its constituent terms, where the effect of each term during time-evolution is individually computed. For many physical systems, the Hamiltonian has a large number of terms, constraining the scalability of established simulation methods. To address this limitation we introduce a new scheme that approximates the actual Hamiltonian with a sparser Hamiltonian containing fewer terms. By stochas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.06255","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/1910.06255/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":"1910.06255","created_at":"2026-07-05T00:45:12.149258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.06255v2","created_at":"2026-07-05T00:45:12.149258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.06255","created_at":"2026-07-05T00:45:12.149258+00:00"},{"alias_kind":"pith_short_12","alias_value":"4P7R64G3VMBO","created_at":"2026-07-05T00:45:12.149258+00:00"},{"alias_kind":"pith_short_16","alias_value":"4P7R64G3VMBOTVJX","created_at":"2026-07-05T00:45:12.149258+00:00"},{"alias_kind":"pith_short_8","alias_value":"4P7R64G3","created_at":"2026-07-05T00:45:12.149258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29741","citing_title":"Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4P7R64G3VMBOTVJXDFY3DGON6P","json":"https://pith.science/pith/4P7R64G3VMBOTVJXDFY3DGON6P.json","graph_json":"https://pith.science/api/pith-number/4P7R64G3VMBOTVJXDFY3DGON6P/graph.json","events_json":"https://pith.science/api/pith-number/4P7R64G3VMBOTVJXDFY3DGON6P/events.json","paper":"https://pith.science/paper/4P7R64G3"},"agent_actions":{"view_html":"https://pith.science/pith/4P7R64G3VMBOTVJXDFY3DGON6P","download_json":"https://pith.science/pith/4P7R64G3VMBOTVJXDFY3DGON6P.json","view_paper":"https://pith.science/paper/4P7R64G3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.06255&json=true","fetch_graph":"https://pith.science/api/pith-number/4P7R64G3VMBOTVJXDFY3DGON6P/graph.json","fetch_events":"https://pith.science/api/pith-number/4P7R64G3VMBOTVJXDFY3DGON6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4P7R64G3VMBOTVJXDFY3DGON6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4P7R64G3VMBOTVJXDFY3DGON6P/action/storage_attestation","attest_author":"https://pith.science/pith/4P7R64G3VMBOTVJXDFY3DGON6P/action/author_attestation","sign_citation":"https://pith.science/pith/4P7R64G3VMBOTVJXDFY3DGON6P/action/citation_signature","submit_replication":"https://pith.science/pith/4P7R64G3VMBOTVJXDFY3DGON6P/action/replication_record"}},"created_at":"2026-07-05T00:45:12.149258+00:00","updated_at":"2026-07-05T00:45:12.149258+00:00"}