{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4AI34GBGUFKMMB4QLJ73M4OOQJ","short_pith_number":"pith:4AI34GBG","schema_version":"1.0","canonical_sha256":"e011be1826a154c607905a7fb671ce8266b62d1ac30fe1344ac04aa342dd30a1","source":{"kind":"arxiv","id":"2412.19232","version":1},"attestation_state":"computed","paper":{"title":"High order schemes for solving partial differential equations on a quantum computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Boris Arseniev, Dmitry Guskov, Igor Zacharov, Richik Sengupta","submitted_at":"2024-12-26T14:21:59Z","abstract_excerpt":"We explore the utilization of higher-order discretization techniques in optimizing the gate count needed for quantum computer based solutions of partial differential equations. To accomplish this, we present an efficient approach for decomposing $d$-band diagonal matrices into Pauli strings that are grouped into mutually commuting sets.\n  Using numerical simulations of the one-dimensional wave equation, we show that higher-order methods can reduce the number of qubits necessary for discretization, similar to the classical case, although they do not decrease the number of Trotter steps needed t"},"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":"2412.19232","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-26T14:21:59Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"a2b66131591a05c7424ced02e6811c37b3e9350958e92c356df87a9f8876bcd1","abstract_canon_sha256":"5f5d208ca1b8398888e45ca7e8b26333bb44804280534395caf5f8759f72d130"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:32.622445Z","signature_b64":"dvGFP0rvvCsxvlZ6jW2aN9pYmXX6CwD09Yd7YO6og1S/P6hetj0j8F3y1ZwdVcZOfcv9F8AkurvGgzJ/MCCDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e011be1826a154c607905a7fb671ce8266b62d1ac30fe1344ac04aa342dd30a1","last_reissued_at":"2026-07-05T09:54:32.621854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:32.621854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High order schemes for solving partial differential equations on a quantum computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Boris Arseniev, Dmitry Guskov, Igor Zacharov, Richik Sengupta","submitted_at":"2024-12-26T14:21:59Z","abstract_excerpt":"We explore the utilization of higher-order discretization techniques in optimizing the gate count needed for quantum computer based solutions of partial differential equations. To accomplish this, we present an efficient approach for decomposing $d$-band diagonal matrices into Pauli strings that are grouped into mutually commuting sets.\n  Using numerical simulations of the one-dimensional wave equation, we show that higher-order methods can reduce the number of qubits necessary for discretization, similar to the classical case, although they do not decrease the number of Trotter steps needed t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19232","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/2412.19232/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":"2412.19232","created_at":"2026-07-05T09:54:32.621927+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.19232v1","created_at":"2026-07-05T09:54:32.621927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19232","created_at":"2026-07-05T09:54:32.621927+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AI34GBGUFKM","created_at":"2026-07-05T09:54:32.621927+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AI34GBGUFKMMB4Q","created_at":"2026-07-05T09:54:32.621927+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AI34GBG","created_at":"2026-07-05T09:54:32.621927+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4AI34GBGUFKMMB4QLJ73M4OOQJ","json":"https://pith.science/pith/4AI34GBGUFKMMB4QLJ73M4OOQJ.json","graph_json":"https://pith.science/api/pith-number/4AI34GBGUFKMMB4QLJ73M4OOQJ/graph.json","events_json":"https://pith.science/api/pith-number/4AI34GBGUFKMMB4QLJ73M4OOQJ/events.json","paper":"https://pith.science/paper/4AI34GBG"},"agent_actions":{"view_html":"https://pith.science/pith/4AI34GBGUFKMMB4QLJ73M4OOQJ","download_json":"https://pith.science/pith/4AI34GBGUFKMMB4QLJ73M4OOQJ.json","view_paper":"https://pith.science/paper/4AI34GBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.19232&json=true","fetch_graph":"https://pith.science/api/pith-number/4AI34GBGUFKMMB4QLJ73M4OOQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4AI34GBGUFKMMB4QLJ73M4OOQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AI34GBGUFKMMB4QLJ73M4OOQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AI34GBGUFKMMB4QLJ73M4OOQJ/action/storage_attestation","attest_author":"https://pith.science/pith/4AI34GBGUFKMMB4QLJ73M4OOQJ/action/author_attestation","sign_citation":"https://pith.science/pith/4AI34GBGUFKMMB4QLJ73M4OOQJ/action/citation_signature","submit_replication":"https://pith.science/pith/4AI34GBGUFKMMB4QLJ73M4OOQJ/action/replication_record"}},"created_at":"2026-07-05T09:54:32.621927+00:00","updated_at":"2026-07-05T09:54:32.621927+00:00"}