{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2DSWA6W3XR7VBGZVVG7UOQK2Q5","short_pith_number":"pith:2DSWA6W3","schema_version":"1.0","canonical_sha256":"d0e5607adbbc7f509b35a9bf47415a877be1d11027551589704b2b62760ed831","source":{"kind":"arxiv","id":"2109.02409","version":1},"attestation_state":"computed","paper":{"title":"QSSA: An SSA-based IR for Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Anurudh Peduri, Siddharth Bhat","submitted_at":"2021-09-06T12:45:02Z","abstract_excerpt":"Quantum computing hardware has progressed rapidly. Simultaneously, there has been a proliferation of programming languages and program optimization tools for quantum computing. Existing quantum compilers use intermediate representations (IRs) where quantum programs are described as circuits. Such IRs fail to leverage existing work on compiler optimizations. In such IRs, it is non-trivial to statically check for physical constraints such as the no-cloning theorem, which states that qubits cannot be copied. We introduce QSSA, a novel quantum IR based on static single assignment (SSA) that enable"},"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":"2109.02409","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-09-06T12:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"a011ed12da7693ee07e007ee324aa30bf31d835db50d85c6bb5b5b679a5145af","abstract_canon_sha256":"ff235455b2b56ef2f0bc026af512af4085a7c964e46f7f1080bd143914224d5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:08:25.589046Z","signature_b64":"LOJXeUNM6kqN9f2zQ3aJUOHgGahjvGkNABZz++/mY3fouHC6S0Gldnmz2CTPspbJ6/iDE/q9v5Ss/lgY7k7HCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0e5607adbbc7f509b35a9bf47415a877be1d11027551589704b2b62760ed831","last_reissued_at":"2026-07-05T04:08:25.588563Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:08:25.588563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QSSA: An SSA-based IR for Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Anurudh Peduri, Siddharth Bhat","submitted_at":"2021-09-06T12:45:02Z","abstract_excerpt":"Quantum computing hardware has progressed rapidly. Simultaneously, there has been a proliferation of programming languages and program optimization tools for quantum computing. Existing quantum compilers use intermediate representations (IRs) where quantum programs are described as circuits. Such IRs fail to leverage existing work on compiler optimizations. In such IRs, it is non-trivial to statically check for physical constraints such as the no-cloning theorem, which states that qubits cannot be copied. We introduce QSSA, a novel quantum IR based on static single assignment (SSA) that enable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.02409","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/2109.02409/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":"2109.02409","created_at":"2026-07-05T04:08:25.588621+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.02409v1","created_at":"2026-07-05T04:08:25.588621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.02409","created_at":"2026-07-05T04:08:25.588621+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DSWA6W3XR7V","created_at":"2026-07-05T04:08:25.588621+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DSWA6W3XR7VBGZV","created_at":"2026-07-05T04:08:25.588621+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DSWA6W3","created_at":"2026-07-05T04:08:25.588621+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.02616","citing_title":"MLIR for Quantum Beyond Gate Cancellation: Quantum Circuit Mapping Reimagined","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2DSWA6W3XR7VBGZVVG7UOQK2Q5","json":"https://pith.science/pith/2DSWA6W3XR7VBGZVVG7UOQK2Q5.json","graph_json":"https://pith.science/api/pith-number/2DSWA6W3XR7VBGZVVG7UOQK2Q5/graph.json","events_json":"https://pith.science/api/pith-number/2DSWA6W3XR7VBGZVVG7UOQK2Q5/events.json","paper":"https://pith.science/paper/2DSWA6W3"},"agent_actions":{"view_html":"https://pith.science/pith/2DSWA6W3XR7VBGZVVG7UOQK2Q5","download_json":"https://pith.science/pith/2DSWA6W3XR7VBGZVVG7UOQK2Q5.json","view_paper":"https://pith.science/paper/2DSWA6W3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.02409&json=true","fetch_graph":"https://pith.science/api/pith-number/2DSWA6W3XR7VBGZVVG7UOQK2Q5/graph.json","fetch_events":"https://pith.science/api/pith-number/2DSWA6W3XR7VBGZVVG7UOQK2Q5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DSWA6W3XR7VBGZVVG7UOQK2Q5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DSWA6W3XR7VBGZVVG7UOQK2Q5/action/storage_attestation","attest_author":"https://pith.science/pith/2DSWA6W3XR7VBGZVVG7UOQK2Q5/action/author_attestation","sign_citation":"https://pith.science/pith/2DSWA6W3XR7VBGZVVG7UOQK2Q5/action/citation_signature","submit_replication":"https://pith.science/pith/2DSWA6W3XR7VBGZVVG7UOQK2Q5/action/replication_record"}},"created_at":"2026-07-05T04:08:25.588621+00:00","updated_at":"2026-07-05T04:08:25.588621+00:00"}