{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XD3OQKXYW6SEDL5IKPNNGRCTMD","short_pith_number":"pith:XD3OQKXY","schema_version":"1.0","canonical_sha256":"b8f6e82af8b7a441afa853dad3445360f681776cb55167bc20e48edf63f925f6","source":{"kind":"arxiv","id":"2012.04068","version":2},"attestation_state":"computed","paper":{"title":"Quantum LDPC Codes with Almost Linear Minimum Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Gleb Kalachev, Pavel Panteleev","submitted_at":"2020-12-07T21:20:53Z","abstract_excerpt":"We give a construction of quantum LDPC codes of dimension $\\Theta(\\log N)$ and distance $\\Theta(N/\\log N)$ as the code length $N\\to\\infty$. Using a product of chain complexes this construction also provides a family of quantum LDPC codes of distance $\\Omega(N^{1-\\alpha/2}/\\log N)$ and dimension $\\Omega(N^\\alpha \\log N)$, where $0 \\le \\alpha < 1$. We also introduce and study a new operation called lifted product, which naturally generalizes the product operations for quantum codes and chain complexes. Moreover, as a simple byproduct of our results on quantum codes, we obtain a new result on cla"},"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":"2012.04068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-12-07T21:20:53Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"c29acf714313028d7cf8227cfe43a40c3e04d54c481cd5e5e269154d131dbadf","abstract_canon_sha256":"6b7cd96cd3ad77ebe1407a93b85c6328bb6d31e7034bd62a2b1dfbb4c80cb243"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:46:43.822595Z","signature_b64":"juuHT8sTI0IxlyuNLmji70YjH9RLk3YndvoMP8Qjq5f895hGhIsaj2HTqZ7JaKdfw2bNGftDZDtX8OPNtXVdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8f6e82af8b7a441afa853dad3445360f681776cb55167bc20e48edf63f925f6","last_reissued_at":"2026-07-05T03:46:43.822168Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:46:43.822168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum LDPC Codes with Almost Linear Minimum Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Gleb Kalachev, Pavel Panteleev","submitted_at":"2020-12-07T21:20:53Z","abstract_excerpt":"We give a construction of quantum LDPC codes of dimension $\\Theta(\\log N)$ and distance $\\Theta(N/\\log N)$ as the code length $N\\to\\infty$. Using a product of chain complexes this construction also provides a family of quantum LDPC codes of distance $\\Omega(N^{1-\\alpha/2}/\\log N)$ and dimension $\\Omega(N^\\alpha \\log N)$, where $0 \\le \\alpha < 1$. We also introduce and study a new operation called lifted product, which naturally generalizes the product operations for quantum codes and chain complexes. Moreover, as a simple byproduct of our results on quantum codes, we obtain a new result on cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04068","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/2012.04068/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":"2012.04068","created_at":"2026-07-05T03:46:43.822224+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.04068v2","created_at":"2026-07-05T03:46:43.822224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04068","created_at":"2026-07-05T03:46:43.822224+00:00"},{"alias_kind":"pith_short_12","alias_value":"XD3OQKXYW6SE","created_at":"2026-07-05T03:46:43.822224+00:00"},{"alias_kind":"pith_short_16","alias_value":"XD3OQKXYW6SEDL5I","created_at":"2026-07-05T03:46:43.822224+00:00"},{"alias_kind":"pith_short_8","alias_value":"XD3OQKXY","created_at":"2026-07-05T03:46:43.822224+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.02213","citing_title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20013","citing_title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XD3OQKXYW6SEDL5IKPNNGRCTMD","json":"https://pith.science/pith/XD3OQKXYW6SEDL5IKPNNGRCTMD.json","graph_json":"https://pith.science/api/pith-number/XD3OQKXYW6SEDL5IKPNNGRCTMD/graph.json","events_json":"https://pith.science/api/pith-number/XD3OQKXYW6SEDL5IKPNNGRCTMD/events.json","paper":"https://pith.science/paper/XD3OQKXY"},"agent_actions":{"view_html":"https://pith.science/pith/XD3OQKXYW6SEDL5IKPNNGRCTMD","download_json":"https://pith.science/pith/XD3OQKXYW6SEDL5IKPNNGRCTMD.json","view_paper":"https://pith.science/paper/XD3OQKXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.04068&json=true","fetch_graph":"https://pith.science/api/pith-number/XD3OQKXYW6SEDL5IKPNNGRCTMD/graph.json","fetch_events":"https://pith.science/api/pith-number/XD3OQKXYW6SEDL5IKPNNGRCTMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XD3OQKXYW6SEDL5IKPNNGRCTMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XD3OQKXYW6SEDL5IKPNNGRCTMD/action/storage_attestation","attest_author":"https://pith.science/pith/XD3OQKXYW6SEDL5IKPNNGRCTMD/action/author_attestation","sign_citation":"https://pith.science/pith/XD3OQKXYW6SEDL5IKPNNGRCTMD/action/citation_signature","submit_replication":"https://pith.science/pith/XD3OQKXYW6SEDL5IKPNNGRCTMD/action/replication_record"}},"created_at":"2026-07-05T03:46:43.822224+00:00","updated_at":"2026-07-05T03:46:43.822224+00:00"}