{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EA2I7BWLHP2YYMNITMOTEFLOOH","short_pith_number":"pith:EA2I7BWL","schema_version":"1.0","canonical_sha256":"20348f86cb3bf58c31a89b1d32156e71fb558f4fd45287615fc578954134fef6","source":{"kind":"arxiv","id":"2407.03973","version":1},"attestation_state":"computed","paper":{"title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Jens Niklas Eberhardt, Vincent Steffan","submitted_at":"2024-07-04T14:49:35Z","abstract_excerpt":"Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computation with constant overhead. Recent advancements have shown that qLDPC codes can outperform the quantum memory capability of surface codes even with near-term hardware. The question of how to implement logical gates fault-tolerantly for these codes is still open. We present new examples of high-rate bivariate bicycle (BB) codes with enhanced symmetry properties. These codes feature explicit nice bases of logical operators (similar to toric codes) and support fold-transversal Cliffor"},"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.03973","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-04T14:49:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1315c7cfff877fa5cc75a330456fd114f8697e8dfa9be656e8769fa8d64229b6","abstract_canon_sha256":"6a8898c044695be6e91bf50d319a88bd114186e11a564ebf52fac3256bb666b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:27.008439Z","signature_b64":"r4vHnJvtVRqA+RdjrytqF6r67nh6T+R1ehM5E1hAMAGomLozFd1s66TqzV4WiboK/WWWSA2ptuFkUvUB03fnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20348f86cb3bf58c31a89b1d32156e71fb558f4fd45287615fc578954134fef6","last_reissued_at":"2026-07-05T08:40:27.008019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:27.008019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Jens Niklas Eberhardt, Vincent Steffan","submitted_at":"2024-07-04T14:49:35Z","abstract_excerpt":"Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computation with constant overhead. Recent advancements have shown that qLDPC codes can outperform the quantum memory capability of surface codes even with near-term hardware. The question of how to implement logical gates fault-tolerantly for these codes is still open. We present new examples of high-rate bivariate bicycle (BB) codes with enhanced symmetry properties. These codes feature explicit nice bases of logical operators (similar to toric codes) and support fold-transversal Cliffor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.03973","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/2407.03973/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.03973","created_at":"2026-07-05T08:40:27.008075+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.03973v1","created_at":"2026-07-05T08:40:27.008075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.03973","created_at":"2026-07-05T08:40:27.008075+00:00"},{"alias_kind":"pith_short_12","alias_value":"EA2I7BWLHP2Y","created_at":"2026-07-05T08:40:27.008075+00:00"},{"alias_kind":"pith_short_16","alias_value":"EA2I7BWLHP2YYMNI","created_at":"2026-07-05T08:40:27.008075+00:00"},{"alias_kind":"pith_short_8","alias_value":"EA2I7BWL","created_at":"2026-07-05T08:40:27.008075+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19482","citing_title":"Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08771","citing_title":"Algebra of Bivariate-Bicycle Surface Codes","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05044","citing_title":"Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure","ref_index":23,"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":115,"is_internal_anchor":false},{"citing_arxiv_id":"2410.16250","citing_title":"Cups and Gates I: Cohomology invariants and logical quantum operations","ref_index":70,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":171,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EA2I7BWLHP2YYMNITMOTEFLOOH","json":"https://pith.science/pith/EA2I7BWLHP2YYMNITMOTEFLOOH.json","graph_json":"https://pith.science/api/pith-number/EA2I7BWLHP2YYMNITMOTEFLOOH/graph.json","events_json":"https://pith.science/api/pith-number/EA2I7BWLHP2YYMNITMOTEFLOOH/events.json","paper":"https://pith.science/paper/EA2I7BWL"},"agent_actions":{"view_html":"https://pith.science/pith/EA2I7BWLHP2YYMNITMOTEFLOOH","download_json":"https://pith.science/pith/EA2I7BWLHP2YYMNITMOTEFLOOH.json","view_paper":"https://pith.science/paper/EA2I7BWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.03973&json=true","fetch_graph":"https://pith.science/api/pith-number/EA2I7BWLHP2YYMNITMOTEFLOOH/graph.json","fetch_events":"https://pith.science/api/pith-number/EA2I7BWLHP2YYMNITMOTEFLOOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EA2I7BWLHP2YYMNITMOTEFLOOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EA2I7BWLHP2YYMNITMOTEFLOOH/action/storage_attestation","attest_author":"https://pith.science/pith/EA2I7BWLHP2YYMNITMOTEFLOOH/action/author_attestation","sign_citation":"https://pith.science/pith/EA2I7BWLHP2YYMNITMOTEFLOOH/action/citation_signature","submit_replication":"https://pith.science/pith/EA2I7BWLHP2YYMNITMOTEFLOOH/action/replication_record"}},"created_at":"2026-07-05T08:40:27.008075+00:00","updated_at":"2026-07-05T08:40:27.008075+00:00"}