{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TDOOMO2MPYM4NSEYQMKSBGY3RQ","short_pith_number":"pith:TDOOMO2M","schema_version":"1.0","canonical_sha256":"98dce63b4c7e19c6c8988315209b1b8c3e787ec4f675c905da82ed8e23601e85","source":{"kind":"arxiv","id":"2506.15905","version":1},"attestation_state":"computed","paper":{"title":"Transversal Gates for Highly Asymmetric qLDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alastair Kay, Heather Leitch","submitted_at":"2025-06-18T22:37:21Z","abstract_excerpt":"Transversal gates are the ideal gates in a fault-tolerant scenario; relatively easy to implement, and minimally error propagating. Their availability will maximise fault tolerant thresholds, enabling universal quantum computation in a wider range of noisy hardware.\n  Transversal gates in quantum low density parity check (qLDPC) codes are largely unstudied, with the early results of Burton & Browne suggesting that transversal non-Clifford gates may be impossible. In this paper, we contradict this expectation with constructions for both hypergraph product codes and balanced product codes, althou"},"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.15905","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-18T22:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"473659d2221004c87015d264e63b4526aabf1d06d3c4e018a1da70c81785c300","abstract_canon_sha256":"48d71078612893b7d9c3655786d69dc2630489815f6de7def95a4621a9974735"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:26.221740Z","signature_b64":"ou6Luyxx019l9X8ShlfR+Do4eZ9k1MmC7DrCD04bXXQxwU+QcdLiMJj+XsB+mOXe6et7+VPMtnKVt6F4nRrsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98dce63b4c7e19c6c8988315209b1b8c3e787ec4f675c905da82ed8e23601e85","last_reissued_at":"2026-07-05T11:24:26.221256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:26.221256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transversal Gates for Highly Asymmetric qLDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alastair Kay, Heather Leitch","submitted_at":"2025-06-18T22:37:21Z","abstract_excerpt":"Transversal gates are the ideal gates in a fault-tolerant scenario; relatively easy to implement, and minimally error propagating. Their availability will maximise fault tolerant thresholds, enabling universal quantum computation in a wider range of noisy hardware.\n  Transversal gates in quantum low density parity check (qLDPC) codes are largely unstudied, with the early results of Burton & Browne suggesting that transversal non-Clifford gates may be impossible. In this paper, we contradict this expectation with constructions for both hypergraph product codes and balanced product codes, althou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15905","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.15905/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.15905","created_at":"2026-07-05T11:24:26.221312+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.15905v1","created_at":"2026-07-05T11:24:26.221312+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15905","created_at":"2026-07-05T11:24:26.221312+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDOOMO2MPYM4","created_at":"2026-07-05T11:24:26.221312+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDOOMO2MPYM4NSEY","created_at":"2026-07-05T11:24:26.221312+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDOOMO2M","created_at":"2026-07-05T11:24:26.221312+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.15905","citing_title":"Transversal Gates for Highly Asymmetric qLDPC Codes","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TDOOMO2MPYM4NSEYQMKSBGY3RQ","json":"https://pith.science/pith/TDOOMO2MPYM4NSEYQMKSBGY3RQ.json","graph_json":"https://pith.science/api/pith-number/TDOOMO2MPYM4NSEYQMKSBGY3RQ/graph.json","events_json":"https://pith.science/api/pith-number/TDOOMO2MPYM4NSEYQMKSBGY3RQ/events.json","paper":"https://pith.science/paper/TDOOMO2M"},"agent_actions":{"view_html":"https://pith.science/pith/TDOOMO2MPYM4NSEYQMKSBGY3RQ","download_json":"https://pith.science/pith/TDOOMO2MPYM4NSEYQMKSBGY3RQ.json","view_paper":"https://pith.science/paper/TDOOMO2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.15905&json=true","fetch_graph":"https://pith.science/api/pith-number/TDOOMO2MPYM4NSEYQMKSBGY3RQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TDOOMO2MPYM4NSEYQMKSBGY3RQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDOOMO2MPYM4NSEYQMKSBGY3RQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDOOMO2MPYM4NSEYQMKSBGY3RQ/action/storage_attestation","attest_author":"https://pith.science/pith/TDOOMO2MPYM4NSEYQMKSBGY3RQ/action/author_attestation","sign_citation":"https://pith.science/pith/TDOOMO2MPYM4NSEYQMKSBGY3RQ/action/citation_signature","submit_replication":"https://pith.science/pith/TDOOMO2MPYM4NSEYQMKSBGY3RQ/action/replication_record"}},"created_at":"2026-07-05T11:24:26.221312+00:00","updated_at":"2026-07-05T11:24:26.221312+00:00"}