{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OKGEZRSZRTXMJMFPRXKMNIYNZQ","short_pith_number":"pith:OKGEZRSZ","schema_version":"1.0","canonical_sha256":"728c4cc6598ceec4b0af8dd4c6a30dcc22c813f9a1305c3279dea573a178d289","source":{"kind":"arxiv","id":"2410.14631","version":1},"attestation_state":"computed","paper":{"title":"Transversal non-Clifford gates for quantum LDPC codes on sheaves","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ting-Chun Lin","submitted_at":"2024-10-18T17:31:19Z","abstract_excerpt":"A major goal in quantum computing is to build a fault-tolerant quantum computer. One approach involves quantum low-density parity-check (qLDPC) codes that support transversal non-Clifford gates. In this work, we provide a large family of such codes. The key insight is to interpret the logical operators of qLDPC codes as geometric surfaces and use the intersection number of these surfaces to define the non-Clifford operation. At a more abstract level, this construction is based on defining the cup product on the chain complex induced from a sheaf."},"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":"2410.14631","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-18T17:31:19Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"523af884c264e501a6236303022e414c46a2ae46e918e541d00e5ed06c9d4598","abstract_canon_sha256":"90e65e728de51e0f829fde4cc5d22f81f795ff7feaa6fd55ba2ffa0cc0ecde4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:34.792281Z","signature_b64":"119VCkOObQ8aVlk1O55YWs5b2IH3lk1+6Xidw/xFPL5aaqOnJpcjyC918IzS5Pqi4xjmF2RSj4M7urHG2YJBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"728c4cc6598ceec4b0af8dd4c6a30dcc22c813f9a1305c3279dea573a178d289","last_reissued_at":"2026-07-05T09:22:34.791713Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:34.791713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transversal non-Clifford gates for quantum LDPC codes on sheaves","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ting-Chun Lin","submitted_at":"2024-10-18T17:31:19Z","abstract_excerpt":"A major goal in quantum computing is to build a fault-tolerant quantum computer. One approach involves quantum low-density parity-check (qLDPC) codes that support transversal non-Clifford gates. In this work, we provide a large family of such codes. The key insight is to interpret the logical operators of qLDPC codes as geometric surfaces and use the intersection number of these surfaces to define the non-Clifford operation. At a more abstract level, this construction is based on defining the cup product on the chain complex induced from a sheaf."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14631","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/2410.14631/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":"2410.14631","created_at":"2026-07-05T09:22:34.791796+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.14631v1","created_at":"2026-07-05T09:22:34.791796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14631","created_at":"2026-07-05T09:22:34.791796+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKGEZRSZRTXM","created_at":"2026-07-05T09:22:34.791796+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKGEZRSZRTXMJMFP","created_at":"2026-07-05T09:22:34.791796+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKGEZRSZ","created_at":"2026-07-05T09:22:34.791796+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.05003","citing_title":"Parallel Logical Measurements via Quantum Code Surgery","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2508.10714","citing_title":"Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2603.04156","citing_title":"Achieving Optimal-Distance Atom-Loss Correction via Pauli Envelope","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11318","citing_title":"Spatial overhead reduction for 2D hypergraph product codes","ref_index":102,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10943","citing_title":"A passive self-correcting quantum memory in three dimensions","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKGEZRSZRTXMJMFPRXKMNIYNZQ","json":"https://pith.science/pith/OKGEZRSZRTXMJMFPRXKMNIYNZQ.json","graph_json":"https://pith.science/api/pith-number/OKGEZRSZRTXMJMFPRXKMNIYNZQ/graph.json","events_json":"https://pith.science/api/pith-number/OKGEZRSZRTXMJMFPRXKMNIYNZQ/events.json","paper":"https://pith.science/paper/OKGEZRSZ"},"agent_actions":{"view_html":"https://pith.science/pith/OKGEZRSZRTXMJMFPRXKMNIYNZQ","download_json":"https://pith.science/pith/OKGEZRSZRTXMJMFPRXKMNIYNZQ.json","view_paper":"https://pith.science/paper/OKGEZRSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.14631&json=true","fetch_graph":"https://pith.science/api/pith-number/OKGEZRSZRTXMJMFPRXKMNIYNZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/OKGEZRSZRTXMJMFPRXKMNIYNZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKGEZRSZRTXMJMFPRXKMNIYNZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKGEZRSZRTXMJMFPRXKMNIYNZQ/action/storage_attestation","attest_author":"https://pith.science/pith/OKGEZRSZRTXMJMFPRXKMNIYNZQ/action/author_attestation","sign_citation":"https://pith.science/pith/OKGEZRSZRTXMJMFPRXKMNIYNZQ/action/citation_signature","submit_replication":"https://pith.science/pith/OKGEZRSZRTXMJMFPRXKMNIYNZQ/action/replication_record"}},"created_at":"2026-07-05T09:22:34.791796+00:00","updated_at":"2026-07-05T09:22:34.791796+00:00"}