{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CG7KUIE6CKGGFJDN4BJT3GRZT7","short_pith_number":"pith:CG7KUIE6","schema_version":"1.0","canonical_sha256":"11beaa209e128c62a46de0533d9a399fcf31fd54bf31e68dead46b3dd3cd12d6","source":{"kind":"arxiv","id":"2404.05934","version":2},"attestation_state":"computed","paper":{"title":"Verification of Recursively Defined Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Zhicheng Zhang","submitted_at":"2024-04-09T01:35:13Z","abstract_excerpt":"Recursive techniques have recently been introduced into quantum programming so that a variety of large quantum circuits and algorithms can be elegantly and economically programmed. In this paper, we present a proof system for formal verification of the correctness of recursively defined quantum circuits. The soundness and (relative) completeness of the proof system are established. To demonstrating its effectiveness, a series of application examples of the proof system are given, including (multi-qubit) controlled gates, a quantum circuit generating (multi-qubit) GHZ (Greenberger-Horne-Zeiling"},"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":"2404.05934","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-04-09T01:35:13Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"1a41121351952a114c2a3a9e36deae2cf449ecac89d4c706b69c700ab041f551","abstract_canon_sha256":"34d50b7389035a77e89db1244f53f71f343cd0f6d607f1cf4666e2857c6d0cff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:06.828369Z","signature_b64":"ZjNj3IKpWptR2RgMUzffm7x9X9gp6Go+yKod1ZmEzl39oxpyy0X97AH8A8aEh/71uJTegmE1nDlC2wPtjkBxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11beaa209e128c62a46de0533d9a399fcf31fd54bf31e68dead46b3dd3cd12d6","last_reissued_at":"2026-07-05T09:32:06.827897Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:06.827897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification of Recursively Defined Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Zhicheng Zhang","submitted_at":"2024-04-09T01:35:13Z","abstract_excerpt":"Recursive techniques have recently been introduced into quantum programming so that a variety of large quantum circuits and algorithms can be elegantly and economically programmed. In this paper, we present a proof system for formal verification of the correctness of recursively defined quantum circuits. The soundness and (relative) completeness of the proof system are established. To demonstrating its effectiveness, a series of application examples of the proof system are given, including (multi-qubit) controlled gates, a quantum circuit generating (multi-qubit) GHZ (Greenberger-Horne-Zeiling"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05934","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/2404.05934/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":"2404.05934","created_at":"2026-07-05T09:32:06.827955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.05934v2","created_at":"2026-07-05T09:32:06.827955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05934","created_at":"2026-07-05T09:32:06.827955+00:00"},{"alias_kind":"pith_short_12","alias_value":"CG7KUIE6CKGG","created_at":"2026-07-05T09:32:06.827955+00:00"},{"alias_kind":"pith_short_16","alias_value":"CG7KUIE6CKGGFJDN","created_at":"2026-07-05T09:32:06.827955+00:00"},{"alias_kind":"pith_short_8","alias_value":"CG7KUIE6","created_at":"2026-07-05T09:32:06.827955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.09869","citing_title":"A Practical Quantum Hoare Logic with Classical Variables, I","ref_index":65,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CG7KUIE6CKGGFJDN4BJT3GRZT7","json":"https://pith.science/pith/CG7KUIE6CKGGFJDN4BJT3GRZT7.json","graph_json":"https://pith.science/api/pith-number/CG7KUIE6CKGGFJDN4BJT3GRZT7/graph.json","events_json":"https://pith.science/api/pith-number/CG7KUIE6CKGGFJDN4BJT3GRZT7/events.json","paper":"https://pith.science/paper/CG7KUIE6"},"agent_actions":{"view_html":"https://pith.science/pith/CG7KUIE6CKGGFJDN4BJT3GRZT7","download_json":"https://pith.science/pith/CG7KUIE6CKGGFJDN4BJT3GRZT7.json","view_paper":"https://pith.science/paper/CG7KUIE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.05934&json=true","fetch_graph":"https://pith.science/api/pith-number/CG7KUIE6CKGGFJDN4BJT3GRZT7/graph.json","fetch_events":"https://pith.science/api/pith-number/CG7KUIE6CKGGFJDN4BJT3GRZT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CG7KUIE6CKGGFJDN4BJT3GRZT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CG7KUIE6CKGGFJDN4BJT3GRZT7/action/storage_attestation","attest_author":"https://pith.science/pith/CG7KUIE6CKGGFJDN4BJT3GRZT7/action/author_attestation","sign_citation":"https://pith.science/pith/CG7KUIE6CKGGFJDN4BJT3GRZT7/action/citation_signature","submit_replication":"https://pith.science/pith/CG7KUIE6CKGGFJDN4BJT3GRZT7/action/replication_record"}},"created_at":"2026-07-05T09:32:06.827955+00:00","updated_at":"2026-07-05T09:32:06.827955+00:00"}