{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RSAN2B4CLS5CSKIQ7QWFUQXQCT","short_pith_number":"pith:RSAN2B4C","schema_version":"1.0","canonical_sha256":"8c80dd07825cba292910fc2c5a42f014ee15fa45c4ab7dcb57c29f49ddfde91f","source":{"kind":"arxiv","id":"2608.09578","version":1},"attestation_state":"computed","paper":{"title":"Quantum Uncomputation of Clean and Dirty Ancilla Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Boning Meng, Chenke Liu, Li Zhou","submitted_at":"2026-08-10T13:13:54Z","abstract_excerpt":"Automatic uncomputation aims to provide programming-language-level support to facilitate the correct and safe use of ancilla qubits in quantum computing, but efforts have only been made for clean ancillas, leaving dirty ancillas unexplored. We present a unified formalization of the uncomputation of both clean and dirty ancillas. For the first time, we prove that checking the existence of uncomputation is coNP-hard. We introduce two complementary synthesis-oriented existence-checking methods: a rewrite-based normalization algorithm (RwUn) and a template-based reasoning system (TpUn) that guaran"},"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":"2608.09578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-10T13:13:54Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"7dd2a8c69564fd244f6af46f7f59d8ff7cedc5c983764ad057241360312646ee","abstract_canon_sha256":"97d6b113b17d2eb0afe083712040773749f918b6a45d7b4672f2d40d1052cc9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:24:32.608902Z","signature_b64":"mBdg36xAlodXUgZxXdlf1q7qkn5ey/TrqQS50fPmk1eS5q+U0xOoKA7QTlMMGUsrGbKvp0CUAJyMB+r0yY/KDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c80dd07825cba292910fc2c5a42f014ee15fa45c4ab7dcb57c29f49ddfde91f","last_reissued_at":"2026-08-11T02:24:32.606673Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:24:32.606673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Uncomputation of Clean and Dirty Ancilla Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Boning Meng, Chenke Liu, Li Zhou","submitted_at":"2026-08-10T13:13:54Z","abstract_excerpt":"Automatic uncomputation aims to provide programming-language-level support to facilitate the correct and safe use of ancilla qubits in quantum computing, but efforts have only been made for clean ancillas, leaving dirty ancillas unexplored. We present a unified formalization of the uncomputation of both clean and dirty ancillas. For the first time, we prove that checking the existence of uncomputation is coNP-hard. We introduce two complementary synthesis-oriented existence-checking methods: a rewrite-based normalization algorithm (RwUn) and a template-based reasoning system (TpUn) that guaran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09578","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/2608.09578/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":"2608.09578","created_at":"2026-08-11T02:24:32.607750+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09578v1","created_at":"2026-08-11T02:24:32.607750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09578","created_at":"2026-08-11T02:24:32.607750+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSAN2B4CLS5C","created_at":"2026-08-11T02:24:32.607750+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSAN2B4CLS5CSKIQ","created_at":"2026-08-11T02:24:32.607750+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSAN2B4C","created_at":"2026-08-11T02:24:32.607750+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/RSAN2B4CLS5CSKIQ7QWFUQXQCT","json":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT.json","graph_json":"https://pith.science/api/pith-number/RSAN2B4CLS5CSKIQ7QWFUQXQCT/graph.json","events_json":"https://pith.science/api/pith-number/RSAN2B4CLS5CSKIQ7QWFUQXQCT/events.json","paper":"https://pith.science/paper/RSAN2B4C"},"agent_actions":{"view_html":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT","download_json":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT.json","view_paper":"https://pith.science/paper/RSAN2B4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09578&json=true","fetch_graph":"https://pith.science/api/pith-number/RSAN2B4CLS5CSKIQ7QWFUQXQCT/graph.json","fetch_events":"https://pith.science/api/pith-number/RSAN2B4CLS5CSKIQ7QWFUQXQCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/action/storage_attestation","attest_author":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/action/author_attestation","sign_citation":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/action/citation_signature","submit_replication":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/action/replication_record"}},"created_at":"2026-08-11T02:24:32.607750+00:00","updated_at":"2026-08-11T02:24:32.607750+00:00"}