{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LA2VW3WLP4ZPTL36S2HQLRVZUK","short_pith_number":"pith:LA2VW3WL","schema_version":"1.0","canonical_sha256":"58355b6ecb7f32f9af7e968f05c6b9a2ae5c7faea4b45ecd6e38111f80a16d48","source":{"kind":"arxiv","id":"2404.07466","version":1},"attestation_state":"computed","paper":{"title":"Quantum Multigrid Algorithm for Finite Element Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Osama Muhammad Raisuddin, Suvranu De","submitted_at":"2024-04-11T04:08:24Z","abstract_excerpt":"Quantum linear system algorithms (QLSAs) can provide exponential speedups for the solution of linear systems, but the growth of the condition number for finite element problems can eliminate the exponential speedup. QLSAs are also incapable of using an initial guess of a solution to improve upon it. To circumvent these issues, we present a Quantum Multigrid Algorithm (qMG) for the iterative solution of linear systems by applying the sequence of multigrid operations on a quantum state. Given an initial guess with error e_0, qMG can produce a vector encoding the entire sequence of multigrid iter"},"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":"2404.07466","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-11T04:08:24Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"3628a42b3798a9ce0f76aeef0fdd608dd84fb27e69ddfcc561184c9e404ae52e","abstract_canon_sha256":"97dd243c0c1de7bbb2eeabe2846be5f45b614ae848b4909b0dd74dd1e24f8a6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:53.436287Z","signature_b64":"3vjR336+POrpcJxVXB+ISsaPsNO9jovs47gyWE/WnR4pG6NnW9vhZK5gQ3SCt/XnQhSP0lDwYXctiQPJqAhiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58355b6ecb7f32f9af7e968f05c6b9a2ae5c7faea4b45ecd6e38111f80a16d48","last_reissued_at":"2026-07-05T08:06:53.435871Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:53.435871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Multigrid Algorithm for Finite Element Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Osama Muhammad Raisuddin, Suvranu De","submitted_at":"2024-04-11T04:08:24Z","abstract_excerpt":"Quantum linear system algorithms (QLSAs) can provide exponential speedups for the solution of linear systems, but the growth of the condition number for finite element problems can eliminate the exponential speedup. QLSAs are also incapable of using an initial guess of a solution to improve upon it. To circumvent these issues, we present a Quantum Multigrid Algorithm (qMG) for the iterative solution of linear systems by applying the sequence of multigrid operations on a quantum state. Given an initial guess with error e_0, qMG can produce a vector encoding the entire sequence of multigrid iter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07466","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/2404.07466/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":"2404.07466","created_at":"2026-07-05T08:06:53.435928+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.07466v1","created_at":"2026-07-05T08:06:53.435928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07466","created_at":"2026-07-05T08:06:53.435928+00:00"},{"alias_kind":"pith_short_12","alias_value":"LA2VW3WLP4ZP","created_at":"2026-07-05T08:06:53.435928+00:00"},{"alias_kind":"pith_short_16","alias_value":"LA2VW3WLP4ZPTL36","created_at":"2026-07-05T08:06:53.435928+00:00"},{"alias_kind":"pith_short_8","alias_value":"LA2VW3WL","created_at":"2026-07-05T08:06:53.435928+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14259","citing_title":"Addressing the Readout Problem in Quantum Differential Equation Algorithms with Quantum Scientific Machine Learning","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LA2VW3WLP4ZPTL36S2HQLRVZUK","json":"https://pith.science/pith/LA2VW3WLP4ZPTL36S2HQLRVZUK.json","graph_json":"https://pith.science/api/pith-number/LA2VW3WLP4ZPTL36S2HQLRVZUK/graph.json","events_json":"https://pith.science/api/pith-number/LA2VW3WLP4ZPTL36S2HQLRVZUK/events.json","paper":"https://pith.science/paper/LA2VW3WL"},"agent_actions":{"view_html":"https://pith.science/pith/LA2VW3WLP4ZPTL36S2HQLRVZUK","download_json":"https://pith.science/pith/LA2VW3WLP4ZPTL36S2HQLRVZUK.json","view_paper":"https://pith.science/paper/LA2VW3WL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.07466&json=true","fetch_graph":"https://pith.science/api/pith-number/LA2VW3WLP4ZPTL36S2HQLRVZUK/graph.json","fetch_events":"https://pith.science/api/pith-number/LA2VW3WLP4ZPTL36S2HQLRVZUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LA2VW3WLP4ZPTL36S2HQLRVZUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LA2VW3WLP4ZPTL36S2HQLRVZUK/action/storage_attestation","attest_author":"https://pith.science/pith/LA2VW3WLP4ZPTL36S2HQLRVZUK/action/author_attestation","sign_citation":"https://pith.science/pith/LA2VW3WLP4ZPTL36S2HQLRVZUK/action/citation_signature","submit_replication":"https://pith.science/pith/LA2VW3WLP4ZPTL36S2HQLRVZUK/action/replication_record"}},"created_at":"2026-07-05T08:06:53.435928+00:00","updated_at":"2026-07-05T08:06:53.435928+00:00"}