{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4CLMPQZQILERZZMOWWZS7NVEBT","short_pith_number":"pith:4CLMPQZQ","schema_version":"1.0","canonical_sha256":"e096c7c33042c91ce58eb5b32fb6a40ccfbf700039f58a9df7b832a0178b95fe","source":{"kind":"arxiv","id":"2606.11468","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"(2) Indian Institute of Science, Aditya Sodhani (1), Bengaluru, India), Keshab K. Parhi (1) ((1) University of Minnesota, Minneapolis, Pavan Kumar (2), Shayan Srinivasa Garani (2), USA","submitted_at":"2026-06-09T21:57:07Z","abstract_excerpt":"Entanglement-assisted (EA) quantum QC-LDPC codes offer strong error-correction capabilities with structured parity-check matrices, but their practical use depends on efficient encoder circuits and the availability of pre-shared Bell pairs (ebits). In all encoder implementations based on the stabilizer formalism, the dominant contribution to this complexity comes from the use of controlled gates. In this paper, we adopt the Sharma-Kumar-Garani (SKG) encoder construction. We formulate the encoder optimization as a search over GF(2) row operations that decompose the binary matrix derived from its"},"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":"2606.11468","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-09T21:57:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3135372c637dcafb537f8cb4fb8f0b7b2b245417e8925dd1970d43f3c62dbd60","abstract_canon_sha256":"f5f05eda436643b1070c35c12cfd14d43a5ff495b834dd8bfd07a64ca32e1432"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:50.747624Z","signature_b64":"raQb3BEuvWAFm5uakEosvSHLvq/QHKLNzGtcTnKUqYFDlLVI63LKhDDIanx6eswn1Q69zXJb0nCw94W4cn+wAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e096c7c33042c91ce58eb5b32fb6a40ccfbf700039f58a9df7b832a0178b95fe","last_reissued_at":"2026-06-11T01:09:50.746867Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:50.746867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"(2) Indian Institute of Science, Aditya Sodhani (1), Bengaluru, India), Keshab K. Parhi (1) ((1) University of Minnesota, Minneapolis, Pavan Kumar (2), Shayan Srinivasa Garani (2), USA","submitted_at":"2026-06-09T21:57:07Z","abstract_excerpt":"Entanglement-assisted (EA) quantum QC-LDPC codes offer strong error-correction capabilities with structured parity-check matrices, but their practical use depends on efficient encoder circuits and the availability of pre-shared Bell pairs (ebits). In all encoder implementations based on the stabilizer formalism, the dominant contribution to this complexity comes from the use of controlled gates. In this paper, we adopt the Sharma-Kumar-Garani (SKG) encoder construction. We formulate the encoder optimization as a search over GF(2) row operations that decompose the binary matrix derived from its"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11468","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/2606.11468/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":"2606.11468","created_at":"2026-06-11T01:09:50.746995+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11468v1","created_at":"2026-06-11T01:09:50.746995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11468","created_at":"2026-06-11T01:09:50.746995+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CLMPQZQILER","created_at":"2026-06-11T01:09:50.746995+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CLMPQZQILERZZMO","created_at":"2026-06-11T01:09:50.746995+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CLMPQZQ","created_at":"2026-06-11T01:09:50.746995+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4CLMPQZQILERZZMOWWZS7NVEBT","json":"https://pith.science/pith/4CLMPQZQILERZZMOWWZS7NVEBT.json","graph_json":"https://pith.science/api/pith-number/4CLMPQZQILERZZMOWWZS7NVEBT/graph.json","events_json":"https://pith.science/api/pith-number/4CLMPQZQILERZZMOWWZS7NVEBT/events.json","paper":"https://pith.science/paper/4CLMPQZQ"},"agent_actions":{"view_html":"https://pith.science/pith/4CLMPQZQILERZZMOWWZS7NVEBT","download_json":"https://pith.science/pith/4CLMPQZQILERZZMOWWZS7NVEBT.json","view_paper":"https://pith.science/paper/4CLMPQZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11468&json=true","fetch_graph":"https://pith.science/api/pith-number/4CLMPQZQILERZZMOWWZS7NVEBT/graph.json","fetch_events":"https://pith.science/api/pith-number/4CLMPQZQILERZZMOWWZS7NVEBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CLMPQZQILERZZMOWWZS7NVEBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CLMPQZQILERZZMOWWZS7NVEBT/action/storage_attestation","attest_author":"https://pith.science/pith/4CLMPQZQILERZZMOWWZS7NVEBT/action/author_attestation","sign_citation":"https://pith.science/pith/4CLMPQZQILERZZMOWWZS7NVEBT/action/citation_signature","submit_replication":"https://pith.science/pith/4CLMPQZQILERZZMOWWZS7NVEBT/action/replication_record"}},"created_at":"2026-06-11T01:09:50.746995+00:00","updated_at":"2026-06-11T01:09:50.746995+00:00"}