{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FQX6AFMU7RHG2T7C5ZVD2IG6XQ","short_pith_number":"pith:FQX6AFMU","schema_version":"1.0","canonical_sha256":"2c2fe01594fc4e6d4fe2ee6a3d20debc295e7dab091e3e1ad07502319bbe00ab","source":{"kind":"arxiv","id":"2203.03581","version":1},"attestation_state":"computed","paper":{"title":"Good quantum LDPC codes with linear time decoder from lossless expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Min-Hsiu Hsieh, Ting-Chun Lin","submitted_at":"2022-03-07T18:30:45Z","abstract_excerpt":"Quantum low-density parity-check (qLDPC) codes are quantum stabilizer codes where each stabilizer acts on a constant number of qubits and each qubit is acted on by a constant number of stabilizers. We study qLDPC codes constructed from balanced products and lossless expanders. We found that assuming the existence of 2-sided lossless expander graphs with free group action, the resulting qLDPC codes have constant rate, linear distance, and linear time decoders."},"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":"2203.03581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-07T18:30:45Z","cross_cats_sorted":[],"title_canon_sha256":"92096b9483ff4d95223f3170dd6c4cc8fe57befa25e2ac20eb7414243406167e","abstract_canon_sha256":"dc603ace7b371ff9982a90f1334d822f1a2efc8a933141d50eb23342d54c1a1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:02:35.977743Z","signature_b64":"SJHYDCl60GtHx8HKY8+aUi+qKBTKhEgjfdFI/CPjwcala1wydXVD+8Efo5bTggG5Qr8apoguYJZRM2xEGtlrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c2fe01594fc4e6d4fe2ee6a3d20debc295e7dab091e3e1ad07502319bbe00ab","last_reissued_at":"2026-07-05T04:02:35.977236Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:02:35.977236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Good quantum LDPC codes with linear time decoder from lossless expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Min-Hsiu Hsieh, Ting-Chun Lin","submitted_at":"2022-03-07T18:30:45Z","abstract_excerpt":"Quantum low-density parity-check (qLDPC) codes are quantum stabilizer codes where each stabilizer acts on a constant number of qubits and each qubit is acted on by a constant number of stabilizers. We study qLDPC codes constructed from balanced products and lossless expanders. We found that assuming the existence of 2-sided lossless expander graphs with free group action, the resulting qLDPC codes have constant rate, linear distance, and linear time decoders."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03581","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/2203.03581/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":"2203.03581","created_at":"2026-07-05T04:02:35.977295+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.03581v1","created_at":"2026-07-05T04:02:35.977295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03581","created_at":"2026-07-05T04:02:35.977295+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQX6AFMU7RHG","created_at":"2026-07-05T04:02:35.977295+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQX6AFMU7RHG2T7C","created_at":"2026-07-05T04:02:35.977295+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQX6AFMU","created_at":"2026-07-05T04:02:35.977295+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30385","citing_title":"Blueprint for a fault-tolerant compound photon-atom quantum architecture","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19442","citing_title":"Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQX6AFMU7RHG2T7C5ZVD2IG6XQ","json":"https://pith.science/pith/FQX6AFMU7RHG2T7C5ZVD2IG6XQ.json","graph_json":"https://pith.science/api/pith-number/FQX6AFMU7RHG2T7C5ZVD2IG6XQ/graph.json","events_json":"https://pith.science/api/pith-number/FQX6AFMU7RHG2T7C5ZVD2IG6XQ/events.json","paper":"https://pith.science/paper/FQX6AFMU"},"agent_actions":{"view_html":"https://pith.science/pith/FQX6AFMU7RHG2T7C5ZVD2IG6XQ","download_json":"https://pith.science/pith/FQX6AFMU7RHG2T7C5ZVD2IG6XQ.json","view_paper":"https://pith.science/paper/FQX6AFMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.03581&json=true","fetch_graph":"https://pith.science/api/pith-number/FQX6AFMU7RHG2T7C5ZVD2IG6XQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FQX6AFMU7RHG2T7C5ZVD2IG6XQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQX6AFMU7RHG2T7C5ZVD2IG6XQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQX6AFMU7RHG2T7C5ZVD2IG6XQ/action/storage_attestation","attest_author":"https://pith.science/pith/FQX6AFMU7RHG2T7C5ZVD2IG6XQ/action/author_attestation","sign_citation":"https://pith.science/pith/FQX6AFMU7RHG2T7C5ZVD2IG6XQ/action/citation_signature","submit_replication":"https://pith.science/pith/FQX6AFMU7RHG2T7C5ZVD2IG6XQ/action/replication_record"}},"created_at":"2026-07-05T04:02:35.977295+00:00","updated_at":"2026-07-05T04:02:35.977295+00:00"}