{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:I5CSZWAIFYLS3C5JTMNTWNQ3FM","short_pith_number":"pith:I5CSZWAI","schema_version":"1.0","canonical_sha256":"47452cd8082e172d8ba99b1b3b361b2b3dc060530e873e5b32621084cfbf4d76","source":{"kind":"arxiv","id":"1901.00564","version":2},"attestation_state":"computed","paper":{"title":"Nearly optimal lattice simulation by product formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Yuan Su","submitted_at":"2019-01-03T00:45:45Z","abstract_excerpt":"We consider simulating an $n$-qubit Hamiltonian with nearest-neighbor interactions evolving for time $t$ on a quantum computer. We show that this simulation has gate complexity $(nt)^{1+o(1)}$ using product formulas, a straightforward approach that has been demonstrated by several experimental groups. While it is reasonable to expect this complexity---in particular, this was claimed without rigorous justification by Jordan, Lee, and Preskill---we are not aware of a straightforward proof. Our approach is based on an analysis of the local error structure of product formulas, as introduced by Des"},"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":"1901.00564","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-03T00:45:45Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"1afb23cef605a83afbc33a404012f9c3cd950ea4ff461c24d05367e72bc98500","abstract_canon_sha256":"db770599ceab55f3f6eea39e6c6dc3c3070f3e82bfcf3f85a52ee38605d6b0d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:56.390981Z","signature_b64":"4oqz6nbm4cZ4ZTdi2fvgAPMaXm3b+NHu4O3ZaKV8CQMrTMA4CryJlBecsveuVw6apMaWaga5dwVZpM139nosBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47452cd8082e172d8ba99b1b3b361b2b3dc060530e873e5b32621084cfbf4d76","last_reissued_at":"2026-07-05T00:26:56.390534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:56.390534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly optimal lattice simulation by product formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Yuan Su","submitted_at":"2019-01-03T00:45:45Z","abstract_excerpt":"We consider simulating an $n$-qubit Hamiltonian with nearest-neighbor interactions evolving for time $t$ on a quantum computer. We show that this simulation has gate complexity $(nt)^{1+o(1)}$ using product formulas, a straightforward approach that has been demonstrated by several experimental groups. While it is reasonable to expect this complexity---in particular, this was claimed without rigorous justification by Jordan, Lee, and Preskill---we are not aware of a straightforward proof. Our approach is based on an analysis of the local error structure of product formulas, as introduced by Des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00564","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/1901.00564/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":"1901.00564","created_at":"2026-07-05T00:26:56.390588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00564v2","created_at":"2026-07-05T00:26:56.390588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00564","created_at":"2026-07-05T00:26:56.390588+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5CSZWAIFYLS","created_at":"2026-07-05T00:26:56.390588+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5CSZWAIFYLS3C5J","created_at":"2026-07-05T00:26:56.390588+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5CSZWAI","created_at":"2026-07-05T00:26:56.390588+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29741","citing_title":"Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2603.29091","citing_title":"Ether of Orbifolds","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I5CSZWAIFYLS3C5JTMNTWNQ3FM","json":"https://pith.science/pith/I5CSZWAIFYLS3C5JTMNTWNQ3FM.json","graph_json":"https://pith.science/api/pith-number/I5CSZWAIFYLS3C5JTMNTWNQ3FM/graph.json","events_json":"https://pith.science/api/pith-number/I5CSZWAIFYLS3C5JTMNTWNQ3FM/events.json","paper":"https://pith.science/paper/I5CSZWAI"},"agent_actions":{"view_html":"https://pith.science/pith/I5CSZWAIFYLS3C5JTMNTWNQ3FM","download_json":"https://pith.science/pith/I5CSZWAIFYLS3C5JTMNTWNQ3FM.json","view_paper":"https://pith.science/paper/I5CSZWAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00564&json=true","fetch_graph":"https://pith.science/api/pith-number/I5CSZWAIFYLS3C5JTMNTWNQ3FM/graph.json","fetch_events":"https://pith.science/api/pith-number/I5CSZWAIFYLS3C5JTMNTWNQ3FM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5CSZWAIFYLS3C5JTMNTWNQ3FM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5CSZWAIFYLS3C5JTMNTWNQ3FM/action/storage_attestation","attest_author":"https://pith.science/pith/I5CSZWAIFYLS3C5JTMNTWNQ3FM/action/author_attestation","sign_citation":"https://pith.science/pith/I5CSZWAIFYLS3C5JTMNTWNQ3FM/action/citation_signature","submit_replication":"https://pith.science/pith/I5CSZWAIFYLS3C5JTMNTWNQ3FM/action/replication_record"}},"created_at":"2026-07-05T00:26:56.390588+00:00","updated_at":"2026-07-05T00:26:56.390588+00:00"}