{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BGX754X5UVQVP7MYLECD3RIAPZ","short_pith_number":"pith:BGX754X5","schema_version":"1.0","canonical_sha256":"09affef2fda56157fd9859043dc5007e5b9a85ebd0e0697c3eae4a5e1eae33af","source":{"kind":"arxiv","id":"2506.06752","version":1},"attestation_state":"computed","paper":{"title":"Depth-Optimal Quantum Layout Synthesis as SAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Anders B. Clausen, Anna B. Jakobsen, Irfansha Shaik, Jaco van de Pol","submitted_at":"2025-06-07T10:47:58Z","abstract_excerpt":"Quantum circuits consist of gates applied to qubits. Current quantum hardware platforms impose connectivity restrictions on binary CX gates. Hence, Layout Synthesis is an important step to transpile quantum circuits before they can be executed. Since CX gates are noisy, it is important to reduce the CX count or CX depth of the mapped circuits.\n  We provide a new and efficient encoding of Quantum-circuit Layout Synthesis in SAT. Previous SAT encodings focused on gate count and CX-gate count. Our encoding instead guarantees that we find mapped circuits with minimal circuit depth or minimal CX-ga"},"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":"2506.06752","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-07T10:47:58Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4ebb6118bca41f6ee4e93b1d5a7fd1958e29167261932a9fceee4af79c034081","abstract_canon_sha256":"a10181104f4d18fbbef576e17692b1daa8ec6b6366f19a674668cdaa8a340e47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:55.091948Z","signature_b64":"bRcUJHWADxh/JdMpNCXhHOei+sCJ9rJklTI9MxoMQIeKYMHIBPkEntj8nzrwPXYCR7xsb1Iv+H3q5IasFzsyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09affef2fda56157fd9859043dc5007e5b9a85ebd0e0697c3eae4a5e1eae33af","last_reissued_at":"2026-07-05T11:17:55.091490Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:55.091490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth-Optimal Quantum Layout Synthesis as SAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Anders B. Clausen, Anna B. Jakobsen, Irfansha Shaik, Jaco van de Pol","submitted_at":"2025-06-07T10:47:58Z","abstract_excerpt":"Quantum circuits consist of gates applied to qubits. Current quantum hardware platforms impose connectivity restrictions on binary CX gates. Hence, Layout Synthesis is an important step to transpile quantum circuits before they can be executed. Since CX gates are noisy, it is important to reduce the CX count or CX depth of the mapped circuits.\n  We provide a new and efficient encoding of Quantum-circuit Layout Synthesis in SAT. Previous SAT encodings focused on gate count and CX-gate count. Our encoding instead guarantees that we find mapped circuits with minimal circuit depth or minimal CX-ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06752","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/2506.06752/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":"2506.06752","created_at":"2026-07-05T11:17:55.091547+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.06752v1","created_at":"2026-07-05T11:17:55.091547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06752","created_at":"2026-07-05T11:17:55.091547+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGX754X5UVQV","created_at":"2026-07-05T11:17:55.091547+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGX754X5UVQVP7MY","created_at":"2026-07-05T11:17:55.091547+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGX754X5","created_at":"2026-07-05T11:17:55.091547+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/BGX754X5UVQVP7MYLECD3RIAPZ","json":"https://pith.science/pith/BGX754X5UVQVP7MYLECD3RIAPZ.json","graph_json":"https://pith.science/api/pith-number/BGX754X5UVQVP7MYLECD3RIAPZ/graph.json","events_json":"https://pith.science/api/pith-number/BGX754X5UVQVP7MYLECD3RIAPZ/events.json","paper":"https://pith.science/paper/BGX754X5"},"agent_actions":{"view_html":"https://pith.science/pith/BGX754X5UVQVP7MYLECD3RIAPZ","download_json":"https://pith.science/pith/BGX754X5UVQVP7MYLECD3RIAPZ.json","view_paper":"https://pith.science/paper/BGX754X5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.06752&json=true","fetch_graph":"https://pith.science/api/pith-number/BGX754X5UVQVP7MYLECD3RIAPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BGX754X5UVQVP7MYLECD3RIAPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGX754X5UVQVP7MYLECD3RIAPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGX754X5UVQVP7MYLECD3RIAPZ/action/storage_attestation","attest_author":"https://pith.science/pith/BGX754X5UVQVP7MYLECD3RIAPZ/action/author_attestation","sign_citation":"https://pith.science/pith/BGX754X5UVQVP7MYLECD3RIAPZ/action/citation_signature","submit_replication":"https://pith.science/pith/BGX754X5UVQVP7MYLECD3RIAPZ/action/replication_record"}},"created_at":"2026-07-05T11:17:55.091547+00:00","updated_at":"2026-07-05T11:17:55.091547+00:00"}