{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RN3ZFNBBCFMSBWV6X2XFKZJIAX","short_pith_number":"pith:RN3ZFNBB","schema_version":"1.0","canonical_sha256":"8b7792b421115920dabebeae55652805c1b2e9a37a9022ae923d9ba921a82c21","source":{"kind":"arxiv","id":"2506.21751","version":1},"attestation_state":"computed","paper":{"title":"Arbitrary Boundary Conditions and Constraints in Quantum Algorithms for Differential Equations via Penalty Projections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Jin-Peng Liu, Nathan Wiebe, Philipp Schleich, Tyler Kharazi, Xiangyu Li","submitted_at":"2025-06-26T20:14:32Z","abstract_excerpt":"Complicated boundary conditions are essential to accurately describe phenomena arising in nature and engineering. Recently, the investigation of a potential speedup through quantum algorithms in simulating the governing ordinary and partial differential equations of such phenomena has gained increasing attention. We design an efficient quantum algorithms for solving differential equations with arbitrary boundary conditions. Specifically, we propose an approach to enforce arbitrary boundary conditions and constraints through adding a penalty projection to the governing equations. Assuming a fas"},"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":"2506.21751","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-26T20:14:32Z","cross_cats_sorted":[],"title_canon_sha256":"0c7ffdfc45aa2bf4e48da359b9595d008a11fc4ea5e8e2c299368f26e563579b","abstract_canon_sha256":"866301ba9e5b284b78ed70945b2caa81513bfc3076c42e03ade6d7ab96380d94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:00.490390Z","signature_b64":"tKEhU882D6U6JEl28h/dzjwEkwGgsatGybKI3hayDkfsPqka7jQAQEYqo32alSNEmruDg5xl6W43zPeAk+ZgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b7792b421115920dabebeae55652805c1b2e9a37a9022ae923d9ba921a82c21","last_reissued_at":"2026-07-05T11:28:00.489904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:00.489904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arbitrary Boundary Conditions and Constraints in Quantum Algorithms for Differential Equations via Penalty Projections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Jin-Peng Liu, Nathan Wiebe, Philipp Schleich, Tyler Kharazi, Xiangyu Li","submitted_at":"2025-06-26T20:14:32Z","abstract_excerpt":"Complicated boundary conditions are essential to accurately describe phenomena arising in nature and engineering. Recently, the investigation of a potential speedup through quantum algorithms in simulating the governing ordinary and partial differential equations of such phenomena has gained increasing attention. We design an efficient quantum algorithms for solving differential equations with arbitrary boundary conditions. Specifically, we propose an approach to enforce arbitrary boundary conditions and constraints through adding a penalty projection to the governing equations. Assuming a fas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.21751","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/2506.21751/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":"2506.21751","created_at":"2026-07-05T11:28:00.489961+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.21751v1","created_at":"2026-07-05T11:28:00.489961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.21751","created_at":"2026-07-05T11:28:00.489961+00:00"},{"alias_kind":"pith_short_12","alias_value":"RN3ZFNBBCFMS","created_at":"2026-07-05T11:28:00.489961+00:00"},{"alias_kind":"pith_short_16","alias_value":"RN3ZFNBBCFMSBWV6","created_at":"2026-07-05T11:28:00.489961+00:00"},{"alias_kind":"pith_short_8","alias_value":"RN3ZFNBB","created_at":"2026-07-05T11:28:00.489961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00222","citing_title":"How to make quantum cheese: efficient geometry oracles for exponentially many pseudorandom microstructures","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24899","citing_title":"From Meta Idea to Advanced Mathematical Discovery -- Human-AI Co-Discovery of Sign-Embedding Quantum Algorithms","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20071","citing_title":"Quantum Algorithms for Nonlinear Differential Equations via Pivot-Shifted Carleman Linearization","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RN3ZFNBBCFMSBWV6X2XFKZJIAX","json":"https://pith.science/pith/RN3ZFNBBCFMSBWV6X2XFKZJIAX.json","graph_json":"https://pith.science/api/pith-number/RN3ZFNBBCFMSBWV6X2XFKZJIAX/graph.json","events_json":"https://pith.science/api/pith-number/RN3ZFNBBCFMSBWV6X2XFKZJIAX/events.json","paper":"https://pith.science/paper/RN3ZFNBB"},"agent_actions":{"view_html":"https://pith.science/pith/RN3ZFNBBCFMSBWV6X2XFKZJIAX","download_json":"https://pith.science/pith/RN3ZFNBBCFMSBWV6X2XFKZJIAX.json","view_paper":"https://pith.science/paper/RN3ZFNBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.21751&json=true","fetch_graph":"https://pith.science/api/pith-number/RN3ZFNBBCFMSBWV6X2XFKZJIAX/graph.json","fetch_events":"https://pith.science/api/pith-number/RN3ZFNBBCFMSBWV6X2XFKZJIAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RN3ZFNBBCFMSBWV6X2XFKZJIAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RN3ZFNBBCFMSBWV6X2XFKZJIAX/action/storage_attestation","attest_author":"https://pith.science/pith/RN3ZFNBBCFMSBWV6X2XFKZJIAX/action/author_attestation","sign_citation":"https://pith.science/pith/RN3ZFNBBCFMSBWV6X2XFKZJIAX/action/citation_signature","submit_replication":"https://pith.science/pith/RN3ZFNBBCFMSBWV6X2XFKZJIAX/action/replication_record"}},"created_at":"2026-07-05T11:28:00.489961+00:00","updated_at":"2026-07-05T11:28:00.489961+00:00"}