{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GIFVGSO2VGEZT5PH5AGWMAVMTZ","short_pith_number":"pith:GIFVGSO2","schema_version":"1.0","canonical_sha256":"320b5349daa98999f5e7e80d6602ac9e4fd451aa623f9517674ffe13d4aaae6c","source":{"kind":"arxiv","id":"2012.09271","version":3},"attestation_state":"computed","paper":{"title":"Balanced Product Quantum Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jens N. Eberhardt, Nikolas P. Breuckmann","submitted_at":"2020-12-16T21:19:38Z","abstract_excerpt":"This work provides the first explicit and non-random family of $[[N,K,D]]$ LDPC quantum codes which encode $K \\in \\Theta(N^\\frac{4}{5})$ logical qubits with distance $D \\in \\Omega(N^\\frac{3}{5})$. The family is constructed by amalgamating classical codes and Ramanujan graphs via an operation called balanced product.\n  Recently, Hastings-Haah-O'Donnell and Panteleev-Kalachev were the first to show that there exist families of LDPC quantum codes which break the $\\operatorname{polylog}(N)\\sqrt{N}$ distance barrier. However, their constructions are based on probabilistic arguments which only guara"},"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.09271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-12-16T21:19:38Z","cross_cats_sorted":[],"title_canon_sha256":"8266aaea22242c1b3e8892e87807af07f484d439967f78df84e41e3b1f1181ac","abstract_canon_sha256":"fd6097deb77f3dcf1dd7e8e641ac3f6400a387e3712c4493a7cb9f2be7be60bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:01:22.332817Z","signature_b64":"8owKGKaZFpAufdw49wlSqoAAxgX+K65QC4T9NAotTug7D0SEbBmoXUicd2sfOAkp2MxJQuP0fXY0f/SYjf/kCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"320b5349daa98999f5e7e80d6602ac9e4fd451aa623f9517674ffe13d4aaae6c","last_reissued_at":"2026-07-05T03:01:22.332357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:01:22.332357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced Product Quantum Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jens N. Eberhardt, Nikolas P. Breuckmann","submitted_at":"2020-12-16T21:19:38Z","abstract_excerpt":"This work provides the first explicit and non-random family of $[[N,K,D]]$ LDPC quantum codes which encode $K \\in \\Theta(N^\\frac{4}{5})$ logical qubits with distance $D \\in \\Omega(N^\\frac{3}{5})$. The family is constructed by amalgamating classical codes and Ramanujan graphs via an operation called balanced product.\n  Recently, Hastings-Haah-O'Donnell and Panteleev-Kalachev were the first to show that there exist families of LDPC quantum codes which break the $\\operatorname{polylog}(N)\\sqrt{N}$ distance barrier. However, their constructions are based on probabilistic arguments which only guara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09271","kind":"arxiv","version":3},"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.09271/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.09271","created_at":"2026-07-05T03:01:22.332411+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.09271v3","created_at":"2026-07-05T03:01:22.332411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09271","created_at":"2026-07-05T03:01:22.332411+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIFVGSO2VGEZ","created_at":"2026-07-05T03:01:22.332411+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIFVGSO2VGEZT5PH","created_at":"2026-07-05T03:01:22.332411+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIFVGSO2","created_at":"2026-07-05T03:01:22.332411+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.02213","citing_title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GIFVGSO2VGEZT5PH5AGWMAVMTZ","json":"https://pith.science/pith/GIFVGSO2VGEZT5PH5AGWMAVMTZ.json","graph_json":"https://pith.science/api/pith-number/GIFVGSO2VGEZT5PH5AGWMAVMTZ/graph.json","events_json":"https://pith.science/api/pith-number/GIFVGSO2VGEZT5PH5AGWMAVMTZ/events.json","paper":"https://pith.science/paper/GIFVGSO2"},"agent_actions":{"view_html":"https://pith.science/pith/GIFVGSO2VGEZT5PH5AGWMAVMTZ","download_json":"https://pith.science/pith/GIFVGSO2VGEZT5PH5AGWMAVMTZ.json","view_paper":"https://pith.science/paper/GIFVGSO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.09271&json=true","fetch_graph":"https://pith.science/api/pith-number/GIFVGSO2VGEZT5PH5AGWMAVMTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GIFVGSO2VGEZT5PH5AGWMAVMTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIFVGSO2VGEZT5PH5AGWMAVMTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIFVGSO2VGEZT5PH5AGWMAVMTZ/action/storage_attestation","attest_author":"https://pith.science/pith/GIFVGSO2VGEZT5PH5AGWMAVMTZ/action/author_attestation","sign_citation":"https://pith.science/pith/GIFVGSO2VGEZT5PH5AGWMAVMTZ/action/citation_signature","submit_replication":"https://pith.science/pith/GIFVGSO2VGEZT5PH5AGWMAVMTZ/action/replication_record"}},"created_at":"2026-07-05T03:01:22.332411+00:00","updated_at":"2026-07-05T03:01:22.332411+00:00"}