{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NYJBT4IO5BGRVHGGZBMK7RSBWR","short_pith_number":"pith:NYJBT4IO","schema_version":"1.0","canonical_sha256":"6e1219f10ee84d1a9cc6c858afc641b45f36e10942ed55ba1c43ae0edcaa83b9","source":{"kind":"arxiv","id":"2503.14660","version":1},"attestation_state":"computed","paper":{"title":"Heuristic and Optimal Synthesis of CNOT and Clifford Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dan E Browne, Mark Webster, Stergios Koutsioumpas","submitted_at":"2025-03-18T19:09:58Z","abstract_excerpt":"Efficiently implementing Clifford circuits is crucial for quantum error correction and quantum algorithms. Linear reversible circuits, equivalent to circuits composed of CNOT gates, have important applications in classical computing. In this work we present methods for CNOT and general Clifford circuit synthesis which can be used to minimise either the entangling two-qubit gate count or the circuit depth. We present three families of algorithms - optimal synthesis which works on small circuits, A* synthesis for intermediate-size circuits and greedy synthesis for large circuits. We benchmark ag"},"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":"2503.14660","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-18T19:09:58Z","cross_cats_sorted":[],"title_canon_sha256":"a6ec0f6fc1ad8b9d368d8bdc083a65ff2c4c274aebf95d52d7a84577f7d439e7","abstract_canon_sha256":"f85f9aa8d2aa0cc627fe6406cbb8b185191eba32c2c258b05440db99a1baa092"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:34:22.133688Z","signature_b64":"fB3fDkWGZ364Ph20kx/gNUYLoJLySRrNbJcq7GUflS23pWpphnGZ3qbjhaNmNMI7jDrIliFxdeKWg4Tg7cfjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e1219f10ee84d1a9cc6c858afc641b45f36e10942ed55ba1c43ae0edcaa83b9","last_reissued_at":"2026-07-05T10:34:22.132766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:34:22.132766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heuristic and Optimal Synthesis of CNOT and Clifford Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dan E Browne, Mark Webster, Stergios Koutsioumpas","submitted_at":"2025-03-18T19:09:58Z","abstract_excerpt":"Efficiently implementing Clifford circuits is crucial for quantum error correction and quantum algorithms. Linear reversible circuits, equivalent to circuits composed of CNOT gates, have important applications in classical computing. In this work we present methods for CNOT and general Clifford circuit synthesis which can be used to minimise either the entangling two-qubit gate count or the circuit depth. We present three families of algorithms - optimal synthesis which works on small circuits, A* synthesis for intermediate-size circuits and greedy synthesis for large circuits. We benchmark ag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.14660","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/2503.14660/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":"2503.14660","created_at":"2026-07-05T10:34:22.132884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.14660v1","created_at":"2026-07-05T10:34:22.132884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.14660","created_at":"2026-07-05T10:34:22.132884+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYJBT4IO5BGR","created_at":"2026-07-05T10:34:22.132884+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYJBT4IO5BGRVHGG","created_at":"2026-07-05T10:34:22.132884+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYJBT4IO","created_at":"2026-07-05T10:34:22.132884+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.19471","citing_title":"Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15266","citing_title":"Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10910","citing_title":"Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NYJBT4IO5BGRVHGGZBMK7RSBWR","json":"https://pith.science/pith/NYJBT4IO5BGRVHGGZBMK7RSBWR.json","graph_json":"https://pith.science/api/pith-number/NYJBT4IO5BGRVHGGZBMK7RSBWR/graph.json","events_json":"https://pith.science/api/pith-number/NYJBT4IO5BGRVHGGZBMK7RSBWR/events.json","paper":"https://pith.science/paper/NYJBT4IO"},"agent_actions":{"view_html":"https://pith.science/pith/NYJBT4IO5BGRVHGGZBMK7RSBWR","download_json":"https://pith.science/pith/NYJBT4IO5BGRVHGGZBMK7RSBWR.json","view_paper":"https://pith.science/paper/NYJBT4IO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.14660&json=true","fetch_graph":"https://pith.science/api/pith-number/NYJBT4IO5BGRVHGGZBMK7RSBWR/graph.json","fetch_events":"https://pith.science/api/pith-number/NYJBT4IO5BGRVHGGZBMK7RSBWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYJBT4IO5BGRVHGGZBMK7RSBWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYJBT4IO5BGRVHGGZBMK7RSBWR/action/storage_attestation","attest_author":"https://pith.science/pith/NYJBT4IO5BGRVHGGZBMK7RSBWR/action/author_attestation","sign_citation":"https://pith.science/pith/NYJBT4IO5BGRVHGGZBMK7RSBWR/action/citation_signature","submit_replication":"https://pith.science/pith/NYJBT4IO5BGRVHGGZBMK7RSBWR/action/replication_record"}},"created_at":"2026-07-05T10:34:22.132884+00:00","updated_at":"2026-07-05T10:34:22.132884+00:00"}