{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HR65BHKDZCUIFL2VYW54D5BXW3","short_pith_number":"pith:HR65BHKD","schema_version":"1.0","canonical_sha256":"3c7dd09d43c8a882af55c5bbc1f437b6d8955cd1827f3ba0837222fb829a7129","source":{"kind":"arxiv","id":"2306.12569","version":2},"attestation_state":"computed","paper":{"title":"Trotter error bounds and dynamic multi-product formulas for Hamiltonian simulation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NA","math-ph","math.MP","math.NA","math.OC"],"primary_cat":"quant-ph","authors_text":"Niall Robertson, Sergey Bravyi, Sergiy Zhuk","submitted_at":"2023-06-21T21:07:06Z","abstract_excerpt":"Multi-product formulas (MPF) are linear combinations of Trotter circuits offering high-quality simulation of Hamiltonian time evolution with fewer Trotter steps. Here we report two contributions aimed at making multi-product formulas more viable for near-term quantum simulations. First, we extend the theory of Trotter error with commutator scaling developed by Childs, Su, Tran et al. to multi-product formulas. Our result implies that multi-product formulas can achieve a quadratic reduction of Trotter error in 1-norm (nuclear norm) on arbitrary time intervals compared with the regular product f"},"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":"2306.12569","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-21T21:07:06Z","cross_cats_sorted":["cs.NA","math-ph","math.MP","math.NA","math.OC"],"title_canon_sha256":"1dd943c8ef78b8833e953d8ff452373b310131ddf64a665959bb6bc6cbf5c89c","abstract_canon_sha256":"0d92c74fa7256259d64eb90fcd63189ed0dfbff1e41a38ef8bc3e227c526b2d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:09.894175Z","signature_b64":"RqDIwHz9s4PGHCluGzn4N/YslfM9+djxrTMZb9b0aeetmNmLs6tizo5J3SUHG4j+DWSPg9DETBiOwnNhBenYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c7dd09d43c8a882af55c5bbc1f437b6d8955cd1827f3ba0837222fb829a7129","last_reissued_at":"2026-07-05T07:43:09.893703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:09.893703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trotter error bounds and dynamic multi-product formulas for Hamiltonian simulation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NA","math-ph","math.MP","math.NA","math.OC"],"primary_cat":"quant-ph","authors_text":"Niall Robertson, Sergey Bravyi, Sergiy Zhuk","submitted_at":"2023-06-21T21:07:06Z","abstract_excerpt":"Multi-product formulas (MPF) are linear combinations of Trotter circuits offering high-quality simulation of Hamiltonian time evolution with fewer Trotter steps. Here we report two contributions aimed at making multi-product formulas more viable for near-term quantum simulations. First, we extend the theory of Trotter error with commutator scaling developed by Childs, Su, Tran et al. to multi-product formulas. Our result implies that multi-product formulas can achieve a quadratic reduction of Trotter error in 1-norm (nuclear norm) on arbitrary time intervals compared with the regular product f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.12569","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/2306.12569/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":"2306.12569","created_at":"2026-07-05T07:43:09.893757+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.12569v2","created_at":"2026-07-05T07:43:09.893757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.12569","created_at":"2026-07-05T07:43:09.893757+00:00"},{"alias_kind":"pith_short_12","alias_value":"HR65BHKDZCUI","created_at":"2026-07-05T07:43:09.893757+00:00"},{"alias_kind":"pith_short_16","alias_value":"HR65BHKDZCUIFL2V","created_at":"2026-07-05T07:43:09.893757+00:00"},{"alias_kind":"pith_short_8","alias_value":"HR65BHKD","created_at":"2026-07-05T07:43:09.893757+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":30,"is_internal_anchor":false},{"citing_arxiv_id":"2411.10406","citing_title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","ref_index":188,"is_internal_anchor":false},{"citing_arxiv_id":"2601.05788","citing_title":"On the robustness of Quantum Phase Estimation to compute ground properties of many-electron systems","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2602.22313","citing_title":"Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HR65BHKDZCUIFL2VYW54D5BXW3","json":"https://pith.science/pith/HR65BHKDZCUIFL2VYW54D5BXW3.json","graph_json":"https://pith.science/api/pith-number/HR65BHKDZCUIFL2VYW54D5BXW3/graph.json","events_json":"https://pith.science/api/pith-number/HR65BHKDZCUIFL2VYW54D5BXW3/events.json","paper":"https://pith.science/paper/HR65BHKD"},"agent_actions":{"view_html":"https://pith.science/pith/HR65BHKDZCUIFL2VYW54D5BXW3","download_json":"https://pith.science/pith/HR65BHKDZCUIFL2VYW54D5BXW3.json","view_paper":"https://pith.science/paper/HR65BHKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.12569&json=true","fetch_graph":"https://pith.science/api/pith-number/HR65BHKDZCUIFL2VYW54D5BXW3/graph.json","fetch_events":"https://pith.science/api/pith-number/HR65BHKDZCUIFL2VYW54D5BXW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HR65BHKDZCUIFL2VYW54D5BXW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HR65BHKDZCUIFL2VYW54D5BXW3/action/storage_attestation","attest_author":"https://pith.science/pith/HR65BHKDZCUIFL2VYW54D5BXW3/action/author_attestation","sign_citation":"https://pith.science/pith/HR65BHKDZCUIFL2VYW54D5BXW3/action/citation_signature","submit_replication":"https://pith.science/pith/HR65BHKDZCUIFL2VYW54D5BXW3/action/replication_record"}},"created_at":"2026-07-05T07:43:09.893757+00:00","updated_at":"2026-07-05T07:43:09.893757+00:00"}