{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7ZPZWYVSLF4OH7SR6YURF3HN3Y","short_pith_number":"pith:7ZPZWYVS","schema_version":"1.0","canonical_sha256":"fe5f9b62b25978e3fe51f62912ecedde22a3a6522d142f94e73f0f90643926ed","source":{"kind":"arxiv","id":"2305.06890","version":2},"attestation_state":"computed","paper":{"title":"Abelian and non-abelian quantum two-block codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hsiang-Ku Lin, Leonid P. Pryadko, Renyu Wang","submitted_at":"2023-05-11T15:28:02Z","abstract_excerpt":"We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian. We present code construction and give several expressions for code dimension, applicable depending on whether the constituent group is cyclic, abelian, or non-abelian. This gives a simple criterion for an essentially non-abelian 2BGA code guaranteed not to be permutation-equivalent to such"},"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":"2305.06890","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-11T15:28:02Z","cross_cats_sorted":[],"title_canon_sha256":"d0fe12118bc163a8b2e577a232bfe2770d7e81fec954de4120c5c4ccaa6ea9b9","abstract_canon_sha256":"4281c83fa27fc83ba04cf7d38e857954efab9745876787aed7080970af510352"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:51.219432Z","signature_b64":"6uM2slXVhHWirXLMu0jR+iYy6nfTfzKACLo6Yb0xVlXJmJxEXKFUzyBDyqatyEIsJeNZ8hSjfCfcZ2rCXzzODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe5f9b62b25978e3fe51f62912ecedde22a3a6522d142f94e73f0f90643926ed","last_reissued_at":"2026-07-05T06:35:51.218922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:51.218922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Abelian and non-abelian quantum two-block codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hsiang-Ku Lin, Leonid P. Pryadko, Renyu Wang","submitted_at":"2023-05-11T15:28:02Z","abstract_excerpt":"We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian. We present code construction and give several expressions for code dimension, applicable depending on whether the constituent group is cyclic, abelian, or non-abelian. This gives a simple criterion for an essentially non-abelian 2BGA code guaranteed not to be permutation-equivalent to such"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.06890","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/2305.06890/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":"2305.06890","created_at":"2026-07-05T06:35:51.218979+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.06890v2","created_at":"2026-07-05T06:35:51.218979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.06890","created_at":"2026-07-05T06:35:51.218979+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZPZWYVSLF4O","created_at":"2026-07-05T06:35:51.218979+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZPZWYVSLF4OH7SR","created_at":"2026-07-05T06:35:51.218979+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZPZWYVS","created_at":"2026-07-05T06:35:51.218979+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22853","citing_title":"Bunny Codes: Broadening Superconducting Quantum Error Correction Capability through Advanced Control Engineering","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08771","citing_title":"Algebra of Bivariate-Bicycle Surface Codes","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06062","citing_title":"Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware","ref_index":82,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19298","citing_title":"Translation-invariant quantum low-density parity-check codes from compactified fracton models","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ZPZWYVSLF4OH7SR6YURF3HN3Y","json":"https://pith.science/pith/7ZPZWYVSLF4OH7SR6YURF3HN3Y.json","graph_json":"https://pith.science/api/pith-number/7ZPZWYVSLF4OH7SR6YURF3HN3Y/graph.json","events_json":"https://pith.science/api/pith-number/7ZPZWYVSLF4OH7SR6YURF3HN3Y/events.json","paper":"https://pith.science/paper/7ZPZWYVS"},"agent_actions":{"view_html":"https://pith.science/pith/7ZPZWYVSLF4OH7SR6YURF3HN3Y","download_json":"https://pith.science/pith/7ZPZWYVSLF4OH7SR6YURF3HN3Y.json","view_paper":"https://pith.science/paper/7ZPZWYVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.06890&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZPZWYVSLF4OH7SR6YURF3HN3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZPZWYVSLF4OH7SR6YURF3HN3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZPZWYVSLF4OH7SR6YURF3HN3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZPZWYVSLF4OH7SR6YURF3HN3Y/action/storage_attestation","attest_author":"https://pith.science/pith/7ZPZWYVSLF4OH7SR6YURF3HN3Y/action/author_attestation","sign_citation":"https://pith.science/pith/7ZPZWYVSLF4OH7SR6YURF3HN3Y/action/citation_signature","submit_replication":"https://pith.science/pith/7ZPZWYVSLF4OH7SR6YURF3HN3Y/action/replication_record"}},"created_at":"2026-07-05T06:35:51.218979+00:00","updated_at":"2026-07-05T06:35:51.218979+00:00"}