{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:A7QNER4MQYL73DVEDCFNB2IWRB","short_pith_number":"pith:A7QNER4M","schema_version":"1.0","canonical_sha256":"07e0d2478c8617fd8ea4188ad0e9168850bd6416407d9265afb6d74629f76f42","source":{"kind":"arxiv","id":"1202.5822","version":1},"attestation_state":"computed","paper":{"title":"Hamiltonian Simulation Using Linear Combinations of Unitary Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Nathan Wiebe","submitted_at":"2012-02-27T03:52:03Z","abstract_excerpt":"We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations. The resulting algorithm has superior performance to existing simulation algorithms based on product formulas and, most notably, scales better with the simulation error than any known Hamiltonian simulation technique. Our main tool is a general method to nearly deterministically implement linear combinations of nearby unitary operations, which we show is optimal among a large class of methods."},"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":"1202.5822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-27T03:52:03Z","cross_cats_sorted":[],"title_canon_sha256":"1276b2cc8170b8a453acd5796af36426a342040ee44ab8087a68a8a43cede74f","abstract_canon_sha256":"296275aa1f2c6565ee2c2df0321ec4ce825c8d21e29d47e40ee878a012cb7394"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:10.630062Z","signature_b64":"DQ3ha10kNAqtGVGfkANg6wwQsAWy6hKMaODMnNN3aZStymdL5+tD8I2NR0WsZ3jLRzIPelps7g54mrJDXfXWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07e0d2478c8617fd8ea4188ad0e9168850bd6416407d9265afb6d74629f76f42","last_reissued_at":"2026-05-18T00:09:10.629386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:10.629386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonian Simulation Using Linear Combinations of Unitary Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Nathan Wiebe","submitted_at":"2012-02-27T03:52:03Z","abstract_excerpt":"We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations. The resulting algorithm has superior performance to existing simulation algorithms based on product formulas and, most notably, scales better with the simulation error than any known Hamiltonian simulation technique. Our main tool is a general method to nearly deterministically implement linear combinations of nearby unitary operations, which we show is optimal among a large class of methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5822","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":"1202.5822","created_at":"2026-05-18T00:09:10.629494+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5822v1","created_at":"2026-05-18T00:09:10.629494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5822","created_at":"2026-05-18T00:09:10.629494+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7QNER4MQYL7","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7QNER4MQYL73DVE","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7QNER4M","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2604.26792","citing_title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00302","citing_title":"Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation","ref_index":65,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00794","citing_title":"Quantum Simulation of Differential-Algebraic Equations with Applications to Unsteady Stokes Flow","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2508.21667","citing_title":"Block Encoding of Sparse Matrices via Coherent Permutation","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2603.01809","citing_title":"Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\\'er Filtering","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27482","citing_title":"Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26792","citing_title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26226","citing_title":"Exponentially improved quantum simulation of scalar QFT","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00302","citing_title":"Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04861","citing_title":"Quantum algorithm for solving differential equations using SLAC derivatives","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05321","citing_title":"Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00794","citing_title":"Quantum Simulation of Differential-Algebraic Equations with Applications to Unsteady Stokes Flow","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00302","citing_title":"Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14275","citing_title":"Generalized Complexity Distances and Non-Invertible Symmetries","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11113","citing_title":"Schr\\\"odinger-Navier-Stokes Equation for the Quantum Simulation of Navier-Stokes Flows","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09538","citing_title":"Explicit Block Encoding of Difference-of-Gaussian Operators on a Periodic Grid","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06087","citing_title":"Gauss law codes and vacuum codes from lattice gauge theories","ref_index":110,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19319","citing_title":"An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics","ref_index":284,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18924","citing_title":"Lindbladian Homotopy Analysis Method to Solve Nonlinear Partial Differential Equations","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A7QNER4MQYL73DVEDCFNB2IWRB","json":"https://pith.science/pith/A7QNER4MQYL73DVEDCFNB2IWRB.json","graph_json":"https://pith.science/api/pith-number/A7QNER4MQYL73DVEDCFNB2IWRB/graph.json","events_json":"https://pith.science/api/pith-number/A7QNER4MQYL73DVEDCFNB2IWRB/events.json","paper":"https://pith.science/paper/A7QNER4M"},"agent_actions":{"view_html":"https://pith.science/pith/A7QNER4MQYL73DVEDCFNB2IWRB","download_json":"https://pith.science/pith/A7QNER4MQYL73DVEDCFNB2IWRB.json","view_paper":"https://pith.science/paper/A7QNER4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5822&json=true","fetch_graph":"https://pith.science/api/pith-number/A7QNER4MQYL73DVEDCFNB2IWRB/graph.json","fetch_events":"https://pith.science/api/pith-number/A7QNER4MQYL73DVEDCFNB2IWRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7QNER4MQYL73DVEDCFNB2IWRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7QNER4MQYL73DVEDCFNB2IWRB/action/storage_attestation","attest_author":"https://pith.science/pith/A7QNER4MQYL73DVEDCFNB2IWRB/action/author_attestation","sign_citation":"https://pith.science/pith/A7QNER4MQYL73DVEDCFNB2IWRB/action/citation_signature","submit_replication":"https://pith.science/pith/A7QNER4MQYL73DVEDCFNB2IWRB/action/replication_record"}},"created_at":"2026-05-18T00:09:10.629494+00:00","updated_at":"2026-05-18T00:09:10.629494+00:00"}