{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2LBSHH5GIN7RJ3WJ4DFMEBVWJB","short_pith_number":"pith:2LBSHH5G","schema_version":"1.0","canonical_sha256":"d2c3239fa6437f14eec9e0cac206b6485f58ad902c16add19746849a38e735ec","source":{"kind":"arxiv","id":"2403.08922","version":1},"attestation_state":"computed","paper":{"title":"Multi-product Hamiltonian simulation with explicit commutator scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Dong An, Junaid Aftab, Konstantina Trivisa","submitted_at":"2024-03-13T19:23:59Z","abstract_excerpt":"The well-conditioned multi-product formula (MPF), proposed by [Low, Kliuchnikov, and Wiebe, 2019], is a simple high-order time-independent Hamiltonian simulation algorithm that implements a linear combination of standard product formulas of low order. While the MPF aims to simultaneously exploit commutator scaling among Hamiltonians and achieve near-optimal time and precision dependence, its lack of a rigorous error bound on the nested commutators renders its practical advantage ambiguous. In this work, we conduct a rigorous complexity analysis of the well-conditioned MPF, demonstrating explic"},"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":"2403.08922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-13T19:23:59Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"403e0ea6e0865419b057fadef5b17aa83cbabccd2a0cfb1344be55d69ef094f7","abstract_canon_sha256":"989c971f1c3d989f244fd6f8d2c5ef1a5ec2ce7c66a209166ad22babff04cc8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:49.274727Z","signature_b64":"EWoDmcadwNnRfOGMBhinyHFdzwuvDD8DY6Y9ZelolSln8vX9NN110hGAtmBw2oZRkrNUKdNxNITMTqCi+MgSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2c3239fa6437f14eec9e0cac206b6485f58ad902c16add19746849a38e735ec","last_reissued_at":"2026-07-05T07:55:49.274139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:49.274139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-product Hamiltonian simulation with explicit commutator scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Dong An, Junaid Aftab, Konstantina Trivisa","submitted_at":"2024-03-13T19:23:59Z","abstract_excerpt":"The well-conditioned multi-product formula (MPF), proposed by [Low, Kliuchnikov, and Wiebe, 2019], is a simple high-order time-independent Hamiltonian simulation algorithm that implements a linear combination of standard product formulas of low order. While the MPF aims to simultaneously exploit commutator scaling among Hamiltonians and achieve near-optimal time and precision dependence, its lack of a rigorous error bound on the nested commutators renders its practical advantage ambiguous. In this work, we conduct a rigorous complexity analysis of the well-conditioned MPF, demonstrating explic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.08922","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.08922/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":"2403.08922","created_at":"2026-07-05T07:55:49.274197+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.08922v1","created_at":"2026-07-05T07:55:49.274197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.08922","created_at":"2026-07-05T07:55:49.274197+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LBSHH5GIN7R","created_at":"2026-07-05T07:55:49.274197+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LBSHH5GIN7RJ3WJ","created_at":"2026-07-05T07:55:49.274197+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LBSHH5G","created_at":"2026-07-05T07:55:49.274197+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11475","citing_title":"Linear Combination of Hamiltonian Simulation with Commutator Scaling","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17630","citing_title":"Randomized Subsystem Descent for Fermion-to-Qubit Mapping","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2LBSHH5GIN7RJ3WJ4DFMEBVWJB","json":"https://pith.science/pith/2LBSHH5GIN7RJ3WJ4DFMEBVWJB.json","graph_json":"https://pith.science/api/pith-number/2LBSHH5GIN7RJ3WJ4DFMEBVWJB/graph.json","events_json":"https://pith.science/api/pith-number/2LBSHH5GIN7RJ3WJ4DFMEBVWJB/events.json","paper":"https://pith.science/paper/2LBSHH5G"},"agent_actions":{"view_html":"https://pith.science/pith/2LBSHH5GIN7RJ3WJ4DFMEBVWJB","download_json":"https://pith.science/pith/2LBSHH5GIN7RJ3WJ4DFMEBVWJB.json","view_paper":"https://pith.science/paper/2LBSHH5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.08922&json=true","fetch_graph":"https://pith.science/api/pith-number/2LBSHH5GIN7RJ3WJ4DFMEBVWJB/graph.json","fetch_events":"https://pith.science/api/pith-number/2LBSHH5GIN7RJ3WJ4DFMEBVWJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LBSHH5GIN7RJ3WJ4DFMEBVWJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LBSHH5GIN7RJ3WJ4DFMEBVWJB/action/storage_attestation","attest_author":"https://pith.science/pith/2LBSHH5GIN7RJ3WJ4DFMEBVWJB/action/author_attestation","sign_citation":"https://pith.science/pith/2LBSHH5GIN7RJ3WJ4DFMEBVWJB/action/citation_signature","submit_replication":"https://pith.science/pith/2LBSHH5GIN7RJ3WJ4DFMEBVWJB/action/replication_record"}},"created_at":"2026-07-05T07:55:49.274197+00:00","updated_at":"2026-07-05T07:55:49.274197+00:00"}