{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WF5NL27Z7ACUMQPWRAQNVN2C3Q","short_pith_number":"pith:WF5NL27Z","schema_version":"1.0","canonical_sha256":"b17ad5ebf9f8054641f68820dab742dc00425df8f67201c7510252f30d9d8708","source":{"kind":"arxiv","id":"2408.04349","version":1},"attestation_state":"computed","paper":{"title":"Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Irfansha Shaik, Jaco van de Pol","submitted_at":"2024-08-08T10:20:13Z","abstract_excerpt":"CNOT optimization plays a significant role in noise reduction for Quantum Circuits. Several heuristic and exact approaches exist for CNOT optimization. In this paper, we investigate more complicated variations of optimal synthesis by allowing qubit permutations and handling layout restrictions. We encode such problems into Planning, SAT, and QBF. We provide optimization for both CNOT gate count and circuit depth. For experimental evaluation, we consider standard T-gate optimized benchmarks and optimize CNOT sub-circuits. We show that allowing qubit permutations can further reduce up to 56% in "},"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":"2408.04349","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-08T10:20:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"12e4fc8fb397322883949f13b69d3d9dbd4081298278effefb62067d6d483eff","abstract_canon_sha256":"df726f45c1b7c1e2ca472fb4345599c186d971b684ae4fe0c0b1fa50bf65068c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:31.977070Z","signature_b64":"cq2tza80sGf7STIFGHwhrnPQUIMTYd1qSWMPRqUblJ6dNVeFdymKhExLttjIXK9pM/Gt0xFVk2kzksRUOAUJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b17ad5ebf9f8054641f68820dab742dc00425df8f67201c7510252f30d9d8708","last_reissued_at":"2026-07-05T08:53:31.976646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:31.976646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Irfansha Shaik, Jaco van de Pol","submitted_at":"2024-08-08T10:20:13Z","abstract_excerpt":"CNOT optimization plays a significant role in noise reduction for Quantum Circuits. Several heuristic and exact approaches exist for CNOT optimization. In this paper, we investigate more complicated variations of optimal synthesis by allowing qubit permutations and handling layout restrictions. We encode such problems into Planning, SAT, and QBF. We provide optimization for both CNOT gate count and circuit depth. For experimental evaluation, we consider standard T-gate optimized benchmarks and optimize CNOT sub-circuits. We show that allowing qubit permutations can further reduce up to 56% in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04349","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/2408.04349/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":"2408.04349","created_at":"2026-07-05T08:53:31.976706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.04349v1","created_at":"2026-07-05T08:53:31.976706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04349","created_at":"2026-07-05T08:53:31.976706+00:00"},{"alias_kind":"pith_short_12","alias_value":"WF5NL27Z7ACU","created_at":"2026-07-05T08:53:31.976706+00:00"},{"alias_kind":"pith_short_16","alias_value":"WF5NL27Z7ACUMQPW","created_at":"2026-07-05T08:53:31.976706+00:00"},{"alias_kind":"pith_short_8","alias_value":"WF5NL27Z","created_at":"2026-07-05T08:53:31.976706+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04748","citing_title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WF5NL27Z7ACUMQPWRAQNVN2C3Q","json":"https://pith.science/pith/WF5NL27Z7ACUMQPWRAQNVN2C3Q.json","graph_json":"https://pith.science/api/pith-number/WF5NL27Z7ACUMQPWRAQNVN2C3Q/graph.json","events_json":"https://pith.science/api/pith-number/WF5NL27Z7ACUMQPWRAQNVN2C3Q/events.json","paper":"https://pith.science/paper/WF5NL27Z"},"agent_actions":{"view_html":"https://pith.science/pith/WF5NL27Z7ACUMQPWRAQNVN2C3Q","download_json":"https://pith.science/pith/WF5NL27Z7ACUMQPWRAQNVN2C3Q.json","view_paper":"https://pith.science/paper/WF5NL27Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.04349&json=true","fetch_graph":"https://pith.science/api/pith-number/WF5NL27Z7ACUMQPWRAQNVN2C3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/WF5NL27Z7ACUMQPWRAQNVN2C3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WF5NL27Z7ACUMQPWRAQNVN2C3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WF5NL27Z7ACUMQPWRAQNVN2C3Q/action/storage_attestation","attest_author":"https://pith.science/pith/WF5NL27Z7ACUMQPWRAQNVN2C3Q/action/author_attestation","sign_citation":"https://pith.science/pith/WF5NL27Z7ACUMQPWRAQNVN2C3Q/action/citation_signature","submit_replication":"https://pith.science/pith/WF5NL27Z7ACUMQPWRAQNVN2C3Q/action/replication_record"}},"created_at":"2026-07-05T08:53:31.976706+00:00","updated_at":"2026-07-05T08:53:31.976706+00:00"}