{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5UUYRG7FTICD4WH54KFW5DWIOV","short_pith_number":"pith:5UUYRG7F","schema_version":"1.0","canonical_sha256":"ed29889be59a043e58fde28b6e8ec8755296e59a6bb258e1d9d4bdb4410db6cc","source":{"kind":"arxiv","id":"1812.08451","version":5},"attestation_state":"computed","paper":{"title":"Optimizing Quantum Error Correction Codes with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Hans J. Briegel, Hendrik Poulsen Nautrup, Nicolai Friis, Nicolas Delfosse, Vedran Dunjko","submitted_at":"2018-12-20T09:54:05Z","abstract_excerpt":"Quantum error correction is widely thought to be the key to fault-tolerant quantum computation. However, determining the most suited encoding for unknown error channels or specific laboratory setups is highly challenging. Here, we present a reinforcement learning framework for optimizing and fault-tolerantly adapting quantum error correction codes. We consider a reinforcement learning agent tasked with modifying a family of surface code quantum memories until a desired logical error rate is reached. Using efficient simulations with about 70 data qubits with arbitrary connectivity, we demonstra"},"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.08451","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-12-20T09:54:05Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9bde8f5f8b861b15575fcfe597f46c14b305d3fb7b864f2f98bcc1836f5ecb7c","abstract_canon_sha256":"45b8a913860676340346f52012527ff1528f268ab47508e81b6dc296fd6f5b65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:00.986487Z","signature_b64":"RQCEL8rkG03f/I5WGgYxHiWQMDX04DqdIAxxq+IAcl9BlwOm8Em5Kz2Ii26szZCSRbGz/tY5eV/pee0KWlfFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed29889be59a043e58fde28b6e8ec8755296e59a6bb258e1d9d4bdb4410db6cc","last_reissued_at":"2026-07-05T00:54:00.986135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:00.986135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Quantum Error Correction Codes with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Hans J. Briegel, Hendrik Poulsen Nautrup, Nicolai Friis, Nicolas Delfosse, Vedran Dunjko","submitted_at":"2018-12-20T09:54:05Z","abstract_excerpt":"Quantum error correction is widely thought to be the key to fault-tolerant quantum computation. However, determining the most suited encoding for unknown error channels or specific laboratory setups is highly challenging. Here, we present a reinforcement learning framework for optimizing and fault-tolerantly adapting quantum error correction codes. We consider a reinforcement learning agent tasked with modifying a family of surface code quantum memories until a desired logical error rate is reached. Using efficient simulations with about 70 data qubits with arbitrary connectivity, we demonstra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08451","kind":"arxiv","version":5},"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.08451/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.08451","created_at":"2026-07-05T00:54:00.986192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.08451v5","created_at":"2026-07-05T00:54:00.986192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08451","created_at":"2026-07-05T00:54:00.986192+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UUYRG7FTICD","created_at":"2026-07-05T00:54:00.986192+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UUYRG7FTICD4WH5","created_at":"2026-07-05T00:54:00.986192+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UUYRG7F","created_at":"2026-07-05T00:54:00.986192+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/5UUYRG7FTICD4WH54KFW5DWIOV","json":"https://pith.science/pith/5UUYRG7FTICD4WH54KFW5DWIOV.json","graph_json":"https://pith.science/api/pith-number/5UUYRG7FTICD4WH54KFW5DWIOV/graph.json","events_json":"https://pith.science/api/pith-number/5UUYRG7FTICD4WH54KFW5DWIOV/events.json","paper":"https://pith.science/paper/5UUYRG7F"},"agent_actions":{"view_html":"https://pith.science/pith/5UUYRG7FTICD4WH54KFW5DWIOV","download_json":"https://pith.science/pith/5UUYRG7FTICD4WH54KFW5DWIOV.json","view_paper":"https://pith.science/paper/5UUYRG7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.08451&json=true","fetch_graph":"https://pith.science/api/pith-number/5UUYRG7FTICD4WH54KFW5DWIOV/graph.json","fetch_events":"https://pith.science/api/pith-number/5UUYRG7FTICD4WH54KFW5DWIOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UUYRG7FTICD4WH54KFW5DWIOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UUYRG7FTICD4WH54KFW5DWIOV/action/storage_attestation","attest_author":"https://pith.science/pith/5UUYRG7FTICD4WH54KFW5DWIOV/action/author_attestation","sign_citation":"https://pith.science/pith/5UUYRG7FTICD4WH54KFW5DWIOV/action/citation_signature","submit_replication":"https://pith.science/pith/5UUYRG7FTICD4WH54KFW5DWIOV/action/replication_record"}},"created_at":"2026-07-05T00:54:00.986192+00:00","updated_at":"2026-07-05T00:54:00.986192+00:00"}