{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YOL7XSEMU7FLZSCKPQVLK5J2XR","short_pith_number":"pith:YOL7XSEM","schema_version":"1.0","canonical_sha256":"c397fbc88ca7cabcc84a7c2ab5753abc767f5c47ad1ebdfdd0a04ac314128250","source":{"kind":"arxiv","id":"2405.09767","version":3},"attestation_state":"computed","paper":{"title":"Compact quantum algorithms for time-dependent differential equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.app-ph","physics.comp-ph","physics.flu-dyn"],"primary_cat":"quant-ph","authors_text":"Katepalli R. Sreenivasan, Sachin S. Bharadwaj","submitted_at":"2024-05-16T02:14:58Z","abstract_excerpt":"Many claims of computational advantages have been made for quantum computing over classical, but they have not been demonstrated for practical problems. Here, we present algorithms for solving time-dependent PDEs, with particular reference to fluid equations. We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems, and generate hybrid quantum-classical algorithms that efficiently perform iterative matrix-vector multiplication and matrix inversion operations. These algorithms are end-to-end, with relatively low-depth quantum circuits 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":"2405.09767","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-16T02:14:58Z","cross_cats_sorted":["physics.app-ph","physics.comp-ph","physics.flu-dyn"],"title_canon_sha256":"1df12787255b147e3ce6bd0d2fc7372ca02437ef481c0c668f17e1784fcdcdce","abstract_canon_sha256":"01d85dab1b911a2a835a0e7e9db035be6ddfa336170a5642ab3c6ca34f14e9ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:32.860067Z","signature_b64":"vH62bHJcNrPFvztwbWyP0fFf2hyheIaB0BbPE4o7I4MiPzn5rs/Rb0H6N8/hROD7ubQPDOA6joKhUGR3iy3aAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c397fbc88ca7cabcc84a7c2ab5753abc767f5c47ad1ebdfdd0a04ac314128250","last_reissued_at":"2026-07-05T11:21:32.859643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:32.859643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compact quantum algorithms for time-dependent differential equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.app-ph","physics.comp-ph","physics.flu-dyn"],"primary_cat":"quant-ph","authors_text":"Katepalli R. Sreenivasan, Sachin S. Bharadwaj","submitted_at":"2024-05-16T02:14:58Z","abstract_excerpt":"Many claims of computational advantages have been made for quantum computing over classical, but they have not been demonstrated for practical problems. Here, we present algorithms for solving time-dependent PDEs, with particular reference to fluid equations. We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems, and generate hybrid quantum-classical algorithms that efficiently perform iterative matrix-vector multiplication and matrix inversion operations. These algorithms are end-to-end, with relatively low-depth quantum circuits t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.09767","kind":"arxiv","version":3},"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/2405.09767/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":"2405.09767","created_at":"2026-07-05T11:21:32.859699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.09767v3","created_at":"2026-07-05T11:21:32.859699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.09767","created_at":"2026-07-05T11:21:32.859699+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOL7XSEMU7FL","created_at":"2026-07-05T11:21:32.859699+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOL7XSEMU7FLZSCK","created_at":"2026-07-05T11:21:32.859699+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOL7XSEM","created_at":"2026-07-05T11:21:32.859699+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21751","citing_title":"Arbitrary Boundary Conditions and Constraints in Quantum Algorithms for Differential Equations via Penalty Projections","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YOL7XSEMU7FLZSCKPQVLK5J2XR","json":"https://pith.science/pith/YOL7XSEMU7FLZSCKPQVLK5J2XR.json","graph_json":"https://pith.science/api/pith-number/YOL7XSEMU7FLZSCKPQVLK5J2XR/graph.json","events_json":"https://pith.science/api/pith-number/YOL7XSEMU7FLZSCKPQVLK5J2XR/events.json","paper":"https://pith.science/paper/YOL7XSEM"},"agent_actions":{"view_html":"https://pith.science/pith/YOL7XSEMU7FLZSCKPQVLK5J2XR","download_json":"https://pith.science/pith/YOL7XSEMU7FLZSCKPQVLK5J2XR.json","view_paper":"https://pith.science/paper/YOL7XSEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.09767&json=true","fetch_graph":"https://pith.science/api/pith-number/YOL7XSEMU7FLZSCKPQVLK5J2XR/graph.json","fetch_events":"https://pith.science/api/pith-number/YOL7XSEMU7FLZSCKPQVLK5J2XR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOL7XSEMU7FLZSCKPQVLK5J2XR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOL7XSEMU7FLZSCKPQVLK5J2XR/action/storage_attestation","attest_author":"https://pith.science/pith/YOL7XSEMU7FLZSCKPQVLK5J2XR/action/author_attestation","sign_citation":"https://pith.science/pith/YOL7XSEMU7FLZSCKPQVLK5J2XR/action/citation_signature","submit_replication":"https://pith.science/pith/YOL7XSEMU7FLZSCKPQVLK5J2XR/action/replication_record"}},"created_at":"2026-07-05T11:21:32.859699+00:00","updated_at":"2026-07-05T11:21:32.859699+00:00"}