{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EAEIZBSHDAJQZZ7XOUASRTW27F","short_pith_number":"pith:EAEIZBSH","schema_version":"1.0","canonical_sha256":"20088c864718130ce7f7750128cedaf96522a1bd6f36062f9aa2fad9f3600d70","source":{"kind":"arxiv","id":"1907.11679","version":2},"attestation_state":"computed","paper":{"title":"Well-conditioned multiproduct Hamiltonian simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Guang Hao Low, Nathan Wiebe, Vadym Kliuchnikov","submitted_at":"2019-07-26T17:02:08Z","abstract_excerpt":"Product formula approximations of the time-evolution operator on quantum computers are of great interest due to their simplicity, and good scaling with system size by exploiting commutativity between Hamiltonian terms. However, product formulas exhibit poor scaling with the time $t$ and error $\\epsilon$ of simulation as the gate cost of a single step scales exponentially with the order $m$ of accuracy. We introduce well-conditioned multiproduct formulas, which are a linear combination of product formulas, where a single step has polynomial cost $\\mathcal{O}(m^2\\log{(m)})$ and succeeds with pro"},"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":"1907.11679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-26T17:02:08Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"02821213a93f3255cb87022dc64e0e37201ed5a8a17f38cbce319c13c0ecbf02","abstract_canon_sha256":"40f67a8ad2f95cc45313b006c347bcaf7a13e2131257222e4665bcbe929d0203"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:06:10.042337Z","signature_b64":"aNa+7UTcCFPbZ5CZPOXIWrdyU/vXErm/JWsiHX/TAsfgBhejANq5WLzqqUL7Mfcx5a3Gk6QrTd52dVGHHLGeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20088c864718130ce7f7750128cedaf96522a1bd6f36062f9aa2fad9f3600d70","last_reissued_at":"2026-07-05T00:06:10.041778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:06:10.041778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Well-conditioned multiproduct Hamiltonian simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Guang Hao Low, Nathan Wiebe, Vadym Kliuchnikov","submitted_at":"2019-07-26T17:02:08Z","abstract_excerpt":"Product formula approximations of the time-evolution operator on quantum computers are of great interest due to their simplicity, and good scaling with system size by exploiting commutativity between Hamiltonian terms. However, product formulas exhibit poor scaling with the time $t$ and error $\\epsilon$ of simulation as the gate cost of a single step scales exponentially with the order $m$ of accuracy. We introduce well-conditioned multiproduct formulas, which are a linear combination of product formulas, where a single step has polynomial cost $\\mathcal{O}(m^2\\log{(m)})$ and succeeds with pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11679","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/1907.11679/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":"1907.11679","created_at":"2026-07-05T00:06:10.041836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11679v2","created_at":"2026-07-05T00:06:10.041836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11679","created_at":"2026-07-05T00:06:10.041836+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAEIZBSHDAJQ","created_at":"2026-07-05T00:06:10.041836+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAEIZBSHDAJQZZ7X","created_at":"2026-07-05T00:06:10.041836+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAEIZBSH","created_at":"2026-07-05T00:06:10.041836+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20242","citing_title":"Mitigating Trotter Errors via Post-Processed Symmetry Restoration","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11475","citing_title":"Linear Combination of Hamiltonian Simulation with Commutator Scaling","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30741","citing_title":"Theory and practice of Trotter product formulas for quantum chemistry","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11285","citing_title":"Analogue quantum simulation with polylogarithmic interaction strengths by extrapolating within phases of matter","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EAEIZBSHDAJQZZ7XOUASRTW27F","json":"https://pith.science/pith/EAEIZBSHDAJQZZ7XOUASRTW27F.json","graph_json":"https://pith.science/api/pith-number/EAEIZBSHDAJQZZ7XOUASRTW27F/graph.json","events_json":"https://pith.science/api/pith-number/EAEIZBSHDAJQZZ7XOUASRTW27F/events.json","paper":"https://pith.science/paper/EAEIZBSH"},"agent_actions":{"view_html":"https://pith.science/pith/EAEIZBSHDAJQZZ7XOUASRTW27F","download_json":"https://pith.science/pith/EAEIZBSHDAJQZZ7XOUASRTW27F.json","view_paper":"https://pith.science/paper/EAEIZBSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11679&json=true","fetch_graph":"https://pith.science/api/pith-number/EAEIZBSHDAJQZZ7XOUASRTW27F/graph.json","fetch_events":"https://pith.science/api/pith-number/EAEIZBSHDAJQZZ7XOUASRTW27F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAEIZBSHDAJQZZ7XOUASRTW27F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAEIZBSHDAJQZZ7XOUASRTW27F/action/storage_attestation","attest_author":"https://pith.science/pith/EAEIZBSHDAJQZZ7XOUASRTW27F/action/author_attestation","sign_citation":"https://pith.science/pith/EAEIZBSHDAJQZZ7XOUASRTW27F/action/citation_signature","submit_replication":"https://pith.science/pith/EAEIZBSHDAJQZZ7XOUASRTW27F/action/replication_record"}},"created_at":"2026-07-05T00:06:10.041836+00:00","updated_at":"2026-07-05T00:06:10.041836+00:00"}