{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6ZOSSW2RM32IJGCMIPFK4EMMWE","short_pith_number":"pith:6ZOSSW2R","schema_version":"1.0","canonical_sha256":"f65d295b5166f484984c43caae118cb1138817a2a86383a3990e6ee01fe325dd","source":{"kind":"arxiv","id":"2110.11923","version":2},"attestation_state":"computed","paper":{"title":"Climbing the Diagonal Clifford Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Jingzhen Hu, Qingzhong Liang, Robert Calderbank","submitted_at":"2021-10-22T17:08:18Z","abstract_excerpt":"Magic state distillation and the Shor factoring algorithm make essential use of logical diagonal gates. We introduce a method of synthesizing CSS codes that realize a target logical diagonal gate at some level $l$ in the Clifford hierarchy. The method combines three basic operations: concatenation, removal of $Z$-stabilizers, and addition of $X$-stabilizers. It explicitly tracks the logical gate induced by a diagonal physical gate that preserves a CSS code. The first step is concatenation, where the input is a CSS code and a physical diagonal gate at level $l$ inducing a logical diagonal gate "},"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":"2110.11923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-22T17:08:18Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7113a419491aa1bd64fc108798a0628d8d3f4e1a4caedf049bed329e3fc849ac","abstract_canon_sha256":"f81930742156a53fac49149c25e0656beb901db32f100cf0c04872e49e0fbe43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:21.451410Z","signature_b64":"/Mp8jz4HQmH+pM8ouiLfOKsZEdtkiOITrH1iwYoYJBtZU/Rq0g3SB0Z+/SL0OCw85rwovaLrbH/RyBF6p8FpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f65d295b5166f484984c43caae118cb1138817a2a86383a3990e6ee01fe325dd","last_reissued_at":"2026-07-05T03:26:21.451031Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:21.451031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Climbing the Diagonal Clifford Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Jingzhen Hu, Qingzhong Liang, Robert Calderbank","submitted_at":"2021-10-22T17:08:18Z","abstract_excerpt":"Magic state distillation and the Shor factoring algorithm make essential use of logical diagonal gates. We introduce a method of synthesizing CSS codes that realize a target logical diagonal gate at some level $l$ in the Clifford hierarchy. The method combines three basic operations: concatenation, removal of $Z$-stabilizers, and addition of $X$-stabilizers. It explicitly tracks the logical gate induced by a diagonal physical gate that preserves a CSS code. The first step is concatenation, where the input is a CSS code and a physical diagonal gate at level $l$ inducing a logical diagonal gate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11923","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/2110.11923/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":"2110.11923","created_at":"2026-07-05T03:26:21.451090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.11923v2","created_at":"2026-07-05T03:26:21.451090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11923","created_at":"2026-07-05T03:26:21.451090+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZOSSW2RM32I","created_at":"2026-07-05T03:26:21.451090+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZOSSW2RM32IJGCM","created_at":"2026-07-05T03:26:21.451090+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZOSSW2R","created_at":"2026-07-05T03:26:21.451090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15436","citing_title":"Parity-unfolded distillation architecture for noise-biased platforms","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6ZOSSW2RM32IJGCMIPFK4EMMWE","json":"https://pith.science/pith/6ZOSSW2RM32IJGCMIPFK4EMMWE.json","graph_json":"https://pith.science/api/pith-number/6ZOSSW2RM32IJGCMIPFK4EMMWE/graph.json","events_json":"https://pith.science/api/pith-number/6ZOSSW2RM32IJGCMIPFK4EMMWE/events.json","paper":"https://pith.science/paper/6ZOSSW2R"},"agent_actions":{"view_html":"https://pith.science/pith/6ZOSSW2RM32IJGCMIPFK4EMMWE","download_json":"https://pith.science/pith/6ZOSSW2RM32IJGCMIPFK4EMMWE.json","view_paper":"https://pith.science/paper/6ZOSSW2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.11923&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZOSSW2RM32IJGCMIPFK4EMMWE/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZOSSW2RM32IJGCMIPFK4EMMWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZOSSW2RM32IJGCMIPFK4EMMWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZOSSW2RM32IJGCMIPFK4EMMWE/action/storage_attestation","attest_author":"https://pith.science/pith/6ZOSSW2RM32IJGCMIPFK4EMMWE/action/author_attestation","sign_citation":"https://pith.science/pith/6ZOSSW2RM32IJGCMIPFK4EMMWE/action/citation_signature","submit_replication":"https://pith.science/pith/6ZOSSW2RM32IJGCMIPFK4EMMWE/action/replication_record"}},"created_at":"2026-07-05T03:26:21.451090+00:00","updated_at":"2026-07-05T03:26:21.451090+00:00"}