{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:R7Y5RTQT5K5HYW4OEEZWSPJM4C","short_pith_number":"pith:R7Y5RTQT","schema_version":"1.0","canonical_sha256":"8ff1d8ce13eaba7c5b8e2133693d2ce087861efdea2c2953fccc39d46c563797","source":{"kind":"arxiv","id":"2409.04643","version":1},"attestation_state":"computed","paper":{"title":"Expressing and Analyzing Quantum Algorithms with Qualtran","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Anurudh Peduri, Charles Yuan, Fionn D. Malone, Matthew P. Harrigan, Nicholas C. Rubin, Noureldin Yosri, Ryan Babbush, Tanuj Khattar","submitted_at":"2024-09-06T22:24:59Z","abstract_excerpt":"Quantum computing's transition from theory to reality has spurred the need for novel software tools to manage the increasing complexity, sophistication, toil, and fallibility of quantum algorithm development. We present Qualtran, an open-source library for representing and analyzing quantum algorithms. Using appropriate abstractions and data structures, we can simulate and test algorithms, automatically generate information-rich diagrams, and tabulate resource requirements. Qualtran offers a standard library of algorithmic building blocks that are essential for modern cost-minimizing compilati"},"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":"2409.04643","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-09-06T22:24:59Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"a64fa21bac3136891d36234f894a5474939c0eaf379ecb8f4f17f3e97b218f5c","abstract_canon_sha256":"8440fbe766d1afc62ca28ddade70629278bfc36fa20ceafdb2698148bcaa7b19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:15.680793Z","signature_b64":"9q9Zi1vum69UrAb8R6mUx20Ba0wpF2PeTDKsb6w96Wa0kRdttm6YNcix9H+ctv+2xMUQ+kuEXYkTbnukrMNiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ff1d8ce13eaba7c5b8e2133693d2ce087861efdea2c2953fccc39d46c563797","last_reissued_at":"2026-07-05T09:04:15.680380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:15.680380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expressing and Analyzing Quantum Algorithms with Qualtran","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Anurudh Peduri, Charles Yuan, Fionn D. Malone, Matthew P. Harrigan, Nicholas C. Rubin, Noureldin Yosri, Ryan Babbush, Tanuj Khattar","submitted_at":"2024-09-06T22:24:59Z","abstract_excerpt":"Quantum computing's transition from theory to reality has spurred the need for novel software tools to manage the increasing complexity, sophistication, toil, and fallibility of quantum algorithm development. We present Qualtran, an open-source library for representing and analyzing quantum algorithms. Using appropriate abstractions and data structures, we can simulate and test algorithms, automatically generate information-rich diagrams, and tabulate resource requirements. Qualtran offers a standard library of algorithmic building blocks that are essential for modern cost-minimizing compilati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04643","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/2409.04643/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":"2409.04643","created_at":"2026-07-05T09:04:15.680436+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.04643v1","created_at":"2026-07-05T09:04:15.680436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04643","created_at":"2026-07-05T09:04:15.680436+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7Y5RTQT5K5H","created_at":"2026-07-05T09:04:15.680436+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7Y5RTQT5K5HYW4O","created_at":"2026-07-05T09:04:15.680436+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7Y5RTQT","created_at":"2026-07-05T09:04:15.680436+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26254","citing_title":"A Survey of Quantum Programming Languages","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28936","citing_title":"Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28489","citing_title":"Faster matrix product state preparation by exploiting symmetry-induced block-sparsity","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2406.09340","citing_title":"Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15297","citing_title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15476","citing_title":"Quantum Circuit Synthesis Using an Exact T Library","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2508.11765","citing_title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","ref_index":107,"is_internal_anchor":false},{"citing_arxiv_id":"2511.01736","citing_title":"Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10768","citing_title":"Unitaria: Quantum Linear Algebra via Block Encodings","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01367","citing_title":"From Characterization To Construction: Generative Quantum Circuit Synthesis from Gate Set Tomography Data","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":195,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09538","citing_title":"Explicit Block Encoding of Difference-of-Gaussian Operators on a Periodic Grid","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18276","citing_title":"Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2508.19160","citing_title":"Architecting Distributed Quantum Computers: Design Insights from Resource Estimation","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R7Y5RTQT5K5HYW4OEEZWSPJM4C","json":"https://pith.science/pith/R7Y5RTQT5K5HYW4OEEZWSPJM4C.json","graph_json":"https://pith.science/api/pith-number/R7Y5RTQT5K5HYW4OEEZWSPJM4C/graph.json","events_json":"https://pith.science/api/pith-number/R7Y5RTQT5K5HYW4OEEZWSPJM4C/events.json","paper":"https://pith.science/paper/R7Y5RTQT"},"agent_actions":{"view_html":"https://pith.science/pith/R7Y5RTQT5K5HYW4OEEZWSPJM4C","download_json":"https://pith.science/pith/R7Y5RTQT5K5HYW4OEEZWSPJM4C.json","view_paper":"https://pith.science/paper/R7Y5RTQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.04643&json=true","fetch_graph":"https://pith.science/api/pith-number/R7Y5RTQT5K5HYW4OEEZWSPJM4C/graph.json","fetch_events":"https://pith.science/api/pith-number/R7Y5RTQT5K5HYW4OEEZWSPJM4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7Y5RTQT5K5HYW4OEEZWSPJM4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7Y5RTQT5K5HYW4OEEZWSPJM4C/action/storage_attestation","attest_author":"https://pith.science/pith/R7Y5RTQT5K5HYW4OEEZWSPJM4C/action/author_attestation","sign_citation":"https://pith.science/pith/R7Y5RTQT5K5HYW4OEEZWSPJM4C/action/citation_signature","submit_replication":"https://pith.science/pith/R7Y5RTQT5K5HYW4OEEZWSPJM4C/action/replication_record"}},"created_at":"2026-07-05T09:04:15.680436+00:00","updated_at":"2026-07-05T09:04:15.680436+00:00"}