{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PAGKO3I4XSDGQS6ZFAGP2QN6HF","short_pith_number":"pith:PAGKO3I4","schema_version":"1.0","canonical_sha256":"780ca76d1cbc86684bd9280cfd41be396d8e3f408095d55a0264f9b10a6b4500","source":{"kind":"arxiv","id":"2407.16336","version":3},"attestation_state":"computed","paper":{"title":"Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara M. Terhal, Mackenzie H. Shaw","submitted_at":"2024-07-23T09:35:49Z","abstract_excerpt":"In Ref. [1], Bravyi et al. found examples of Bivariate Bicycle (BB) codes with similar logical performance to the surface code but with an improved encoding rate. In this work, we generalize a novel parity-check circuit design principle called morphing circuits and apply it to BB codes. We define a new family of BB codes whose parity check circuits require a qubit connectivity of degree five instead of six while maintaining their numerical performance. Logical input/output to an ancillary surface code is also possible in a biplanar layout. Finally, we develop a general framework for designing "},"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":"2407.16336","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-23T09:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"cc4743f2d17d7a783df46d9e91bc38e59f32941b6677ca49c07a536a6b5006c7","abstract_canon_sha256":"5e69f3ff33ab8013ce632e2996c1b6d2f6b132a1d965917c65a91a2295c65a00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:20.139337Z","signature_b64":"pJAH7TO/U8KUre3MRvqsTAJLXxYzrB8cggdWMuRwmk3FvYOYwHyo0N6+5g0Rpz7jzDHLbITFqmLwQpizt3xNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"780ca76d1cbc86684bd9280cfd41be396d8e3f408095d55a0264f9b10a6b4500","last_reissued_at":"2026-07-05T10:39:20.138830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:20.138830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara M. Terhal, Mackenzie H. Shaw","submitted_at":"2024-07-23T09:35:49Z","abstract_excerpt":"In Ref. [1], Bravyi et al. found examples of Bivariate Bicycle (BB) codes with similar logical performance to the surface code but with an improved encoding rate. In this work, we generalize a novel parity-check circuit design principle called morphing circuits and apply it to BB codes. We define a new family of BB codes whose parity check circuits require a qubit connectivity of degree five instead of six while maintaining their numerical performance. Logical input/output to an ancillary surface code is also possible in a biplanar layout. Finally, we develop a general framework for designing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.16336","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/2407.16336/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":"2407.16336","created_at":"2026-07-05T10:39:20.138889+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.16336v3","created_at":"2026-07-05T10:39:20.138889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.16336","created_at":"2026-07-05T10:39:20.138889+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAGKO3I4XSDG","created_at":"2026-07-05T10:39:20.138889+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAGKO3I4XSDGQS6Z","created_at":"2026-07-05T10:39:20.138889+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAGKO3I4","created_at":"2026-07-05T10:39:20.138889+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09678","citing_title":"The dynamic 4.8.8 Floquet code","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2410.11942","citing_title":"Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes","ref_index":121,"is_internal_anchor":false},{"citing_arxiv_id":"2604.01040","citing_title":"Geometry-induced correlated noise in qLDPC syndrome extraction","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PAGKO3I4XSDGQS6ZFAGP2QN6HF","json":"https://pith.science/pith/PAGKO3I4XSDGQS6ZFAGP2QN6HF.json","graph_json":"https://pith.science/api/pith-number/PAGKO3I4XSDGQS6ZFAGP2QN6HF/graph.json","events_json":"https://pith.science/api/pith-number/PAGKO3I4XSDGQS6ZFAGP2QN6HF/events.json","paper":"https://pith.science/paper/PAGKO3I4"},"agent_actions":{"view_html":"https://pith.science/pith/PAGKO3I4XSDGQS6ZFAGP2QN6HF","download_json":"https://pith.science/pith/PAGKO3I4XSDGQS6ZFAGP2QN6HF.json","view_paper":"https://pith.science/paper/PAGKO3I4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.16336&json=true","fetch_graph":"https://pith.science/api/pith-number/PAGKO3I4XSDGQS6ZFAGP2QN6HF/graph.json","fetch_events":"https://pith.science/api/pith-number/PAGKO3I4XSDGQS6ZFAGP2QN6HF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAGKO3I4XSDGQS6ZFAGP2QN6HF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAGKO3I4XSDGQS6ZFAGP2QN6HF/action/storage_attestation","attest_author":"https://pith.science/pith/PAGKO3I4XSDGQS6ZFAGP2QN6HF/action/author_attestation","sign_citation":"https://pith.science/pith/PAGKO3I4XSDGQS6ZFAGP2QN6HF/action/citation_signature","submit_replication":"https://pith.science/pith/PAGKO3I4XSDGQS6ZFAGP2QN6HF/action/replication_record"}},"created_at":"2026-07-05T10:39:20.138889+00:00","updated_at":"2026-07-05T10:39:20.138889+00:00"}