{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U2ZYEBASE7G7TE5KGSCZLPOJKQ","short_pith_number":"pith:U2ZYEBAS","schema_version":"1.0","canonical_sha256":"a6b382041227cdf993aa348595bdc9543daeeaa4eddeef8a850bf3b9eb48e3ce","source":{"kind":"arxiv","id":"1811.08017","version":2},"attestation_state":"computed","paper":{"title":"A random compiler for fast Hamiltonian simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl Campbell","submitted_at":"2018-11-19T23:10:55Z","abstract_excerpt":"The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which rigorous bounds on the circuit size depend on the number of terms $L$ in the system Hamiltonian and the size of the largest term in the Hamiltonian $\\Lambda$. Consequently, Trotter-Suzuki is only practical for sparse Hamiltonians. Trotter-Suzuki is a deterministic compiler but it was recently shown that randomised compiling offers lower overheads. Here we present a"},"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":"1811.08017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-19T23:10:55Z","cross_cats_sorted":[],"title_canon_sha256":"28132b91cbaf5f33898b128dd38fde12de98afef37bb057de070bcb0fa104e1d","abstract_canon_sha256":"fa6a59ec8e312bf01355a955e5a71f7fc243651fe0976e74b740e74e612c2286"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:05.150910Z","signature_b64":"KFu5PxiBDPc2FEUP/HXTOSWP9HoRzBz4wgm1QW4avEVwZPdapAk06wTRiI6qj/mPNdnEXjgq7D/rc1aL+Af7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6b382041227cdf993aa348595bdc9543daeeaa4eddeef8a850bf3b9eb48e3ce","last_reissued_at":"2026-07-04T23:58:05.150393Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:05.150393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A random compiler for fast Hamiltonian simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl Campbell","submitted_at":"2018-11-19T23:10:55Z","abstract_excerpt":"The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which rigorous bounds on the circuit size depend on the number of terms $L$ in the system Hamiltonian and the size of the largest term in the Hamiltonian $\\Lambda$. Consequently, Trotter-Suzuki is only practical for sparse Hamiltonians. Trotter-Suzuki is a deterministic compiler but it was recently shown that randomised compiling offers lower overheads. Here we present a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08017","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/1811.08017/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":"1811.08017","created_at":"2026-07-04T23:58:05.150452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08017v2","created_at":"2026-07-04T23:58:05.150452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08017","created_at":"2026-07-04T23:58:05.150452+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2ZYEBASE7G7","created_at":"2026-07-04T23:58:05.150452+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2ZYEBASE7G7TE5K","created_at":"2026-07-04T23:58:05.150452+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2ZYEBAS","created_at":"2026-07-04T23:58:05.150452+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29848","citing_title":"Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation: A Weyl Calculus Approach","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"1907.10070","citing_title":"Phase estimation with randomized Hamiltonians","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09756","citing_title":"Generative Circuit Design for Quantum-Selected Configuration Interaction","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17630","citing_title":"Randomized Subsystem Descent for Fermion-to-Qubit Mapping","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19319","citing_title":"An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics","ref_index":291,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ","json":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ.json","graph_json":"https://pith.science/api/pith-number/U2ZYEBASE7G7TE5KGSCZLPOJKQ/graph.json","events_json":"https://pith.science/api/pith-number/U2ZYEBASE7G7TE5KGSCZLPOJKQ/events.json","paper":"https://pith.science/paper/U2ZYEBAS"},"agent_actions":{"view_html":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ","download_json":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ.json","view_paper":"https://pith.science/paper/U2ZYEBAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08017&json=true","fetch_graph":"https://pith.science/api/pith-number/U2ZYEBASE7G7TE5KGSCZLPOJKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/U2ZYEBASE7G7TE5KGSCZLPOJKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/action/storage_attestation","attest_author":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/action/author_attestation","sign_citation":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/action/citation_signature","submit_replication":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/action/replication_record"}},"created_at":"2026-07-04T23:58:05.150452+00:00","updated_at":"2026-07-04T23:58:05.150452+00:00"}