{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZPPAEP2Z6SKZDG7RJIA2Y3VXCI","short_pith_number":"pith:ZPPAEP2Z","schema_version":"1.0","canonical_sha256":"cbde023f59f495919bf14a01ac6eb71209d04bd6f0a0c743761ccc39e27470ef","source":{"kind":"arxiv","id":"1703.00590","version":2},"attestation_state":"computed","paper":{"title":"Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anirudh Krishna, Barbara M. Terhal, Christophe Vuillot, Earl Campbell, Nikolas P. Breuckmann","submitted_at":"2017-03-02T02:31:10Z","abstract_excerpt":"We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give numerical evidence for a noise threshold of 1.3% for the {4,5}-hyperbolic surface code in a phenomenological noise model (as compared to 2.9% for the toric code). In this code family parity checks are of weight 4 and 5 while each qubit participates in 4 different parity checks. We introduce a family of semi-hyperbolic codes which interpolate between the toric code and the {4,5}-hyperbolic surface code in terms of encoding rate and threshold. We show how these hyperbolic codes outperform the tori"},"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":"1703.00590","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-02T02:31:10Z","cross_cats_sorted":[],"title_canon_sha256":"275503f868daa49eb26d09e887f374a81625c7b693db3de2b237215980b38722","abstract_canon_sha256":"b6c56c9dedfc4a6224c5a4017bf0e13ed3be1159577fb7a67b935f0b80f0ff5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:28.261469Z","signature_b64":"Al5HnPaGtwa8BKelaQwck1k6L+XE5ruUtJQHOKa+TZIfZut0SCGmeLfGAorIoAfYZ71FuU0nHMdG3Yu0NOYnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbde023f59f495919bf14a01ac6eb71209d04bd6f0a0c743761ccc39e27470ef","last_reissued_at":"2026-05-18T00:38:28.260779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:28.260779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anirudh Krishna, Barbara M. Terhal, Christophe Vuillot, Earl Campbell, Nikolas P. Breuckmann","submitted_at":"2017-03-02T02:31:10Z","abstract_excerpt":"We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give numerical evidence for a noise threshold of 1.3% for the {4,5}-hyperbolic surface code in a phenomenological noise model (as compared to 2.9% for the toric code). In this code family parity checks are of weight 4 and 5 while each qubit participates in 4 different parity checks. We introduce a family of semi-hyperbolic codes which interpolate between the toric code and the {4,5}-hyperbolic surface code in terms of encoding rate and threshold. We show how these hyperbolic codes outperform the tori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00590","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":""},"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":"1703.00590","created_at":"2026-05-18T00:38:28.260874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00590v2","created_at":"2026-05-18T00:38:28.260874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00590","created_at":"2026-05-18T00:38:28.260874+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPPAEP2Z6SKZ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPPAEP2Z6SKZDG7R","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPPAEP2Z","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.07800","citing_title":"Systematic Approach to Hyperbolic Quantum Error Correction Codes","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14335","citing_title":"Hofstadter's Butterfly in AdS$_3$ Black Holes","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI","json":"https://pith.science/pith/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI.json","graph_json":"https://pith.science/api/pith-number/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI/graph.json","events_json":"https://pith.science/api/pith-number/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI/events.json","paper":"https://pith.science/paper/ZPPAEP2Z"},"agent_actions":{"view_html":"https://pith.science/pith/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI","download_json":"https://pith.science/pith/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI.json","view_paper":"https://pith.science/paper/ZPPAEP2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00590&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI/action/storage_attestation","attest_author":"https://pith.science/pith/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI/action/author_attestation","sign_citation":"https://pith.science/pith/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI/action/citation_signature","submit_replication":"https://pith.science/pith/ZPPAEP2Z6SKZDG7RJIA2Y3VXCI/action/replication_record"}},"created_at":"2026-05-18T00:38:28.260874+00:00","updated_at":"2026-05-18T00:38:28.260874+00:00"}