{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HLXF4QVZBLPVUIJN6INIDSWI4E","short_pith_number":"pith:HLXF4QVZ","schema_version":"1.0","canonical_sha256":"3aee5e42b90adf5a212df21a81cac8e129b17008585091aead51c8b01405161e","source":{"kind":"arxiv","id":"2503.04699","version":2},"attestation_state":"computed","paper":{"title":"Anyon Theory and Topological Frustration of High-Efficiency Quantum Low-Density Parity-Check Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Hao Song, Ke Liu, Keyang Chen, Yiming Zhang, Yu-An Chen, Yuanting Liu, Zijian Liang","submitted_at":"2025-03-06T18:46:14Z","abstract_excerpt":"Quantum low-density parity-check (QLDPC) codes offer a promising path to low-overhead fault-tolerant quantum computation but lack systematic strategies for exploration. In this Letter, we establish a topological framework for studying the bivariate-bicycle codes, a prominent class of QLDPC codes tailored for real-world quantum hardware. Our framework enables the investigation of these codes through universal properties of topological orders. In addition to efficient characterizations using Gr\\\"obner bases, we also introduce a novel algebraic-geometric approach based on the Bernstein--Khovanski"},"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":"2503.04699","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-06T18:46:14Z","cross_cats_sorted":["cond-mat.str-el","math-ph","math.MP"],"title_canon_sha256":"e83637f69036e894a01fe337ad17fe2bc628f713f57b0e5894c4215762a00ea4","abstract_canon_sha256":"40cc7d3e6b3dce01349cb28e0adb7a409ab458e49778656e03875e33465c8a35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:18.021639Z","signature_b64":"JFY/Xl9FOogA1xV5P5zzBm+q6yBcHQ4YQ0fGzbV9fCtYCiqcZIkzkKTTgtWYobi2WB1VN9/uf1e5xuRIKUSJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aee5e42b90adf5a212df21a81cac8e129b17008585091aead51c8b01405161e","last_reissued_at":"2026-07-05T11:56:18.021148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:18.021148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anyon Theory and Topological Frustration of High-Efficiency Quantum Low-Density Parity-Check Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Hao Song, Ke Liu, Keyang Chen, Yiming Zhang, Yu-An Chen, Yuanting Liu, Zijian Liang","submitted_at":"2025-03-06T18:46:14Z","abstract_excerpt":"Quantum low-density parity-check (QLDPC) codes offer a promising path to low-overhead fault-tolerant quantum computation but lack systematic strategies for exploration. In this Letter, we establish a topological framework for studying the bivariate-bicycle codes, a prominent class of QLDPC codes tailored for real-world quantum hardware. Our framework enables the investigation of these codes through universal properties of topological orders. In addition to efficient characterizations using Gr\\\"obner bases, we also introduce a novel algebraic-geometric approach based on the Bernstein--Khovanski"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.04699","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/2503.04699/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":"2503.04699","created_at":"2026-07-05T11:56:18.021208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.04699v2","created_at":"2026-07-05T11:56:18.021208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.04699","created_at":"2026-07-05T11:56:18.021208+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLXF4QVZBLPV","created_at":"2026-07-05T11:56:18.021208+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLXF4QVZBLPVUIJN","created_at":"2026-07-05T11:56:18.021208+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLXF4QVZ","created_at":"2026-07-05T11:56:18.021208+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06062","citing_title":"Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware","ref_index":94,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HLXF4QVZBLPVUIJN6INIDSWI4E","json":"https://pith.science/pith/HLXF4QVZBLPVUIJN6INIDSWI4E.json","graph_json":"https://pith.science/api/pith-number/HLXF4QVZBLPVUIJN6INIDSWI4E/graph.json","events_json":"https://pith.science/api/pith-number/HLXF4QVZBLPVUIJN6INIDSWI4E/events.json","paper":"https://pith.science/paper/HLXF4QVZ"},"agent_actions":{"view_html":"https://pith.science/pith/HLXF4QVZBLPVUIJN6INIDSWI4E","download_json":"https://pith.science/pith/HLXF4QVZBLPVUIJN6INIDSWI4E.json","view_paper":"https://pith.science/paper/HLXF4QVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.04699&json=true","fetch_graph":"https://pith.science/api/pith-number/HLXF4QVZBLPVUIJN6INIDSWI4E/graph.json","fetch_events":"https://pith.science/api/pith-number/HLXF4QVZBLPVUIJN6INIDSWI4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLXF4QVZBLPVUIJN6INIDSWI4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLXF4QVZBLPVUIJN6INIDSWI4E/action/storage_attestation","attest_author":"https://pith.science/pith/HLXF4QVZBLPVUIJN6INIDSWI4E/action/author_attestation","sign_citation":"https://pith.science/pith/HLXF4QVZBLPVUIJN6INIDSWI4E/action/citation_signature","submit_replication":"https://pith.science/pith/HLXF4QVZBLPVUIJN6INIDSWI4E/action/replication_record"}},"created_at":"2026-07-05T11:56:18.021208+00:00","updated_at":"2026-07-05T11:56:18.021208+00:00"}