{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CPXEMLP7RAPF2EJXMK7X2NCX66","short_pith_number":"pith:CPXEMLP7","schema_version":"1.0","canonical_sha256":"13ee462dff881e5d113762bf7d3457f78c7efd8b544c28e0813ba6e4a8e8deb7","source":{"kind":"arxiv","id":"2511.01736","version":2},"attestation_state":"computed","paper":{"title":"Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits.","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Charles Yuan","submitted_at":"2025-11-03T16:48:13Z","abstract_excerpt":"Quantum algorithms for computational linear algebra promise up to exponential speedups for applications such as simulation and regression, making them prime candidates for hardware realization. But these algorithms execute in a model that cannot efficiently store matrices in memory like a classical algorithm does, instead requiring developers to implement complex expressions for matrix arithmetic in terms of correct and efficient quantum circuits. Among the challenges for the developer is navigating a cost model in which conventional optimizations for linear algebra, such as subexpression reus"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2511.01736","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-11-03T16:48:13Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"2ec4124015c2752c57091d2ce2a433f7c9323c646252ddb35d62afe9bb3e1075","abstract_canon_sha256":"b331f4f30579294a0db6ab4a090ab04fbc5a9e7d4cd4250ed085e67cc9c72d92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.018511Z","signature_b64":"m5D8gChZH2n3VL+ljtlE8o738XhF3I3LxRtF07NfhpjN525+NIHC/Rxd5D9rS93+NiAAF6Am+TKEd+TbFt+vCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ee462dff881e5d113762bf7d3457f78c7efd8b544c28e0813ba6e4a8e8deb7","last_reissued_at":"2026-05-18T02:44:33.018031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.018031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits.","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Charles Yuan","submitted_at":"2025-11-03T16:48:13Z","abstract_excerpt":"Quantum algorithms for computational linear algebra promise up to exponential speedups for applications such as simulation and regression, making them prime candidates for hardware realization. But these algorithms execute in a model that cannot efficiently store matrices in memory like a classical algorithm does, instead requiring developers to implement complex expressions for matrix arithmetic in terms of correct and efficient quantum circuits. Among the challenges for the developer is navigating a cost model in which conventional optimizations for linear algebra, such as subexpression reus"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Cobble enables developers to express and manipulate the quantum representations of matrices, known as block encodings, using high-level notation that automatically compiles to correct quantum circuits, with analyses and optimizations that reduce overhead and generate efficient circuits using state-of-the-art techniques such as the quantum singular value transformation, showing 2.6x-25.4x speedups on benchmarks.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the high-level notation and automatic compilation process in Cobble can produce circuits that are both semantically correct and measurably more efficient than hand-written implementations across the evaluated application domains without hidden correctness or performance issues.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"49aaccb39b54f2404383b740e9c1846eaae2efd8bd46c070484faa2ddddce06e"},"source":{"id":"2511.01736","kind":"arxiv","version":2},"verdict":{"id":"59626706-b5fb-4ff1-ab22-e7187d0d7870","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T01:49:38.213842Z","strongest_claim":"Cobble enables developers to express and manipulate the quantum representations of matrices, known as block encodings, using high-level notation that automatically compiles to correct quantum circuits, with analyses and optimizations that reduce overhead and generate efficient circuits using state-of-the-art techniques such as the quantum singular value transformation, showing 2.6x-25.4x speedups on benchmarks.","one_line_summary":"Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the high-level notation and automatic compilation process in Cobble can produce circuits that are both semantically correct and measurably more efficient than hand-written implementations across the evaluated application domains without hidden correctness or performance issues.","pith_extraction_headline":"Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits."},"references":{"count":68,"sample":[{"doi":"10.48550/arxiv.1605.08695","year":null,"title":"Murray, Benoit Steiner, Paul Tucker, Vijay Vasudevan, Pete Warden, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng","work_id":"53ef73a0-9b26-4048-8b67-96b9bd61a1d1","ref_index":1,"cited_arxiv_id":"1605.08695","is_internal_anchor":true},{"doi":"10.48550/arxiv.2404.12603","year":null,"title":"arXiv:2404.12603 [quant-ph] doi:10.48550/arXiv.2404.12603 Matthew Amy, Dmitri Maslov, and Michele Mosca","work_id":"f500e414-b99c-4200-9d02-ba9032a20ba7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/tcad.2014.2341953","year":2014,"title":"doi:10.1109/TCAD.2014.2341953 E","work_id":"93a365ce-af16-4b36-bfe5-997e1b8cc48b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/superc.1990.129995","year":1990,"title":"InACM/IEEE Conference on Supercomputing","work_id":"ef89b20d-4989-416c-b740-2a8ed4a69b36","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3480935","year":2022,"title":"Available: https://doi.org/10.1145/3480935","work_id":"06ab11ec-6a0d-408b-aa44-d067eeb3d68c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":68,"snapshot_sha256":"ec19685d9544f8119444a77974265369fe48484397135179c0f113c7ac63263e","internal_anchors":6},"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":"2511.01736","created_at":"2026-05-18T02:44:33.018105+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.01736v2","created_at":"2026-05-18T02:44:33.018105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.01736","created_at":"2026-05-18T02:44:33.018105+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPXEMLP7RAPF","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPXEMLP7RAPF2EJX","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPXEMLP7","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2605.23358","citing_title":"A Compilation Framework for Quantum Simulation of Non-unitary Dynamics","ref_index":62,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13929","citing_title":"Linear-Time T-Gate Optimization via Random Abstraction","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10768","citing_title":"Unitaria: Quantum Linear Algebra via Block Encodings","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18276","citing_title":"Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66","json":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66.json","graph_json":"https://pith.science/api/pith-number/CPXEMLP7RAPF2EJXMK7X2NCX66/graph.json","events_json":"https://pith.science/api/pith-number/CPXEMLP7RAPF2EJXMK7X2NCX66/events.json","paper":"https://pith.science/paper/CPXEMLP7"},"agent_actions":{"view_html":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66","download_json":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66.json","view_paper":"https://pith.science/paper/CPXEMLP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.01736&json=true","fetch_graph":"https://pith.science/api/pith-number/CPXEMLP7RAPF2EJXMK7X2NCX66/graph.json","fetch_events":"https://pith.science/api/pith-number/CPXEMLP7RAPF2EJXMK7X2NCX66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/action/storage_attestation","attest_author":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/action/author_attestation","sign_citation":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/action/citation_signature","submit_replication":"https://pith.science/pith/CPXEMLP7RAPF2EJXMK7X2NCX66/action/replication_record"}},"created_at":"2026-05-18T02:44:33.018105+00:00","updated_at":"2026-05-18T02:44:33.018105+00:00"}