{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZLPAARWACJ3VDOQWJBFOZTXAHQ","short_pith_number":"pith:ZLPAARWA","schema_version":"1.0","canonical_sha256":"cade0046c0127751ba16484aeccee03c2c3e38280907a18465413428babb5692","source":{"kind":"arxiv","id":"2101.08939","version":6},"attestation_state":"computed","paper":{"title":"Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","cs.LO","cs.PL"],"primary_cat":"quant-ph","authors_text":"Aarthi Sundaram, Brad Lackey, Kartik Singhal, Robert Rand, Youngchan Cho","submitted_at":"2021-01-22T04:07:12Z","abstract_excerpt":"We show that Gottesman's (1998) semantics for Clifford circuits based on the Heisenberg representation gives rise to a lightweight Hoare-like logic for efficiently characterizing a common subset of quantum programs. Our applications include (i) certifying whether auxiliary qubits can be safely disposed of, (ii) determining if a system is separable across a given bipartition, (iii) checking the transversality of a gate with respect to a given stabilizer code, and (iv) computing post-measurement states for computational basis measurements. Further, this logic is extended to accommodate universal"},"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":"2101.08939","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-01-22T04:07:12Z","cross_cats_sorted":["cs.ET","cs.LO","cs.PL"],"title_canon_sha256":"333d1f978f1bd240c4e98258e3e299872b7d8423a6db4a77c8d3d6748e1d05aa","abstract_canon_sha256":"0cc877ac766b0385a2f6674f14a777c6ea58ef480e9b6749d3b0f93f1233e0ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:10.323657Z","signature_b64":"6nFfebHSUB4F6A3afLF+T76cwnzg00XwASgAmAy57+idJzpYHX1jqDCTjzpf3zwbl+V+swA3EF61Hz0agXwUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cade0046c0127751ba16484aeccee03c2c3e38280907a18465413428babb5692","last_reissued_at":"2026-07-02T01:17:10.323161Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:10.323161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","cs.LO","cs.PL"],"primary_cat":"quant-ph","authors_text":"Aarthi Sundaram, Brad Lackey, Kartik Singhal, Robert Rand, Youngchan Cho","submitted_at":"2021-01-22T04:07:12Z","abstract_excerpt":"We show that Gottesman's (1998) semantics for Clifford circuits based on the Heisenberg representation gives rise to a lightweight Hoare-like logic for efficiently characterizing a common subset of quantum programs. Our applications include (i) certifying whether auxiliary qubits can be safely disposed of, (ii) determining if a system is separable across a given bipartition, (iii) checking the transversality of a gate with respect to a given stabilizer code, and (iv) computing post-measurement states for computational basis measurements. Further, this logic is extended to accommodate universal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.08939","kind":"arxiv","version":6},"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/2101.08939/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":"2101.08939","created_at":"2026-07-02T01:17:10.323228+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.08939v6","created_at":"2026-07-02T01:17:10.323228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.08939","created_at":"2026-07-02T01:17:10.323228+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLPAARWACJ3V","created_at":"2026-07-02T01:17:10.323228+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLPAARWACJ3VDOQW","created_at":"2026-07-02T01:17:10.323228+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLPAARWA","created_at":"2026-07-02T01:17:10.323228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.05786","citing_title":"A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZLPAARWACJ3VDOQWJBFOZTXAHQ","json":"https://pith.science/pith/ZLPAARWACJ3VDOQWJBFOZTXAHQ.json","graph_json":"https://pith.science/api/pith-number/ZLPAARWACJ3VDOQWJBFOZTXAHQ/graph.json","events_json":"https://pith.science/api/pith-number/ZLPAARWACJ3VDOQWJBFOZTXAHQ/events.json","paper":"https://pith.science/paper/ZLPAARWA"},"agent_actions":{"view_html":"https://pith.science/pith/ZLPAARWACJ3VDOQWJBFOZTXAHQ","download_json":"https://pith.science/pith/ZLPAARWACJ3VDOQWJBFOZTXAHQ.json","view_paper":"https://pith.science/paper/ZLPAARWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.08939&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLPAARWACJ3VDOQWJBFOZTXAHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLPAARWACJ3VDOQWJBFOZTXAHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLPAARWACJ3VDOQWJBFOZTXAHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLPAARWACJ3VDOQWJBFOZTXAHQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZLPAARWACJ3VDOQWJBFOZTXAHQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZLPAARWACJ3VDOQWJBFOZTXAHQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZLPAARWACJ3VDOQWJBFOZTXAHQ/action/replication_record"}},"created_at":"2026-07-02T01:17:10.323228+00:00","updated_at":"2026-07-02T01:17:10.323228+00:00"}