{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7EXXNNIZHXYECWNDM2PC27ETIA","short_pith_number":"pith:7EXXNNIZ","schema_version":"1.0","canonical_sha256":"f92f76b5193df04159a3669e2d7c934035ccdeac4413a25657a09a33009c3844","source":{"kind":"arxiv","id":"2308.03750","version":2},"attestation_state":"computed","paper":{"title":"Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nikolas P. Breuckmann, Oscar Higgott","submitted_at":"2023-08-07T17:54:45Z","abstract_excerpt":"We construct families of Floquet codes derived from colour code tilings of closed hyperbolic surfaces. These codes have weight-two check operators, a finite encoding rate and can be decoded efficiently with minimum-weight perfect matching. We also construct semi-hyperbolic Floquet codes, which have improved distance scaling, and are obtained via a fine-graining procedure. Using a circuit-based noise model that assumes direct two-qubit measurements, we show that semi-hyperbolic Floquet codes can be $48\\times$ more efficient than planar honeycomb codes and therefore over $100\\times$ more efficie"},"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":"2308.03750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-07T17:54:45Z","cross_cats_sorted":[],"title_canon_sha256":"9822134bf638e4c9b1f2eefa4b43c1cc04a79764702ea77f9023e1c04397375d","abstract_canon_sha256":"d0f95e8112e8acb1539e6af908bb6e1a8501de0e359a07580faa437b501d0e25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:04.239744Z","signature_b64":"SNuKvv8EAb704pqF5WUEzI3zsJzemSpZ96j4Rd0K+vbdAbI6rIJDnF13XiCwWGMhGEe6bzRZMSpyqA5U6uXmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f92f76b5193df04159a3669e2d7c934035ccdeac4413a25657a09a33009c3844","last_reissued_at":"2026-07-05T09:39:04.239267Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:04.239267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nikolas P. Breuckmann, Oscar Higgott","submitted_at":"2023-08-07T17:54:45Z","abstract_excerpt":"We construct families of Floquet codes derived from colour code tilings of closed hyperbolic surfaces. These codes have weight-two check operators, a finite encoding rate and can be decoded efficiently with minimum-weight perfect matching. We also construct semi-hyperbolic Floquet codes, which have improved distance scaling, and are obtained via a fine-graining procedure. Using a circuit-based noise model that assumes direct two-qubit measurements, we show that semi-hyperbolic Floquet codes can be $48\\times$ more efficient than planar honeycomb codes and therefore over $100\\times$ more efficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.03750","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/2308.03750/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":"2308.03750","created_at":"2026-07-05T09:39:04.239325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.03750v2","created_at":"2026-07-05T09:39:04.239325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.03750","created_at":"2026-07-05T09:39:04.239325+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EXXNNIZHXYE","created_at":"2026-07-05T09:39:04.239325+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EXXNNIZHXYECWND","created_at":"2026-07-05T09:39:04.239325+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EXXNNIZ","created_at":"2026-07-05T09:39:04.239325+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2407.16176","citing_title":"Quantum memory based on concatenating surface codes and quantum Hamming codes","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2501.06407","citing_title":"A graph-based approach to entanglement entropy of quantum error correcting codes","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7EXXNNIZHXYECWNDM2PC27ETIA","json":"https://pith.science/pith/7EXXNNIZHXYECWNDM2PC27ETIA.json","graph_json":"https://pith.science/api/pith-number/7EXXNNIZHXYECWNDM2PC27ETIA/graph.json","events_json":"https://pith.science/api/pith-number/7EXXNNIZHXYECWNDM2PC27ETIA/events.json","paper":"https://pith.science/paper/7EXXNNIZ"},"agent_actions":{"view_html":"https://pith.science/pith/7EXXNNIZHXYECWNDM2PC27ETIA","download_json":"https://pith.science/pith/7EXXNNIZHXYECWNDM2PC27ETIA.json","view_paper":"https://pith.science/paper/7EXXNNIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.03750&json=true","fetch_graph":"https://pith.science/api/pith-number/7EXXNNIZHXYECWNDM2PC27ETIA/graph.json","fetch_events":"https://pith.science/api/pith-number/7EXXNNIZHXYECWNDM2PC27ETIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EXXNNIZHXYECWNDM2PC27ETIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EXXNNIZHXYECWNDM2PC27ETIA/action/storage_attestation","attest_author":"https://pith.science/pith/7EXXNNIZHXYECWNDM2PC27ETIA/action/author_attestation","sign_citation":"https://pith.science/pith/7EXXNNIZHXYECWNDM2PC27ETIA/action/citation_signature","submit_replication":"https://pith.science/pith/7EXXNNIZHXYECWNDM2PC27ETIA/action/replication_record"}},"created_at":"2026-07-05T09:39:04.239325+00:00","updated_at":"2026-07-05T09:39:04.239325+00:00"}