{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GFVN5B45ZE6JSUSWLFUQVXE6CD","short_pith_number":"pith:GFVN5B45","schema_version":"1.0","canonical_sha256":"316ade879dc93c99525659690adc9e10f6281a3e1b8625215356ae34a8a2e8b0","source":{"kind":"arxiv","id":"2507.15056","version":1},"attestation_state":"computed","paper":{"title":"Transversal non-Clifford gates on qLDPC codes breaking the $\\sqrt{N}$ distance barrier and quantum-inspired geometry with $\\mathbb{Z}_2$ systolic freedom","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","cs.IT","hep-th","math.GT","math.IT"],"primary_cat":"quant-ph","authors_text":"Guanyu Zhu","submitted_at":"2025-07-20T17:35:31Z","abstract_excerpt":"Historically, a $\\sqrt{N}log^{1/2}(N)$ distance barrier for quantum low-density parity-check (LDPC) codes with $N$ qubits persisted for nearly two decades, until the recent discovery of the fibre-bundle code. An open question is whether such a distance barrier can be broken while preserving the ability to perform transversal non-Clifford gates. In this direction, another long-standing distance barrier of $N^{1/3}$ for LDPC stabilizer codes -- present since the discovery of the 3D color code -- was only recently overcome by a construction achieving an $\\Omega(\\sqrt{N})$ distance (arXiv:2501.193"},"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":"2507.15056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-20T17:35:31Z","cross_cats_sorted":["cond-mat.str-el","cs.IT","hep-th","math.GT","math.IT"],"title_canon_sha256":"41c8a62dd0b43d10927e3f9b7d4610971b3e5fc6e0a67062ea879871a4d95549","abstract_canon_sha256":"1c56bbc0e8953889729669e11d2754bbdcb7e1c66380899498641ef1e06a3635"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:17.807958Z","signature_b64":"zeA8/bo9QH2zmV4slGV8WFUs619hQ+g0MrqThESMrumxaXHEciF2Uj4PSwVxBmwt0habUoxVA2emnCB26lMHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"316ade879dc93c99525659690adc9e10f6281a3e1b8625215356ae34a8a2e8b0","last_reissued_at":"2026-07-05T11:40:17.807487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:17.807487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transversal non-Clifford gates on qLDPC codes breaking the $\\sqrt{N}$ distance barrier and quantum-inspired geometry with $\\mathbb{Z}_2$ systolic freedom","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","cs.IT","hep-th","math.GT","math.IT"],"primary_cat":"quant-ph","authors_text":"Guanyu Zhu","submitted_at":"2025-07-20T17:35:31Z","abstract_excerpt":"Historically, a $\\sqrt{N}log^{1/2}(N)$ distance barrier for quantum low-density parity-check (LDPC) codes with $N$ qubits persisted for nearly two decades, until the recent discovery of the fibre-bundle code. An open question is whether such a distance barrier can be broken while preserving the ability to perform transversal non-Clifford gates. In this direction, another long-standing distance barrier of $N^{1/3}$ for LDPC stabilizer codes -- present since the discovery of the 3D color code -- was only recently overcome by a construction achieving an $\\Omega(\\sqrt{N})$ distance (arXiv:2501.193"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15056","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/2507.15056/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":"2507.15056","created_at":"2026-07-05T11:40:17.807551+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15056v1","created_at":"2026-07-05T11:40:17.807551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15056","created_at":"2026-07-05T11:40:17.807551+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFVN5B45ZE6J","created_at":"2026-07-05T11:40:17.807551+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFVN5B45ZE6JSUSW","created_at":"2026-07-05T11:40:17.807551+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFVN5B45","created_at":"2026-07-05T11:40:17.807551+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.02900","citing_title":"Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic","ref_index":24,"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":101,"is_internal_anchor":false},{"citing_arxiv_id":"2511.15783","citing_title":"Automorphism in Gauge Theories: Higher Symmetries and Transversal Non-Clifford Logical Gates","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2603.04156","citing_title":"Achieving Optimal-Distance Atom-Loss Correction via Pauli Envelope","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GFVN5B45ZE6JSUSWLFUQVXE6CD","json":"https://pith.science/pith/GFVN5B45ZE6JSUSWLFUQVXE6CD.json","graph_json":"https://pith.science/api/pith-number/GFVN5B45ZE6JSUSWLFUQVXE6CD/graph.json","events_json":"https://pith.science/api/pith-number/GFVN5B45ZE6JSUSWLFUQVXE6CD/events.json","paper":"https://pith.science/paper/GFVN5B45"},"agent_actions":{"view_html":"https://pith.science/pith/GFVN5B45ZE6JSUSWLFUQVXE6CD","download_json":"https://pith.science/pith/GFVN5B45ZE6JSUSWLFUQVXE6CD.json","view_paper":"https://pith.science/paper/GFVN5B45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15056&json=true","fetch_graph":"https://pith.science/api/pith-number/GFVN5B45ZE6JSUSWLFUQVXE6CD/graph.json","fetch_events":"https://pith.science/api/pith-number/GFVN5B45ZE6JSUSWLFUQVXE6CD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFVN5B45ZE6JSUSWLFUQVXE6CD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFVN5B45ZE6JSUSWLFUQVXE6CD/action/storage_attestation","attest_author":"https://pith.science/pith/GFVN5B45ZE6JSUSWLFUQVXE6CD/action/author_attestation","sign_citation":"https://pith.science/pith/GFVN5B45ZE6JSUSWLFUQVXE6CD/action/citation_signature","submit_replication":"https://pith.science/pith/GFVN5B45ZE6JSUSWLFUQVXE6CD/action/replication_record"}},"created_at":"2026-07-05T11:40:17.807551+00:00","updated_at":"2026-07-05T11:40:17.807551+00:00"}