{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D5GMYIBPOR2FB6UTHJO5TSWGLE","short_pith_number":"pith:D5GMYIBP","schema_version":"1.0","canonical_sha256":"1f4ccc202f747450fa933a5dd9cac6592e8fd947ff0ea29d8071ebbb437f67ed","source":{"kind":"arxiv","id":"1705.07855","version":3},"attestation_state":"computed","paper":{"title":"Machine-learning-assisted correction of correlated qubit errors in a topological code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"B. Tarasinski, C. W. J. Beenakker, P. Baireuther, T. E. O'Brien","submitted_at":"2017-05-22T17:00:38Z","abstract_excerpt":"A fault-tolerant quantum computation requires an efficient means to detect and correct errors that accumulate in encoded quantum information. In the context of machine learning, neural networks are a promising new approach to quantum error correction. Here we show that a recurrent neural network can be trained, using only experimentally accessible data, to detect errors in a widely used topological code, the surface code, with a performance above that of the established minimum-weight perfect matching (or blossom) decoder. The performance gain is achieved because the neural network decoder can"},"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":"1705.07855","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2017-05-22T17:00:38Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"a79ab6ad9b899474c4334fae9de0a0136ac68c836c5e3a404e800c91d55740d1","abstract_canon_sha256":"945c152b305e7e3931967faee319be4920e91538af23666a146e9b490c0fd6dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:42.842121Z","signature_b64":"LiioOm2ppRE1btU1trFq1Kpi0ynmzPbVBjxRz2j/9vpLyooFKSY/Riz2ihd29KTDn53V2I9yKQ+AYe1j8erzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f4ccc202f747450fa933a5dd9cac6592e8fd947ff0ea29d8071ebbb437f67ed","last_reissued_at":"2026-05-18T00:24:42.841439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:42.841439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Machine-learning-assisted correction of correlated qubit errors in a topological code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"B. Tarasinski, C. W. J. Beenakker, P. Baireuther, T. E. O'Brien","submitted_at":"2017-05-22T17:00:38Z","abstract_excerpt":"A fault-tolerant quantum computation requires an efficient means to detect and correct errors that accumulate in encoded quantum information. In the context of machine learning, neural networks are a promising new approach to quantum error correction. Here we show that a recurrent neural network can be trained, using only experimentally accessible data, to detect errors in a widely used topological code, the surface code, with a performance above that of the established minimum-weight perfect matching (or blossom) decoder. The performance gain is achieved because the neural network decoder can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07855","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":""},"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":"1705.07855","created_at":"2026-05-18T00:24:42.841533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07855v3","created_at":"2026-05-18T00:24:42.841533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07855","created_at":"2026-05-18T00:24:42.841533+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5GMYIBPOR2F","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5GMYIBPOR2FB6UT","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5GMYIBP","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D5GMYIBPOR2FB6UTHJO5TSWGLE","json":"https://pith.science/pith/D5GMYIBPOR2FB6UTHJO5TSWGLE.json","graph_json":"https://pith.science/api/pith-number/D5GMYIBPOR2FB6UTHJO5TSWGLE/graph.json","events_json":"https://pith.science/api/pith-number/D5GMYIBPOR2FB6UTHJO5TSWGLE/events.json","paper":"https://pith.science/paper/D5GMYIBP"},"agent_actions":{"view_html":"https://pith.science/pith/D5GMYIBPOR2FB6UTHJO5TSWGLE","download_json":"https://pith.science/pith/D5GMYIBPOR2FB6UTHJO5TSWGLE.json","view_paper":"https://pith.science/paper/D5GMYIBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07855&json=true","fetch_graph":"https://pith.science/api/pith-number/D5GMYIBPOR2FB6UTHJO5TSWGLE/graph.json","fetch_events":"https://pith.science/api/pith-number/D5GMYIBPOR2FB6UTHJO5TSWGLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5GMYIBPOR2FB6UTHJO5TSWGLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5GMYIBPOR2FB6UTHJO5TSWGLE/action/storage_attestation","attest_author":"https://pith.science/pith/D5GMYIBPOR2FB6UTHJO5TSWGLE/action/author_attestation","sign_citation":"https://pith.science/pith/D5GMYIBPOR2FB6UTHJO5TSWGLE/action/citation_signature","submit_replication":"https://pith.science/pith/D5GMYIBPOR2FB6UTHJO5TSWGLE/action/replication_record"}},"created_at":"2026-05-18T00:24:42.841533+00:00","updated_at":"2026-05-18T00:24:42.841533+00:00"}