{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VPTULOEMYMEITY47YHWAMPYC2W","short_pith_number":"pith:VPTULOEM","schema_version":"1.0","canonical_sha256":"abe745b88cc30889e39fc1ec063f02d5b82acf6c9cffd08250f575c90006fb80","source":{"kind":"arxiv","id":"2105.02291","version":2},"attestation_state":"computed","paper":{"title":"Clifford Circuit Optimization with Templates and Symbolic Pauli Gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov, Ruslan Shaydulin, Sergey Bravyi, Shaohan Hu","submitted_at":"2021-05-05T19:18:35Z","abstract_excerpt":"The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in quantum error correction, randomized benchmarking protocols, and the study of entanglement. Here we consider the problem of finding a short quantum circuit implementing a given Clifford group element. Our methods aim to minimize the entangling gate count assuming all-to-all qubit connectivity. First, we consider circuit optimization based on template matching and design Clifford-specific templates that leverage the ability to factor out Pau"},"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":"2105.02291","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-05-05T19:18:35Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"4f12632f35da70ad3a575b14a93bb86e25155bb57f27e72dfb60023e2a29e211","abstract_canon_sha256":"7f091f151b2ddfdcf90d1ddcc278cd724cb8838234c0611cbb4ddfb127d77da2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:32:02.516233Z","signature_b64":"ft3HAzE8drBVX+qjrKT6138lEmTMJSSUp73FQPuuJgSznKGVlPmklDPTp6+WoCiTmgngOv25aBKEqnGgeF6QCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abe745b88cc30889e39fc1ec063f02d5b82acf6c9cffd08250f575c90006fb80","last_reissued_at":"2026-07-05T03:32:02.515743Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:32:02.515743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clifford Circuit Optimization with Templates and Symbolic Pauli Gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov, Ruslan Shaydulin, Sergey Bravyi, Shaohan Hu","submitted_at":"2021-05-05T19:18:35Z","abstract_excerpt":"The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in quantum error correction, randomized benchmarking protocols, and the study of entanglement. Here we consider the problem of finding a short quantum circuit implementing a given Clifford group element. Our methods aim to minimize the entangling gate count assuming all-to-all qubit connectivity. First, we consider circuit optimization based on template matching and design Clifford-specific templates that leverage the ability to factor out Pau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.02291","kind":"arxiv","version":2},"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/2105.02291/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":"2105.02291","created_at":"2026-07-05T03:32:02.515805+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.02291v2","created_at":"2026-07-05T03:32:02.515805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.02291","created_at":"2026-07-05T03:32:02.515805+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPTULOEMYMEI","created_at":"2026-07-05T03:32:02.515805+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPTULOEMYMEITY47","created_at":"2026-07-05T03:32:02.515805+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPTULOEM","created_at":"2026-07-05T03:32:02.515805+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/VPTULOEMYMEITY47YHWAMPYC2W","json":"https://pith.science/pith/VPTULOEMYMEITY47YHWAMPYC2W.json","graph_json":"https://pith.science/api/pith-number/VPTULOEMYMEITY47YHWAMPYC2W/graph.json","events_json":"https://pith.science/api/pith-number/VPTULOEMYMEITY47YHWAMPYC2W/events.json","paper":"https://pith.science/paper/VPTULOEM"},"agent_actions":{"view_html":"https://pith.science/pith/VPTULOEMYMEITY47YHWAMPYC2W","download_json":"https://pith.science/pith/VPTULOEMYMEITY47YHWAMPYC2W.json","view_paper":"https://pith.science/paper/VPTULOEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.02291&json=true","fetch_graph":"https://pith.science/api/pith-number/VPTULOEMYMEITY47YHWAMPYC2W/graph.json","fetch_events":"https://pith.science/api/pith-number/VPTULOEMYMEITY47YHWAMPYC2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPTULOEMYMEITY47YHWAMPYC2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPTULOEMYMEITY47YHWAMPYC2W/action/storage_attestation","attest_author":"https://pith.science/pith/VPTULOEMYMEITY47YHWAMPYC2W/action/author_attestation","sign_citation":"https://pith.science/pith/VPTULOEMYMEITY47YHWAMPYC2W/action/citation_signature","submit_replication":"https://pith.science/pith/VPTULOEMYMEITY47YHWAMPYC2W/action/replication_record"}},"created_at":"2026-07-05T03:32:02.515805+00:00","updated_at":"2026-07-05T03:32:02.515805+00:00"}