{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:P7WEZLMTABDKAFH4JQVHAI675E","short_pith_number":"pith:P7WEZLMT","schema_version":"1.0","canonical_sha256":"7fec4cad930046a014fc4c2a7023dfe92485d608a5fb86a49105500cd7ed67c7","source":{"kind":"arxiv","id":"1803.00699","version":1},"attestation_state":"computed","paper":{"title":"QWIRE Practice: Formal Verification of Quantum Circuits in Coq","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.PL"],"primary_cat":"cs.LO","authors_text":"Jennifer Paykin (University of Pennsylvania), Robert Rand (University of Pennsylvania), Steve Zdancewic (University of Pennsylvania)","submitted_at":"2018-03-02T03:46:53Z","abstract_excerpt":"We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving features. The implementation uses higher-order abstract syntax to represent variable binding and provides a type-checking algorithm for linear wire types, ensuring that quantum circuits are well-formed. We formalize a denotational semantics that interprets QWIRE circuits as superoperators on density matrices, and prove the correctness of some simple quantum"},"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":"1803.00699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-02T03:46:53Z","cross_cats_sorted":["cs.ET","cs.PL"],"title_canon_sha256":"c3fde8f537a55c8dca996f8a3612e7be35d87837ac704cbf5313b532d0a1633b","abstract_canon_sha256":"65cd558f71af2af5d6813c688535ec0ed953adf4cecb8162afb1c978accb895b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:08.115848Z","signature_b64":"qLtGUCAyMvckNFaQwZ93BdoC9vpuOLVjNbTLZJP+c0cdZJw/YqqPf/FBSKORop8v++xNIlqMKu12dfRLeLACAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fec4cad930046a014fc4c2a7023dfe92485d608a5fb86a49105500cd7ed67c7","last_reissued_at":"2026-05-18T00:22:08.115226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:08.115226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QWIRE Practice: Formal Verification of Quantum Circuits in Coq","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.PL"],"primary_cat":"cs.LO","authors_text":"Jennifer Paykin (University of Pennsylvania), Robert Rand (University of Pennsylvania), Steve Zdancewic (University of Pennsylvania)","submitted_at":"2018-03-02T03:46:53Z","abstract_excerpt":"We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving features. The implementation uses higher-order abstract syntax to represent variable binding and provides a type-checking algorithm for linear wire types, ensuring that quantum circuits are well-formed. We formalize a denotational semantics that interprets QWIRE circuits as superoperators on density matrices, and prove the correctness of some simple quantum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00699","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":""},"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":"1803.00699","created_at":"2026-05-18T00:22:08.115338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00699v1","created_at":"2026-05-18T00:22:08.115338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00699","created_at":"2026-05-18T00:22:08.115338+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7WEZLMTABDK","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7WEZLMTABDKAFH4","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7WEZLMT","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07973","citing_title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P7WEZLMTABDKAFH4JQVHAI675E","json":"https://pith.science/pith/P7WEZLMTABDKAFH4JQVHAI675E.json","graph_json":"https://pith.science/api/pith-number/P7WEZLMTABDKAFH4JQVHAI675E/graph.json","events_json":"https://pith.science/api/pith-number/P7WEZLMTABDKAFH4JQVHAI675E/events.json","paper":"https://pith.science/paper/P7WEZLMT"},"agent_actions":{"view_html":"https://pith.science/pith/P7WEZLMTABDKAFH4JQVHAI675E","download_json":"https://pith.science/pith/P7WEZLMTABDKAFH4JQVHAI675E.json","view_paper":"https://pith.science/paper/P7WEZLMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00699&json=true","fetch_graph":"https://pith.science/api/pith-number/P7WEZLMTABDKAFH4JQVHAI675E/graph.json","fetch_events":"https://pith.science/api/pith-number/P7WEZLMTABDKAFH4JQVHAI675E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7WEZLMTABDKAFH4JQVHAI675E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7WEZLMTABDKAFH4JQVHAI675E/action/storage_attestation","attest_author":"https://pith.science/pith/P7WEZLMTABDKAFH4JQVHAI675E/action/author_attestation","sign_citation":"https://pith.science/pith/P7WEZLMTABDKAFH4JQVHAI675E/action/citation_signature","submit_replication":"https://pith.science/pith/P7WEZLMTABDKAFH4JQVHAI675E/action/replication_record"}},"created_at":"2026-05-18T00:22:08.115338+00:00","updated_at":"2026-05-18T00:22:08.115338+00:00"}