{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MGPU6VTJW6RL4L3DG57VQCF4LL","short_pith_number":"pith:MGPU6VTJ","schema_version":"1.0","canonical_sha256":"619f4f5669b7a2be2f63377f5808bc5af79ef44e7a13a6d70b5020e5260a022e","source":{"kind":"arxiv","id":"1907.02554","version":2},"attestation_state":"computed","paper":{"title":"Fault-tolerant thresholds for the surface code in excess of 5% under biased noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Benjamin J. Brown, David K. Tuckett, Stephen D. Bartlett, Steven T. Flammia","submitted_at":"2019-07-04T18:19:38Z","abstract_excerpt":"Noise in quantum computing is countered with quantum error correction. Achieving optimal performance will require tailoring codes and decoding algorithms to account for features of realistic noise, such as the common situation where the noise is biased towards dephasing. Here we introduce an efficient high-threshold decoder for a noise-tailored surface code based on minimum-weight perfect matching. The decoder exploits the symmetries of its syndrome under the action of biased noise and generalises to the fault-tolerant regime where measurements are unreliable. Using this decoder, we obtain fau"},"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":"1907.02554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-04T18:19:38Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"30aac7cffbe21f55b25ea0a7c4238bf32d22e284a0f86edef446a0f5f4d838cd","abstract_canon_sha256":"5c9fe4352c2511bc9e082182d93d8aee5553bb893658b239da2e20b72de98a1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:51:52.080559Z","signature_b64":"MiAVoEoo64X8MGkqsIWYBDXa4ZR0tYfEnP+T+JDA+M+8khyh7fMSKBmpcV1ECEnME14jSuoz61nik/tzv2+4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"619f4f5669b7a2be2f63377f5808bc5af79ef44e7a13a6d70b5020e5260a022e","last_reissued_at":"2026-07-05T00:51:52.080083Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:51:52.080083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant thresholds for the surface code in excess of 5% under biased noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Benjamin J. Brown, David K. Tuckett, Stephen D. Bartlett, Steven T. Flammia","submitted_at":"2019-07-04T18:19:38Z","abstract_excerpt":"Noise in quantum computing is countered with quantum error correction. Achieving optimal performance will require tailoring codes and decoding algorithms to account for features of realistic noise, such as the common situation where the noise is biased towards dephasing. Here we introduce an efficient high-threshold decoder for a noise-tailored surface code based on minimum-weight perfect matching. The decoder exploits the symmetries of its syndrome under the action of biased noise and generalises to the fault-tolerant regime where measurements are unreliable. Using this decoder, we obtain fau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02554","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/1907.02554/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":"1907.02554","created_at":"2026-07-05T00:51:52.080142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02554v2","created_at":"2026-07-05T00:51:52.080142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02554","created_at":"2026-07-05T00:51:52.080142+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGPU6VTJW6RL","created_at":"2026-07-05T00:51:52.080142+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGPU6VTJW6RL4L3D","created_at":"2026-07-05T00:51:52.080142+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGPU6VTJ","created_at":"2026-07-05T00:51:52.080142+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":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MGPU6VTJW6RL4L3DG57VQCF4LL","json":"https://pith.science/pith/MGPU6VTJW6RL4L3DG57VQCF4LL.json","graph_json":"https://pith.science/api/pith-number/MGPU6VTJW6RL4L3DG57VQCF4LL/graph.json","events_json":"https://pith.science/api/pith-number/MGPU6VTJW6RL4L3DG57VQCF4LL/events.json","paper":"https://pith.science/paper/MGPU6VTJ"},"agent_actions":{"view_html":"https://pith.science/pith/MGPU6VTJW6RL4L3DG57VQCF4LL","download_json":"https://pith.science/pith/MGPU6VTJW6RL4L3DG57VQCF4LL.json","view_paper":"https://pith.science/paper/MGPU6VTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02554&json=true","fetch_graph":"https://pith.science/api/pith-number/MGPU6VTJW6RL4L3DG57VQCF4LL/graph.json","fetch_events":"https://pith.science/api/pith-number/MGPU6VTJW6RL4L3DG57VQCF4LL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGPU6VTJW6RL4L3DG57VQCF4LL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGPU6VTJW6RL4L3DG57VQCF4LL/action/storage_attestation","attest_author":"https://pith.science/pith/MGPU6VTJW6RL4L3DG57VQCF4LL/action/author_attestation","sign_citation":"https://pith.science/pith/MGPU6VTJW6RL4L3DG57VQCF4LL/action/citation_signature","submit_replication":"https://pith.science/pith/MGPU6VTJW6RL4L3DG57VQCF4LL/action/replication_record"}},"created_at":"2026-07-05T00:51:52.080142+00:00","updated_at":"2026-07-05T00:51:52.080142+00:00"}