{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BL4W6TYNAWODVAD5STOBH2Q2GS","short_pith_number":"pith:BL4W6TYN","schema_version":"1.0","canonical_sha256":"0af96f4f0d059c3a807d94dc13ea1a34a6a50634b6a5f49c2a6a25c490e47735","source":{"kind":"arxiv","id":"2605.15348","version":1},"attestation_state":"computed","paper":{"title":"Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Clifford-deformed zero-rate LDPC codes achieve 50% thresholds under pure dephasing when biased logical operators scale slower than distance.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Arpit Dua, Arthur Pesah, Jagannath Das, Pedro Medina, Sayandip Dhara","submitted_at":"2026-05-14T19:18:25Z","abstract_excerpt":"Applying single-qubit Clifford unitaries to a Pauli stabilizer code produces a Clifford-deformed variant whose stabilizers remain Pauli operators, but with locally rotated Pauli axes. Such deformations provide a simple way to tailor a fixed code to anisotropic noise, and have enabled unusually high thresholds under strongly biased dephasing. In this work, we discuss zero-rate quantum low-density parity-check (LDPC) codes, for which there exist Clifford-deformed variants where the number of biased logical operators scales slower than the distance, or there exists a basis of logical operators wh"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.15348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T19:18:25Z","cross_cats_sorted":[],"title_canon_sha256":"37593ea4f5c119d2954ea07e26fcdb5d824c82032bd27641fcff3afb6d6fd040","abstract_canon_sha256":"acfe5e16542338c560a1909093393f89a4c72deaef208a0ecd5cb9824d230335"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:53.754988Z","signature_b64":"UpviSHI2UZ3UdIL6doAZGGQUVkrFhgpzWivz8LT0IE0xurQKYnhZRr3JAjUNJCRKu1GLg9arwZf6LidK5TzTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0af96f4f0d059c3a807d94dc13ea1a34a6a50634b6a5f49c2a6a25c490e47735","last_reissued_at":"2026-05-20T00:00:53.754240Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:53.754240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Clifford-deformed zero-rate LDPC codes achieve 50% thresholds under pure dephasing when biased logical operators scale slower than distance.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Arpit Dua, Arthur Pesah, Jagannath Das, Pedro Medina, Sayandip Dhara","submitted_at":"2026-05-14T19:18:25Z","abstract_excerpt":"Applying single-qubit Clifford unitaries to a Pauli stabilizer code produces a Clifford-deformed variant whose stabilizers remain Pauli operators, but with locally rotated Pauli axes. Such deformations provide a simple way to tailor a fixed code to anisotropic noise, and have enabled unusually high thresholds under strongly biased dephasing. In this work, we discuss zero-rate quantum low-density parity-check (LDPC) codes, for which there exist Clifford-deformed variants where the number of biased logical operators scales slower than the distance, or there exists a basis of logical operators wh"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"There exist Clifford-deformed variants of zero-rate quantum LDPC codes where the number of biased logical operators scales slower than the distance or a basis of logical operators satisfies certain overlap scaling conditions, in which case the code-capacity threshold under i.i.d. pure dephasing noise approaches 50%.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that a Clifford deformation exists which preserves Pauli stabilizers while enforcing the required scaling or overlap conditions on the logical operators of the zero-rate LDPC code, as this property is what the abstract states is sufficient for the 50% threshold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Clifford-deformed zero-rate LDPC codes achieve 50% thresholds under pure dephasing when biased logical operators scale slower than distance.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2e4d9a1df0350c38e92d7a5c522f1be07e71fed8c2d7d71ba0fdce6adb23b8f7"},"source":{"id":"2605.15348","kind":"arxiv","version":1},"verdict":{"id":"f040ca74-4289-4428-863a-4457bb139b6f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:39:53.788289Z","strongest_claim":"There exist Clifford-deformed variants of zero-rate quantum LDPC codes where the number of biased logical operators scales slower than the distance or a basis of logical operators satisfies certain overlap scaling conditions, in which case the code-capacity threshold under i.i.d. pure dephasing noise approaches 50%.","one_line_summary":"Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that a Clifford deformation exists which preserves Pauli stabilizers while enforcing the required scaling or overlap conditions on the logical operators of the zero-rate LDPC code, as this property is what the abstract states is sufficient for the 50% threshold.","pith_extraction_headline":"Clifford-deformed zero-rate LDPC codes achieve 50% thresholds under pure dephasing when biased logical operators scale slower than distance."},"integrity":{"clean":false,"summary":{"advisory":2,"critical":0,"by_detector":{"doi_compliance":{"total":2,"advisory":2,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2605.15348/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.22331/q-2025-06-24-1779.URLhttps://doi.org/10.22331/q-2025-06-24-1779) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":29,"audited_at":"2026-05-19T15:53:59.729630Z","detected_doi":"10.22331/q-2025-06-24-1779.URLhttps://doi.org/10.22331/q-2025-06-24-1779","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1002/1521-3978(200009) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":57,"audited_at":"2026-05-19T15:53:59.729630Z","detected_doi":"10.1002/1521-3978(200009","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.111632Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:53:59.729630Z","status":"completed","version":"1.0.0","findings_count":2},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.205156Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.751067Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"3a0d6527f112bcaa824d6c3cad2238caab1fa5da7281aadb3a42a9e99ba28a77"},"references":{"count":77,"sample":[{"doi":"10.1103/l4mx-l3xx","year":2025,"title":"Breuckmann, Francisco Revson Fernandes Pereira, and Jens Niklas Eberhardt","work_id":"01073f8d-c6ba-4af3-83c2-dbe4fe618828","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1103/prxquantum.5.010347","year":2024,"title":"Flammia, and Michael J","work_id":"7cf7d4cc-2369-44c3-8e25-83298b7a149f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1088/1367-2630/11/1/013061","year":2009,"title":"Fault-tolerant computing with biased- noise superconducting qubits: a case study","work_id":"965717cd-0fb0-479c-a8b7-622013f5bb11","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1126/science.1253742","year":2014,"title":"D. Nigg, M. Muller, E. A. Martinez, P. Schindler, M. Hennrich, T. Monz, M. A. Martin-Delgado, and R. Blatt. Quantum computations on a topologically encoded qubit. Science, 345(6194):302–305, Jun 2014.","work_id":"64db240e-d3c0-4bd1-b098-9e80f4a268cc","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1126/science.1217692","year":2012,"title":"M. D. Shulman, O. E. Dial, S. P. Harvey, H. Bluhm, V. Umansky, and A. Yacoby. Demonstration of entan- glement of electrostatically coupled singlet-triplet qubits. Science, 336(6078):202–205, Apr 2012.","work_id":"72b5c135-cae3-4eb2-aa4c-64bf96a6787d","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":77,"snapshot_sha256":"a4a6b23ed47232ae732d28deb809fdc786a73393108d1f4d91a8dfac739da444","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c4e8263fee9064d4e208d8d1863c6fdb78d6319c32713ecb7a036f909a149ab8"},"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":"2605.15348","created_at":"2026-05-20T00:00:53.754368+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15348v1","created_at":"2026-05-20T00:00:53.754368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15348","created_at":"2026-05-20T00:00:53.754368+00:00"},{"alias_kind":"pith_short_12","alias_value":"BL4W6TYNAWOD","created_at":"2026-05-20T00:00:53.754368+00:00"},{"alias_kind":"pith_short_16","alias_value":"BL4W6TYNAWODVAD5","created_at":"2026-05-20T00:00:53.754368+00:00"},{"alias_kind":"pith_short_8","alias_value":"BL4W6TYN","created_at":"2026-05-20T00:00:53.754368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BL4W6TYNAWODVAD5STOBH2Q2GS","json":"https://pith.science/pith/BL4W6TYNAWODVAD5STOBH2Q2GS.json","graph_json":"https://pith.science/api/pith-number/BL4W6TYNAWODVAD5STOBH2Q2GS/graph.json","events_json":"https://pith.science/api/pith-number/BL4W6TYNAWODVAD5STOBH2Q2GS/events.json","paper":"https://pith.science/paper/BL4W6TYN"},"agent_actions":{"view_html":"https://pith.science/pith/BL4W6TYNAWODVAD5STOBH2Q2GS","download_json":"https://pith.science/pith/BL4W6TYNAWODVAD5STOBH2Q2GS.json","view_paper":"https://pith.science/paper/BL4W6TYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15348&json=true","fetch_graph":"https://pith.science/api/pith-number/BL4W6TYNAWODVAD5STOBH2Q2GS/graph.json","fetch_events":"https://pith.science/api/pith-number/BL4W6TYNAWODVAD5STOBH2Q2GS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BL4W6TYNAWODVAD5STOBH2Q2GS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BL4W6TYNAWODVAD5STOBH2Q2GS/action/storage_attestation","attest_author":"https://pith.science/pith/BL4W6TYNAWODVAD5STOBH2Q2GS/action/author_attestation","sign_citation":"https://pith.science/pith/BL4W6TYNAWODVAD5STOBH2Q2GS/action/citation_signature","submit_replication":"https://pith.science/pith/BL4W6TYNAWODVAD5STOBH2Q2GS/action/replication_record"}},"created_at":"2026-05-20T00:00:53.754368+00:00","updated_at":"2026-05-20T00:00:53.754368+00:00"}