{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HI5NJROS3VV2A7LTJJ46UOWZTQ","short_pith_number":"pith:HI5NJROS","schema_version":"1.0","canonical_sha256":"3a3ad4c5d2dd6ba07d734a79ea3ad99c2cb8722f1648493d65dccd63b9c199b2","source":{"kind":"arxiv","id":"2211.14269","version":2},"attestation_state":"computed","paper":{"title":"Efficient and fail-safe quantum algorithm for the transport equation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Matthias M\\\"oller, Merel A. Schalkers","submitted_at":"2022-11-25T17:59:09Z","abstract_excerpt":"We present a scalable algorithm for solving the transport equation in two and three spatial dimensions for variable grid sizes and discrete velocities on a fault-tolerant universal quantum computer. As a proof of concept of our quantum transport method (QTM), we describe a full-circuit start-to-end implementation in Qiskit and present numerical results for 2D flows. Our QTM is based on a novel streaming approach which leads to a reduction in the amount of CNOT gates required in comparison to state-of-the-art quantum streaming methods. As a second highlight we present a novel object encoding me"},"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":"2211.14269","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-11-25T17:59:09Z","cross_cats_sorted":[],"title_canon_sha256":"f6a67bbfcf07f90e2e6f9396a4256770f64f622784c0cff4ccf7687f9832d20c","abstract_canon_sha256":"b7faa8c746ab35e84a602a57b6907312cd443903baf22b185d287de3ef6ae6bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:39.681232Z","signature_b64":"WKn+l65Ia0PmxIAJ4485Fgv3zort97mQpbe5dfVTtxNVDhKNoVhWXMlxf+gTot0aiCZ2A9KkRFOC35N1RK8iAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a3ad4c5d2dd6ba07d734a79ea3ad99c2cb8722f1648493d65dccd63b9c199b2","last_reissued_at":"2026-07-05T10:02:39.680792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:39.680792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and fail-safe quantum algorithm for the transport equation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Matthias M\\\"oller, Merel A. Schalkers","submitted_at":"2022-11-25T17:59:09Z","abstract_excerpt":"We present a scalable algorithm for solving the transport equation in two and three spatial dimensions for variable grid sizes and discrete velocities on a fault-tolerant universal quantum computer. As a proof of concept of our quantum transport method (QTM), we describe a full-circuit start-to-end implementation in Qiskit and present numerical results for 2D flows. Our QTM is based on a novel streaming approach which leads to a reduction in the amount of CNOT gates required in comparison to state-of-the-art quantum streaming methods. As a second highlight we present a novel object encoding me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14269","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/2211.14269/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":"2211.14269","created_at":"2026-07-05T10:02:39.680857+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.14269v2","created_at":"2026-07-05T10:02:39.680857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14269","created_at":"2026-07-05T10:02:39.680857+00:00"},{"alias_kind":"pith_short_12","alias_value":"HI5NJROS3VV2","created_at":"2026-07-05T10:02:39.680857+00:00"},{"alias_kind":"pith_short_16","alias_value":"HI5NJROS3VV2A7LT","created_at":"2026-07-05T10:02:39.680857+00:00"},{"alias_kind":"pith_short_8","alias_value":"HI5NJROS","created_at":"2026-07-05T10:02:39.680857+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02131","citing_title":"Dynamic Circuits for the Quantum Lattice-Boltzmann Method","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HI5NJROS3VV2A7LTJJ46UOWZTQ","json":"https://pith.science/pith/HI5NJROS3VV2A7LTJJ46UOWZTQ.json","graph_json":"https://pith.science/api/pith-number/HI5NJROS3VV2A7LTJJ46UOWZTQ/graph.json","events_json":"https://pith.science/api/pith-number/HI5NJROS3VV2A7LTJJ46UOWZTQ/events.json","paper":"https://pith.science/paper/HI5NJROS"},"agent_actions":{"view_html":"https://pith.science/pith/HI5NJROS3VV2A7LTJJ46UOWZTQ","download_json":"https://pith.science/pith/HI5NJROS3VV2A7LTJJ46UOWZTQ.json","view_paper":"https://pith.science/paper/HI5NJROS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.14269&json=true","fetch_graph":"https://pith.science/api/pith-number/HI5NJROS3VV2A7LTJJ46UOWZTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HI5NJROS3VV2A7LTJJ46UOWZTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HI5NJROS3VV2A7LTJJ46UOWZTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HI5NJROS3VV2A7LTJJ46UOWZTQ/action/storage_attestation","attest_author":"https://pith.science/pith/HI5NJROS3VV2A7LTJJ46UOWZTQ/action/author_attestation","sign_citation":"https://pith.science/pith/HI5NJROS3VV2A7LTJJ46UOWZTQ/action/citation_signature","submit_replication":"https://pith.science/pith/HI5NJROS3VV2A7LTJJ46UOWZTQ/action/replication_record"}},"created_at":"2026-07-05T10:02:39.680857+00:00","updated_at":"2026-07-05T10:02:39.680857+00:00"}