{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:OPSQLHYBQZANYJCNEOYSBENCGI","short_pith_number":"pith:OPSQLHYB","schema_version":"1.0","canonical_sha256":"73e5059f018640dc244d23b12091a2323a3ae6c0577a2f6090e50886160931c5","source":{"kind":"arxiv","id":"2104.11359","version":1},"attestation_state":"computed","paper":{"title":"Model Checking for Verification of Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.LO"],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying","submitted_at":"2021-04-23T00:43:37Z","abstract_excerpt":"In this talk, we will describe a framework for assertion-based verification (ABV) of quantum circuits by applying model checking techniques for quantum systems developed in our previous work, in which:\n  (i) Noiseless and noisy quantum circuits are modelled as operator- and super-operator-valued transition systems, respectively, both of which can be further represented by tensor networks.\n  (ii) Quantum assertions are specified by a temporal extension of Birkhoff-von Neumann quantum logic. Their semantics is defined based on the design decision: they will be used in verification of quantum cir"},"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":"2104.11359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-04-23T00:43:37Z","cross_cats_sorted":["cs.AR","cs.LO"],"title_canon_sha256":"7b11e99a9bbfb5519dfa283d6cb6b31cad7a72b3e2ca822f0d61ff003eb60e82","abstract_canon_sha256":"e6e85de5736e3274566eed702a5beb118468486df4f241e487b119b994ae1e0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:23.148389Z","signature_b64":"PGiEYKMGj9mjgz982yGSMF26GG4Y1doFkaH4laiSHq2UgSk9p0xwBSWBheOqcRz3Qm0K6BOz6bcaWUspP3JzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73e5059f018640dc244d23b12091a2323a3ae6c0577a2f6090e50886160931c5","last_reissued_at":"2026-07-05T02:34:23.147833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:23.147833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Checking for Verification of Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.LO"],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying","submitted_at":"2021-04-23T00:43:37Z","abstract_excerpt":"In this talk, we will describe a framework for assertion-based verification (ABV) of quantum circuits by applying model checking techniques for quantum systems developed in our previous work, in which:\n  (i) Noiseless and noisy quantum circuits are modelled as operator- and super-operator-valued transition systems, respectively, both of which can be further represented by tensor networks.\n  (ii) Quantum assertions are specified by a temporal extension of Birkhoff-von Neumann quantum logic. Their semantics is defined based on the design decision: they will be used in verification of quantum cir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.11359","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/2104.11359/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":"2104.11359","created_at":"2026-07-05T02:34:23.147890+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.11359v1","created_at":"2026-07-05T02:34:23.147890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.11359","created_at":"2026-07-05T02:34:23.147890+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPSQLHYBQZAN","created_at":"2026-07-05T02:34:23.147890+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPSQLHYBQZANYJCN","created_at":"2026-07-05T02:34:23.147890+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPSQLHYB","created_at":"2026-07-05T02:34:23.147890+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.18502","citing_title":"Towards Classical Software Verification using Quantum Computers","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OPSQLHYBQZANYJCNEOYSBENCGI","json":"https://pith.science/pith/OPSQLHYBQZANYJCNEOYSBENCGI.json","graph_json":"https://pith.science/api/pith-number/OPSQLHYBQZANYJCNEOYSBENCGI/graph.json","events_json":"https://pith.science/api/pith-number/OPSQLHYBQZANYJCNEOYSBENCGI/events.json","paper":"https://pith.science/paper/OPSQLHYB"},"agent_actions":{"view_html":"https://pith.science/pith/OPSQLHYBQZANYJCNEOYSBENCGI","download_json":"https://pith.science/pith/OPSQLHYBQZANYJCNEOYSBENCGI.json","view_paper":"https://pith.science/paper/OPSQLHYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.11359&json=true","fetch_graph":"https://pith.science/api/pith-number/OPSQLHYBQZANYJCNEOYSBENCGI/graph.json","fetch_events":"https://pith.science/api/pith-number/OPSQLHYBQZANYJCNEOYSBENCGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPSQLHYBQZANYJCNEOYSBENCGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPSQLHYBQZANYJCNEOYSBENCGI/action/storage_attestation","attest_author":"https://pith.science/pith/OPSQLHYBQZANYJCNEOYSBENCGI/action/author_attestation","sign_citation":"https://pith.science/pith/OPSQLHYBQZANYJCNEOYSBENCGI/action/citation_signature","submit_replication":"https://pith.science/pith/OPSQLHYBQZANYJCNEOYSBENCGI/action/replication_record"}},"created_at":"2026-07-05T02:34:23.147890+00:00","updated_at":"2026-07-05T02:34:23.147890+00:00"}