{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NDRUI6XTJWKND3A2Y2V755ZEHO","short_pith_number":"pith:NDRUI6XT","schema_version":"1.0","canonical_sha256":"68e3447af34d94d1ec1ac6abfef7243b917a99d56305c950abff6dadd4ed9604","source":{"kind":"arxiv","id":"1812.08186","version":3},"attestation_state":"computed","paper":{"title":"Tailoring surface codes for highly biased noise","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew S. Darmawan, Christopher T. Chubb, David K. Tuckett, Sergey Bravyi, Stephen D. Bartlett, Steven T. Flammia","submitted_at":"2018-12-19T19:00:13Z","abstract_excerpt":"The surface code, with a simple modification, exhibits ultra-high error correction thresholds when the noise is biased towards dephasing. Here, we identify features of the surface code responsible for these ultra-high thresholds. We provide strong evidence that the threshold error rate of the surface code tracks the hashing bound exactly for all biases, and show how to exploit these features to achieve significant improvement in logical failure rate. First, we consider the infinite bias limit, meaning pure dephasing. We prove that the error threshold of the modified surface code for pure depha"},"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":"1812.08186","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-12-19T19:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"227bbf94bb2a3fc2fc83a67950ee4d068d09ab439a025c5b3f4487322da5f7d0","abstract_canon_sha256":"af0185ce250700fa6c3c5f638db061d84f4aa6a4856b321f30156d2fb6b8a5ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:06.598788Z","signature_b64":"WlB0QP9nnkCPIp6lQoplcy+KrlwLLWly2MOtlFKJEUwBGAUyPBJTvpBqnDtlBdNjf0JP54aSQWnXALp2u+dJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e3447af34d94d1ec1ac6abfef7243b917a99d56305c950abff6dadd4ed9604","last_reissued_at":"2026-07-05T00:19:06.598177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:06.598177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tailoring surface codes for highly biased noise","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew S. Darmawan, Christopher T. Chubb, David K. Tuckett, Sergey Bravyi, Stephen D. Bartlett, Steven T. Flammia","submitted_at":"2018-12-19T19:00:13Z","abstract_excerpt":"The surface code, with a simple modification, exhibits ultra-high error correction thresholds when the noise is biased towards dephasing. Here, we identify features of the surface code responsible for these ultra-high thresholds. We provide strong evidence that the threshold error rate of the surface code tracks the hashing bound exactly for all biases, and show how to exploit these features to achieve significant improvement in logical failure rate. First, we consider the infinite bias limit, meaning pure dephasing. We prove that the error threshold of the modified surface code for pure depha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08186","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/1812.08186/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":"1812.08186","created_at":"2026-07-05T00:19:06.598245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.08186v3","created_at":"2026-07-05T00:19:06.598245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08186","created_at":"2026-07-05T00:19:06.598245+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDRUI6XTJWKN","created_at":"2026-07-05T00:19:06.598245+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDRUI6XTJWKND3A2","created_at":"2026-07-05T00:19:06.598245+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDRUI6XT","created_at":"2026-07-05T00:19:06.598245+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2201.07254","citing_title":"Free-Fermion Subsystem Codes","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDRUI6XTJWKND3A2Y2V755ZEHO","json":"https://pith.science/pith/NDRUI6XTJWKND3A2Y2V755ZEHO.json","graph_json":"https://pith.science/api/pith-number/NDRUI6XTJWKND3A2Y2V755ZEHO/graph.json","events_json":"https://pith.science/api/pith-number/NDRUI6XTJWKND3A2Y2V755ZEHO/events.json","paper":"https://pith.science/paper/NDRUI6XT"},"agent_actions":{"view_html":"https://pith.science/pith/NDRUI6XTJWKND3A2Y2V755ZEHO","download_json":"https://pith.science/pith/NDRUI6XTJWKND3A2Y2V755ZEHO.json","view_paper":"https://pith.science/paper/NDRUI6XT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.08186&json=true","fetch_graph":"https://pith.science/api/pith-number/NDRUI6XTJWKND3A2Y2V755ZEHO/graph.json","fetch_events":"https://pith.science/api/pith-number/NDRUI6XTJWKND3A2Y2V755ZEHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDRUI6XTJWKND3A2Y2V755ZEHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDRUI6XTJWKND3A2Y2V755ZEHO/action/storage_attestation","attest_author":"https://pith.science/pith/NDRUI6XTJWKND3A2Y2V755ZEHO/action/author_attestation","sign_citation":"https://pith.science/pith/NDRUI6XTJWKND3A2Y2V755ZEHO/action/citation_signature","submit_replication":"https://pith.science/pith/NDRUI6XTJWKND3A2Y2V755ZEHO/action/replication_record"}},"created_at":"2026-07-05T00:19:06.598245+00:00","updated_at":"2026-07-05T00:19:06.598245+00:00"}