{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JFYCDDIJ2ABE6EET2AJXFJMCQ2","short_pith_number":"pith:JFYCDDIJ","schema_version":"1.0","canonical_sha256":"4970218d09d0024f1093d01372a582868f2b82ed12138caf767db8508fbbf9fb","source":{"kind":"arxiv","id":"2311.11503","version":2},"attestation_state":"computed","paper":{"title":"A Case for Synthesis of Recursive Quantum Unitary Programs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Haowei Deng, Runzhou Tao, Xiaodi Wu, Yuxiang Peng","submitted_at":"2023-11-20T03:01:36Z","abstract_excerpt":"Quantum programs are notoriously difficult to code and verify due to unintuitive quantum knowledge associated with quantum programming. Automated tools relieving the tedium and errors associated with low-level quantum details would hence be highly desirable. In this paper, we initiate the study of program synthesis for quantum unitary programs that recursively define a family of unitary circuits for different input sizes, which are widely used in existing quantum programming languages. Specifically, we present QSynth, the first quantum program synthesis framework, including a new inductive qua"},"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":"2311.11503","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-20T03:01:36Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"eb0f832d83a69d339cca4ce562c6f88af7c2f1ecd62058515db2b4dae45a2775","abstract_canon_sha256":"19e73d239084ed8e7db1c30aded8f15bbb45f62e9474eb054b24ffa33dcab248"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:20:55.279193Z","signature_b64":"LBXZ1X5mZDUuTd2B6EmkDX37QsiN3bvvpOG3z4DQE2hBNpSzC3OYXY0wjiOVuwJx/vtotDDSkH9vWK3Ex4XvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4970218d09d0024f1093d01372a582868f2b82ed12138caf767db8508fbbf9fb","last_reissued_at":"2026-07-05T07:20:55.278667Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:20:55.278667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Case for Synthesis of Recursive Quantum Unitary Programs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Haowei Deng, Runzhou Tao, Xiaodi Wu, Yuxiang Peng","submitted_at":"2023-11-20T03:01:36Z","abstract_excerpt":"Quantum programs are notoriously difficult to code and verify due to unintuitive quantum knowledge associated with quantum programming. Automated tools relieving the tedium and errors associated with low-level quantum details would hence be highly desirable. In this paper, we initiate the study of program synthesis for quantum unitary programs that recursively define a family of unitary circuits for different input sizes, which are widely used in existing quantum programming languages. Specifically, we present QSynth, the first quantum program synthesis framework, including a new inductive qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.11503","kind":"arxiv","version":2},"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/2311.11503/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":"2311.11503","created_at":"2026-07-05T07:20:55.278722+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.11503v2","created_at":"2026-07-05T07:20:55.278722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.11503","created_at":"2026-07-05T07:20:55.278722+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFYCDDIJ2ABE","created_at":"2026-07-05T07:20:55.278722+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFYCDDIJ2ABE6EET","created_at":"2026-07-05T07:20:55.278722+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFYCDDIJ","created_at":"2026-07-05T07:20:55.278722+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JFYCDDIJ2ABE6EET2AJXFJMCQ2","json":"https://pith.science/pith/JFYCDDIJ2ABE6EET2AJXFJMCQ2.json","graph_json":"https://pith.science/api/pith-number/JFYCDDIJ2ABE6EET2AJXFJMCQ2/graph.json","events_json":"https://pith.science/api/pith-number/JFYCDDIJ2ABE6EET2AJXFJMCQ2/events.json","paper":"https://pith.science/paper/JFYCDDIJ"},"agent_actions":{"view_html":"https://pith.science/pith/JFYCDDIJ2ABE6EET2AJXFJMCQ2","download_json":"https://pith.science/pith/JFYCDDIJ2ABE6EET2AJXFJMCQ2.json","view_paper":"https://pith.science/paper/JFYCDDIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.11503&json=true","fetch_graph":"https://pith.science/api/pith-number/JFYCDDIJ2ABE6EET2AJXFJMCQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/JFYCDDIJ2ABE6EET2AJXFJMCQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFYCDDIJ2ABE6EET2AJXFJMCQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFYCDDIJ2ABE6EET2AJXFJMCQ2/action/storage_attestation","attest_author":"https://pith.science/pith/JFYCDDIJ2ABE6EET2AJXFJMCQ2/action/author_attestation","sign_citation":"https://pith.science/pith/JFYCDDIJ2ABE6EET2AJXFJMCQ2/action/citation_signature","submit_replication":"https://pith.science/pith/JFYCDDIJ2ABE6EET2AJXFJMCQ2/action/replication_record"}},"created_at":"2026-07-05T07:20:55.278722+00:00","updated_at":"2026-07-05T07:20:55.278722+00:00"}